Reachability in One-Dimensional Controlled Polynomial Dynamical Systems

Korovina, Margarita and Vorobjov, Nicolai (2012) Reachability in One-Dimensional Controlled Polynomial Dynamical Systems. Lecture Notes in Computer Science, 7162. pp. 251-261. ISSN 0302-9743

[thumbnail of LNCS7162.pdf] PDF

Download (374kB)


n this paper we investigate a case of the reachability prob- lem in controlled o-minimal dynamical systems. This problem can be formulated as follows. Given a controlled o-minimal dynamical system initial and target sets, find a finite choice of time points and control parameters applied at these points such that the target set is reachable from the initial set. We prove that the existence of a finite control strategy is decidable and construct a polynomial complexity algorithm which generates finite control strategies for one-dimensional controlled polynomial dynamical systems. For this algorithm we also show an upper bound on the numbers of switches in finite control strategies.

Item Type: Article
Uncontrolled Keywords: CICADA
Subjects: MSC 2010, the AMS's Mathematics Subject Classification > 37 Dynamical systems and ergodic theory
Depositing User: Dr Margarita Korovina
Date Deposited: 03 Jul 2012
Last Modified: 20 Oct 2017 14:13

Actions (login required)

View Item View Item