How fast can you escape a compact polytope?

DCosta, J and Lefaucheux, E and Ouaknine, J and Worrell, J (2020) How fast can you escape a compact polytope? In: 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, 10-13 March 2020, France.

PDF INT_SYM_THE_ASP_COM_SCI_154_2020.pdf - Published Version Restricted to Registered users only Download (500kB) | Request a copy

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. © Julian D'Costa, Engel Lefaucheux, Joël Ouaknine, and James Worrell; licensed under Creative Commons License CC-BY

Item Type:	Conference Paper
Publication:	Leibniz International Proceedings in Informatics, LIPIcs
Publisher:	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Additional Information:	cited By 0; Conference of 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020 ; Conference Date: 10 March 2020 Through 13 March 2020; Conference Code:158356
Keywords:	Differential equations; Dynamical systems; Iterative methods; Linear control systems, Convex polytopes; Escape problem; Iteration bound; Linear differential equation; Linear dynamical systems; Polynomial-time algorithms; Termination; Upper Bound, Polynomial approximation
Department/Centre:	Centres under the Director > Digital Campus and IT Services Office
Date Deposited:	03 Sep 2020 11:55
Last Modified:	03 Sep 2020 11:55
URI:	http://eprints.iisc.ac.in/id/eprint/65103

Actions (login required)

View Item