## 2012.65: Reachability in One-Dimensional Controlled Polynomial Dynamical Systems

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

Full text available as:

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader 366 Kb |

Official URL: http://www.springerlink.com/content/m370h12465877l22/?MUD=MP

## Abstract

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 2000 > 37 Dynamical systems and ergodic theory |

MIMS number: | 2012.65 |

Deposited By: | Dr Margarita Korovina |

Deposited On: | 03 July 2012 |

Download Statistics: last 4 weeks

Repository Staff Only: edit this item