On convexity of small-time reachable sets of nonlinear control systems

2Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The convexity of reachable sets plays an essential role in the development of algorithms for solving optimal control problems and problems of feedback control. For nonlinear control systems the reachable sets are generally not convex and may have a rather complicated structure. However, for systems with integral quadratic constraints on the control B. Polyak showed that the reachable sets are convex if the linearization of the system is controllable and control inputs are restricted from above in L2 norm by a sufficiently small number. In the present paper we use this result to prove sufficient conditions for the convexity of reachable sets of a nonlinear control-affine system on small time intervals, assuming that control resources are limited by a given (not necessarily small) value. These conditions are based on the asymptotics for the minimal eigenvalue of the controllability Gramian of system linearization as a function of the length of the time interval. We prove the asymptotics for a linear time-invariant system containing a small parameter that implies the convexity of small-time reachable sets for some classes of two-dimensional nonlinear control systems. The results of numerical simulations for illustrative examples are discussed.

Cite

CITATION STYLE

APA

Gusev, M. I., & Osipov, I. O. (2019). On convexity of small-time reachable sets of nonlinear control systems. In AIP Conference Proceedings (Vol. 2164). American Institute of Physics Inc. https://doi.org/10.1063/1.5130809

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free