Efficient Computation of Minimal and Maximal Backward Reachable Sets for Perturbed Continuous-Time Linear Systems

The core message of this article is to present efficient algorithms for computing inner and outer approximations of the minimal and maximal backward reachable sets for perturbed continuous-time linear systems. The proposed approaches scale polynomially with the state dimension, enabling the analysis of high-dimensional systems.