How Fast Can You Escape a Compact Polytope?
From MaRDI portal
Publication:6333332
DOI10.4230/LIPICS.STACS.2020.49arXiv2001.08200MaRDI QIDQ6333332FDOQ6333332
Authors: Julian D'Costa, Engel Lefaucheux, Joël Ouaknine, James Worrell 
Publication date: 14 January 2020
Abstract: The Continuous Polytope Escape Problem (CPEP) asks whether every trajectory of a linear differential equation initialised within a convex polytope eventually escapes the polytope. We provide a polynomial-time algorithm to decide CPEP for compact polytopes. We also establish a quantitative uniform upper bound on the time required for every trajectory to escape the given polytope. In addition, we establish iteration bounds for termination of discrete linear loops via reduction to the continuous case.
This page was built for publication: How Fast Can You Escape a Compact Polytope?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6333332)
