Alexander Weber,
Gunther Reissig.
Strongly convex attainable sets and low complexity finite-state controllers.
Proc. Australian Control Conference (AUCC), Perth, Australia,
4-5 Nov. 2013, pp. 61-66.
Full text.
(Definitive publication; restricted access.)
Full text.
(Free access.)
Abstract:
We present several novel results related to the concept
of strong convexity, culminating in sufficient conditions for
attainable sets of continuous-time nonlinear dynamical systems
to be strongly convex. Based on these results, we propose a
method to over-approximate attainable sets by intersections of
supporting balls, which greatly improves upon the accuracy of
previously proposed approximations based on supporting halfspaces.
The latter advantage can be exploited, for example,
when the method is used in algorithms that compute discrete
abstractions of continuous plants. As we demonstrate by an
example, the design of finite-state controllers can then be based
on coarser state space quantizations, which directly translates
into a reduced complexity of the controllers.
BibTeX entry:
@InProceedings{WeberReissig14C,
author = {Alexander Weber and Gunther Reissig},
title = {Strongly convex attainable sets and low complexity finite-state controllers},
booktitle = {Proc. Australian Control Conf. (AUCC), Perth, Australia, 4-5 } # nov # { 2013},
PAGES = {61-66},
YEAR = 2013,
doi = {10.1109/AUCC.2013.6697248}
}
Impressum und Haftungsausschluß