Computing the viability kernel using maximal reachable sets

DOI10.1145/2185632.2185644zbMath1362.93017OpenAlexW2109569369WikidataQ61684350 ScholiaQ61684350MaRDI QIDQ2986752

No author found.

Publication date: 16 May 2017

Published in: Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2185632.2185644

zbMATH Keywords

reachabilityscalabilitysafety-critical systemsviabilityset-theoretic methodscontrolled-invariance

Mathematics Subject Classification ID

Attainable sets, reachability (93B03)

Related Items (6)

OURS: over- and under-approximating reachable sets for analytic time-invariant differential equations ⋮ Barriers and potentially safe sets in hybrid systems: pendulum with non-rigid cable ⋮ Bracketing the solutions of an ordinary differential equation with uncertain initial conditions ⋮ Safety preserving control synthesis for sampled data systems ⋮ Bracketing backward reach sets of a dynamical system ⋮ Lagrangian methods for approximating the viability kernel in high-dimensional systems

This page was built for publication: Computing the viability kernel using maximal reachable sets