Bounded $epsilon$-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

• 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

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE Conference on Decision and Control  Journal

Digital Object Identifier (DOI)

• 10.1109/cdc.2010.5717209

International Standard Book Number (ISBN) 13

• 9781424477456

start page

• 6177

end page

• 6182

URL

• http://dx.doi.org/10.1109/cdc.2010.5717209