Reachability analysis of nonlinear systems using conservative approximation

122Citations
Citations of this article
74Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we present an approach to approximate reachability computation for nonlinear continuous systems. Rather than studying a complex nonlinear system ẋ = g(x), we study an approximating system ẋ = f(x) which is easier to handle. The class of approximating systems we consider in this paper is piecewise linear, obtained by interpolating g over a mesh. In order to be conservative, we add a bounded input in the approximating system to account for the interpolation error. We thus develop a reachability method for systems with input, based on the relation between such systems and the corresponding autonomous systems in terms of reachable sets. This method is then extended to the approximate piecewise linear systems arising in our construction. The final result is a reachability algorithm for nonlinear continuous systems which allows to compute conservative approximations with as great degree of accuracy as desired, and more importantly, it has good convergence rate. If g is a C2 function, our method is of order 2. Furthermore, the method can be straightforwardly extended to hybrid systems. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Asarin, E., Dang, T., & Girard, A. (2003). Reachability analysis of nonlinear systems using conservative approximation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2623, 20–35. https://doi.org/10.1007/3-540-36580-x_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free