Related papers: Bounding the Escape Time of a Linear Dynamical Sys…
We study the computational complexity of the Escape Problem for discrete-time linear dynamical systems over compact semialgebraic sets, or equivalently the Termination Problem for affine loops with compact semialgebraic guard sets. Consider…
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…
A common problem to all applications of linear finite dynamical systems is analyzing the dynamics without enumerating every possible state transition. Of particular interest is the long term dynamical behaviour. In this paper, we study the…
Efficient computation of trajectories of switched affine systems becomes possible, if for any such hybrid system, we can manage to efficiently compute the sequence of switching times. Once the switching times have been computed, we can…
We study the problem of deciding whether a point escapes a closed subset of $\mathbb{R}^d$ under the iteration of a continuous map $f \colon \mathbb{R}^d \to \mathbb{R}^d$ in the bit-model of real computation. We give a sound partial…
We present a master equation approach to the \emph{narrow escape time} (NET) problem, i.e. the time needed for a particle contained in a confining domain with a single narrow opening, to exit the domain for the first time. We introduce a…
We investigate the evolution of families of periodic orbits in a bisymmetrical potential made up of a two-dimensional harmonic oscillator with only one quartic perturbing term, in a number of resonant cases. Our main objective is to compute…
We prove the existence of an effective universal upper bound for the order of any integral periodic orbit of any integral algebraic dynamical system in a fixed ambient space. Using this, we demonstrate the decidability of periodicity in…
Sublinear time complexity is required by the massively parallel computation (MPC) model. Breaking dynamic programs into a set of sparse dynamic programs that can be divided, solved, and merged in sublinear time. The rectangle escape problem…
The problem of noise-induced escape from a metastable state arises in physics, chemistry, biology, systems engineering, and other areas. The problem is well understood when the underlying dynamics of the system obey detailed balance. When…
We study fundamental reachability problems on pseudo-orbits of linear dynamical systems. Pseudo-orbits can be viewed as a model of computation with limited precision and pseudo-reachability can be thought of as a robust version of classical…
The Polyhedral Escape Problem for continuous linear dynamical systems consists of deciding, given an affine function $f: \mathbb{R}^{d} \rightarrow \mathbb{R}^{d}$ and a convex polyhedron $\mathcal{P} \subseteq \mathbb{R}^{d}$, whether, for…
We study computational questions related with the stability of discrete-time linear switching systems with switching sequences constrained by an automaton. We first present a decidable sufficient condition for their boundedness when the…
We investigate the escape dynamics of the doubling map with a time-periodic hole. We use Ulam's method to calculate the escape rate as a function of the control parameters. We consider two cases, oscillating or breathing holes, where the…
The present paper studies the escape mechanism in collinear three point mass systems with small-range-repulsive/large-range-attractive pairwise-interaction. Specifically, we focus on systems with non-negative total energy. We show that on…
This paper discusses possible approaches to the escape rate in infinite lattices of weakly coupled maps with uniformly expanding repeller. It is proved that computed-via-volume rates of spatially periodic approximations grow linearly with…
We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…
We study the quadratic family of one-dimensional maps $f_a (x) = a - x^2$. We conduct comprehensive numerical analysis of collections of finite orbits of the critical point, computed for intervals of parameter values using rigorous…
We investigate the problem of finding paths that enable a robot modeled as a Dubins car (i.e., a constant-speed finite-turn-rate unicycle) to escape from a circular region of space in minimum time. This minimum-time escape problem arises in…
We consider a dynamical system given by an area-preserving map on a two-dimensional phase plane and consider a one-dimensional line of initial conditions within this plane. We record the number of iterates it takes a trajectory to escape…