On the Polytope Escape Problem for Continuous Linear Dynamical Systems

The Polytope Escape Problem for continuous linear dynamical systems consists of deciding, given an affine function f:Rd -> Rd and a convex polytope P⊆ Rd, both with rational descriptions, whether there exists an initial point x0 in P such that the trajectory of the unique solution to the differential equation: ·x(t)=f(x(t)) x 0= x0 is entirely contained in P. We show that this problem is reducible in polynomial time to the decision version of linear programming with real algebraic coefficients. The latter is a special case of the decision problem for the existential theory of real closed fields, which is known to lie between NP and PSPACE. Our algorithm makes use of spectral techniques and relies, among others, on tools from Diophantine approximation.

[1]  Jin-Yi Cai,et al.  Computing Jordan Normal Forms Exactly for Commuting Matrices in Polynomial Time , 1994, Int. J. Found. Comput. Sci..

[2]  G. Sacks.  A DECISION METHOD FOR ELEMENTARY ALGEBRA AND GEOMETRY , 2003 .

[3]  Gregorio Malajovich,et al.  An Eective Version of Kronecker's Theorem on Simultaneous Diophantine Approximation , 2001 .

[4]  Joël Ouaknine,et al.  On the Skolem Problem for Continuous Linear Dynamical Systems , 2015, ICALP.

[5]  Andrea Bacciotti,et al.  Stability of dynamical polysystems via families of Liapunov functions , 2007 .

[6]  G. Hardy,et al.  An Introduction to the Theory of Numbers , 1938 .

[7]  John N. Tsitsiklis,et al.  A survey of computational complexity results in systems and control , 2000, Autom..

[8]  Joël Ouaknine,et al.  On Recurrent Reachability for Continuous Linear Dynamical Systems , 2015, 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[9]  M. Mignotte.  Some Useful Bounds , 1983 .

[10]  Emmanuel Hainry,et al.  Reachability in Linear Dynamical Systems , 2008, CiE.

[11]  J. Hennet,et al.  On invariant polyhedra of continuous-time linear systems , 1993, IEEE Trans. Autom. Control..

[12]  Mark Braverman,et al.  Termination of Integer Linear Programs , 2006, CAV.

[13]  Jean-Charles Delvenne,et al.  The continuous Skolem-Pisot problem , 2010, Theor. Comput. Sci..

[14]  V. Pan.  Optimal and nearly optimal algorithms for approximating polynomial zeros , 1996 .

[15]  P. Schuster,et al.  A simple constructive proof of Kronecker's Density Theorem , 2006 .

[16]  Peter A. Beling,et al.  Polynomial algorithms for linear programming over the algebraic numbers , 1992, STOC '92.

[17]  László Lovász,et al.  Factoring polynomials with rational coefficients , 1982 .

[18]  Sriram Sankaranarayanan,et al.  A Policy Iteration Technique for Time Elapse over Template Polyhedra , 2008, HSCC.

[19]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[20]  Rajeev Alur,et al.  Principles of Cyber-Physical Systems , 2015 .

[21]  Henri Cohen,et al.  A course in computational algebraic number theory , 1993, Graduate texts in mathematics.

[22]  References , 1971 .