Viability theory
Lower semicontinuous solutions of Hamilton-Jacobi-Bellman equations
SIAM Journal on Control and Optimization
Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Verification of Hybrid Systems with Linear Differential Inclusions Using Ellipsoidal Approximations
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
NMA '02 Revised Papers from the 5th International Conference on Numerical Methods and Applications
Taylor approximation for hybrid systems
Information and Computation
Verifying average dwell time of hybrid systems
ACM Transactions on Embedded Computing Systems (TECS)
Safety verification of model helicopter controller using hybrid input/output automata
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
Taylor approximation for hybrid systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Hi-index | 0.00 |
We show how reachable sets of constrained continuous and simple hybrid systems may be computed using the minimum time-to_ reach function. We present an algorithm for computing a discrete approximation to the minimum time-to-reach function, which we prove to be a converging underapproximation to the actual function. We use the discrete minimum time-to-reach function for simple hybrid systems to compute overapproximations of unsafe zones for aircraft in a sector of the Oakland Air Traffic Control Center, leading to the automatic generation of conflict-free aircraft maneuvers.