By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kyoung-Dae Kim ; Coordinated Science Laboratory and the Department of Electrical and Computer Engineering, University of Illinois at Urbana-Champaign, 61801, USA ; Sayan Mitra ; P. R. Kumar

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.

Published in:

49th IEEE Conference on Decision and Control (CDC)

Date of Conference:

15-17 Dec. 2010