Skip to Main content Skip to Navigation
New interface
Journal articles

Set Propagation Techniques for Reachability Analysis

Abstract : Reachability analysis consists in computing the set of states that are reachable by a dynamical system from all initial states and for all admissible inputs and parameters. It is a fundamental problem motivated by many applications in formal verification, controller synthesis, and estimation, to name only a few. This paper focuses on a class of methods for computing a guaranteed over-approximation of the reachable set of continuous and hybrid systems, relying predominantly on set propagation: starting from the set of initial states, these techniques iteratively propagate a sequence of sets according to the system dynamics. After a review on set representation and computation, the paper presents the state of the art on set propagation techniques for reachability analysis of linear, nonlinear, and hybrid systems. The paper ends with a discussion on successful applications of reachability analysis to real world-problems. Contents
Complete list of metadata
Contributor : Antoine Girard Connect in order to contact the contributor
Submitted on : Wednesday, December 9, 2020 - 11:05:42 AM
Last modification on : Wednesday, May 11, 2022 - 3:20:03 PM
Long-term archiving on: : Wednesday, March 10, 2021 - 6:49:13 PM


Files produced by the author(s)



Matthias Althoff, Goran Frehse, Antoine Girard. Set Propagation Techniques for Reachability Analysis. Annual Review of Control, Robotics, and Autonomous Systems , 2021, 4 (1), ⟨10.1146/annurev-control-071420-081941⟩. ⟨hal-03048155⟩



Record views


Files downloads