scholarly journals On Asymptotics of Small-Time Reachable Sets for Nonlinear Systems with Isoperimetric Constraints

2021 ◽  
Vol 54 (14) ◽  
pp. 173-178
Author(s):  
Mikhail I. Gusev
1989 ◽  
Vol 27 (1) ◽  
pp. 120-147 ◽  
Author(s):  
Arthur J. Krener ◽  
Heinz Schättler

2020 ◽  
Vol 6 (1) ◽  
pp. 71
Author(s):  
Mikhail I. Gusev

The reachable sets of nonlinear systems are usually quite complicated. They, as a rule, are non-convex and arranged to have rather complex behavior. In this paper, the asymptotic behavior of reachable sets of nonlinear control-affine systems on small time intervals is studied. We assume that the initial state of the system is fixed, and the control is bounded in the \(\mathbb{L}_2\)-norm. The subject of the study is the applicability of the linearization method for a sufficiently small length of the time interval. We provide sufficient conditions under which the reachable set of a nonlinear system is convex and asymptotically equal to the reachable set of a linearized system. The concept of asymptotic equality is defined in terms of the Banach-Mazur metric in the space of sets.  The conditions depend on the behavior of the controllability Gramian of the linearized system – the smallest eigenvalue of the Gramian should not tend to zero too quickly when the length of the time interval tends to zero.  The indicated asymptotic behavior occurs for a reasonably wide class of second-order nonlinear control systems but can be violated for systems of higher dimension.  The results of numerical simulation illustrate the theoretical conclusions of the paper.


Automatica ◽  
2006 ◽  
Vol 42 (10) ◽  
pp. 1745-1751 ◽  
Author(s):  
J.M. Bravo ◽  
T. Alamo ◽  
E.F. Camacho

10.29007/rs5n ◽  
2020 ◽  
Author(s):  
Edward Kim ◽  
Parasara Sridhar Duggirala

Reachable set computation is one of the many widely-used techniques for the verification of safety properties of dynamical systems. One of the simplest algorithms for computing reachable sets for discrete nonlinear systems uses parallelotope bundles and Bernstein polynomials. In this paper, we describe Kaa, a terse Python implementation of reachable set computation which leverages the widely used symbolic package sympy. Additionally, we simplify the user interface and provide easy-to-use plotting utilities. We believe that our tool has pedagogical value given the simplicity of the implementation and its user- friendliness.


Sign in / Sign up

Export Citation Format

Share Document