A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems

Titelangaben

Ernst, Andreas ; Grüne, Lars ; Rieger, Janosch:
A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems.
In: Journal of Global Optimization. Bd. 86 (2023) . - S. 521-543.
ISSN 1573-2916
DOI: https://doi.org/10.1007/s10898-022-01261-w

Volltext

Link zum Volltext (externe URL):

Weitere URLs

Abstract

The infinite time reachable set of a strictly stable linear control system is the Hausdorff limit of the finite time reachable set of the origin as time tends to infinity. By definition, it encodes useful information on the long-term behavior of the control system. Its characterization as a limit set gives rise to numerical methods for its computation that are based on forward iteration of approximate finite time reachable sets. These methods tend to be computationally expensive, because they essentially perform a Minkowski sum in every single forward step. We develop a new approach to computing the infinite time reachable set that is based on the invariance properties of the control system and the desired set. These allow us to characterize a polyhedral outer approximation as the unique solution to a linear program with constraints that incorporate the system dynamics. In particular, this approach does not rely on forward iteration of finite time reachable sets.