IEEE Transactions on Automatic Control, Vol.66, No.3, 1414-1421, 2021
Over- and Under-Approximations of Reachable Sets With Series Representations of Evolution Functions
In this article, we investigate both over- and under-approximations of reachable sets for analytic autonomous dynamical systems beyond polynomial dynamics. We start with the concept of evolution function, whose subzero-level set can be used to describe reachable set, and find a series representation of the evolution function with its Lie derivatives. Afterwards, based on the partial sums of this series, two different methodologies are introduced to compute over- and under-approximations of reachable sets, using numerical quantifier elimination for the semi-algebraic constraints and remainder estimation of the partial sum, respectively. Some benchmarks are given, including an eight-dimensional nonpolynomial quadrotor model, to show the advantages of our computational methods over some existing methods in the literature. Especially, our methods also work for nonconvex initial sets.
Keywords:Level set;Safety;Taylor series;Benchmark testing;Computational modeling;Estimation;Programming;Evolution functions;Lie derivatives;over;and under-approximations;partial sums of series;reachable sets