Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations

Abstract : In this paper we propose a new method for reachability analysis of the class of discrete-time polynomial dynamical systems. Our work is based on the approach combining the use of template polyhedra and optimization [25, 7]. These problems are non-convex and are therefore generally difficult to solve exactly. Using the Bernstein form of polynomials, we define a set of equivalent problems which can be relaxed to linear programs. Unlike using affine lower-bound functions in [7], in this work we use piecewise affine lower-bound functions, which allows us to obtain more accurate approximations. In addition, we show that these bounds can be improved by increasing artificially the degree of the polynomials. This new method allows us to compute more accurately guaranteed over-approximations of the reachable sets of discrete-time polynomial dynamical systems. We also show different ways to choose suitable polyhedral templates. Finally, we show the merits of our approach on several examples.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00769672
Contributor : Brigitte Bidégaray-Fesquet <>
Submitted on : Wednesday, January 2, 2013 - 11:19:49 PM
Last modification on : Thursday, July 4, 2019 - 9:54:02 AM

Links full text

Identifiers

Collections

Citation

Mohamed Amin Ben Sassi, Romain Testylier, Thao Dang, Antoine Girard. Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations. ATVA 2012 - 10th International Symposium on Automated Technology for Verification and Analysis, Oct 2012, Thiruvananthapuram, India. pp.137-151, ⟨10.1007/978-3-642-33386-6_12⟩. ⟨hal-00769672⟩

Share

Metrics

Record views

328