Bounded ε-reachability of linear hybrid automata with a deterministic and transversal discrete transition condition

Kyoung Dae Kim, Sayan Mitra, P. R. Kumar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

An ε-reach set of a hybrid automaton is a set of states such that every state in it is within a distance ε of some reachable state.We propose an algorithm to compute a bounded ε-reach set from a given initial state of a class of deterministic linear hybrid automata that satisfy a certain transversality condition. The proposed algorithm is based on time-sampling. It over-approximates the reachable states at each sampled time instant using polyhedra, and subsequently computes an ε-reach set for a bounded time interval using these over-approximations, while reducing the sampling period on-the-fly.

Original languageEnglish (US)
Title of host publication2010 49th IEEE Conference on Decision and Control, CDC 2010
Pages6177-6182
Number of pages6
DOIs
StatePublished - Dec 1 2010
Event2010 49th IEEE Conference on Decision and Control, CDC 2010 - Atlanta, GA, United States
Duration: Dec 15 2010Dec 17 2010

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0191-2216

Other

Other2010 49th IEEE Conference on Decision and Control, CDC 2010
CountryUnited States
CityAtlanta, GA
Period12/15/1012/17/10

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint Dive into the research topics of 'Bounded ε-reachability of linear hybrid automata with a deterministic and transversal discrete transition condition'. Together they form a unique fingerprint.

Cite this