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 contributionpeer-review

4 Scopus citations

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
Title of host publication2010 49th IEEE Conference on Decision and Control, CDC 2010
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages6177-6182
Number of pages6
ISBN (Print)9781424477456
DOIs
StatePublished - 2010
Event49th IEEE Conference on Decision and Control, CDC 2010 - Atlanta, United States
Duration: 15 Dec 201017 Dec 2010

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370

Conference

Conference49th IEEE Conference on Decision and Control, CDC 2010
Country/TerritoryUnited States
CityAtlanta
Period15/12/1017/12/10

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