Strongly convex attainable sets and low complexity finite-state controllers

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.

[1]  Gunther Reissig,et al.  Convexity of reachable sets of nonlinear ordinary differential equations , 2012, ArXiv.

[2]  Olaf Stursberg,et al.  On-the-fly model abstraction for controller synthesis , 2012, 2012 American Control Conference (ACC).

[3]  G. Reissig,et al.  Local characterization of strongly convex sets , 2012, 1207.4347.

[4]  G. Reissig,et al.  Convexity of reachable sets of nonlinear discrete-time systems , 2007 .

[5]  Gunther Reissig,et al.  Abstraction based solution of complex attainability problems for decomposable continuous plants , 2010, 49th IEEE Conference on Decision and Control (CDC).

[6]  G. Reissig.  Convexity of reachable sets of nonlinear ordinary differential equations , 2012, ArXiv.

[7]  Dušan D. Repovš,et al.  Uniform convexity and the splitting problem for selections , 2009, 0908.1216.

[8]  Anton E. Mayer.  Eine Überkonvexität , 1935 .

[9]  Yurii Nesterov,et al.  Generalized Power Method for Sparse Principal Component Analysis , 2008, J. Mach. Learn. Res..

[10]  Vladimir M. Veliov.  Second order discrete approximations to strongly convex differential inclusions , 1989 .

[11]  Manuel Mazo,et al.  Specification-guided controller synthesis for linear systems and safe linear-time temporal logic , 2013, HSCC '13.

[12]  Paulo Tabuada,et al.  Verification and Control of Hybrid Systems , 2009 .

[13]  A. Pliś.  Uniqueness of optimal trajectories for non-linear control systems , 1975 .

[14]  Gunther Reissig,et al.  Computing Abstractions of Nonlinear Systems , 2009, IEEE Transactions on Automatic Control.

[15]  Gunther Reissig,et al.  Abstraction-based solution of optimal stopping problems under uncertainty , 2013, 52nd IEEE Conference on Decision and Control.

[16]  E. Polovinkin.  Strongly convex analysis , 1996 .