On the polytope escape problem for continuous linear dynamical systems
From MaRDI portal
Complexity and performance of numerical algorithms (65Y20) Specification and verification (program logics, model checking, etc.) (68Q60) Linear programming (90C05) Transformations (93B17) Linear systems in control theory (93C05) Control/observation systems governed by ordinary differential equations (93C15)
Abstract: The Polyhedral Escape Problem for continuous linear dynamical systems consists of deciding, given an affine function and a convex polyhedron , whether, for some initial point in , the trajectory of the unique solution to the differential equation , , is entirely contained in . 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 , which lies between NP and PSPACE. Our algorithm makes use of spectral techniques and relies among others on tools from Diophantine approximation.
Recommendations
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)