On the polytope escape problem for continuous linear dynamical systems

From MaRDI portal



Abstract: The Polyhedral Escape Problem for continuous linear dynamical systems consists of deciding, given an affine function f:mathbbRdightarrowmathbbRd and a convex polyhedron mathcalPsubseteqmathbbRd, whether, for some initial point in mathcalP, the trajectory of the unique solution to the differential equation , , is entirely contained in mathcalP. We show that this problem is decidable, by reducing it in polynomial time to the decision version of linear programming with real algebraic coefficients, thus placing it in existsmathbbR, which lies between NP and PSPACE. Our algorithm makes use of spectral techniques and relies among others on tools from Diophantine approximation.











This page was built for publication: On the polytope escape problem for continuous linear dynamical systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5275313)