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

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. ©2010 IEEE.

name of conference

• 2010 49th IEEE Conference on Decision and Control (CDC)

authors

• Kumar, Panganamala

published proceedings

• 49th IEEE Conference on Decision and Control (CDC)

author list (cited authors)

• Kim, K., Mitra, S., & Kumar, P. R

citation count

• 2

complete list of authors

• Kim, Kyoung-Dae||Mitra, Sayan||Kumar, PR

publication date

• December 2010

publisher

• IEEE  Publisher

published in

• 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)  Journal

Digital Object Identifier (DOI)

• 10.1109/cdc.2010.5717209

International Standard Book Number (ISBN) 13

• 9781424477456

start page

• 6177

end page

• 6182