Scalable Zonotopic Under-approximation of Backward Reachable Sets for Uncertain Linear Systems
Authors:
- Liren YangLYLiren Yang
- Necmiye OzayNONecmiye Ozay
Preprint
Abstract
Zonotopes are widely used for over-approximating forward reachable sets of uncertain linear systems for verification purposes. In this paper, we use zonotopes to achieve more scalable algorithms that under-approximate backward reachable sets of uncertain linear systems for control design. The main difference is that the backward reachability analysis is a two-player game and involves Minkowski difference operations, but zonotopes are not closed under such operations. We under-approximate this Minkowski difference with a zonotope, which can be obtained by solving a linear optimization problem. We further develop an efficient zonotope order reduction technique to bound the complexity of the obtained zonotopic under-approximations. The proposed approach is evaluated against existing approaches using randomly generated instances and illustrated with several examples.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Efficient Safety Control Synthesis with Imperfect State Information2020
- Linear Encodings for Polytope Containment Problems2019
- A comparison of zonotope order reduction techniquesAutomatica, 2018
- Methods for order reduction of zonotopes2017
- Interdependence quantification for compositional control synthesis with an application in vehicle safety systems2016
- On enlarging backward reachable sets via Zonotopic set membership2016
- Reach set computation and control synthesis for discrete-time dynamical systems with disturbancesAutomatica, 2011
- Determinants and the volumes of parallelotopes and zonotopesLinear Algebra and its Applications, 2010
- Controllers for reachability specifications for hybrid systemsAutomatica, 1999
- Infinite time reachability of state-space regions by using feedback controlIEEE Transactions on Automatic Control, 1972