Computing the viability kernel using maximal reachable sets

DOI10.1145/2185632.2185644zbMATH Open1362.93017DBLPconf/hybrid/KaynamaMOMD12OpenAlexW2109569369WikidataQ61684350 ScholiaQ61684350MaRDI QIDQ2986752FDOQ2986752

Authors:

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

Recommendations

• Viability Kernels and Control Sets
• The calculation of discriminating kernel based on viability kernel and reachability
• Computing the viability kernel in large state dimension
• Improving validated computation of viability kernels
• The computation of the viability kernel for switched systems
• Approximating viability kernel for control systems
• The viability kernel algorithm for computing value functions of infinite horizon optimal control problems
• Approximating Viability Kernels of Non-linear Systems
• Approximation of the viability kernel
• Observability by using viability kernels

zbMATH Keywords

scalabilityreachabilityviabilitysafety-critical systemsset-theoretic methodscontrolled-invariance

Mathematics Subject Classification ID

Attainable sets, reachability (93B03)

Cited In (22)

• Viable set computation for hybrid systems
• Approximating Viability Kernels of Non-linear Systems
• On the computation of the robust viability kernel for switched systems
• Interval computing of the viability kernel with application to robotic collision avoidance
• Bracketing backward reach sets of a dynamical system
• Viability Kernels and Control Sets
• Model-invariant viability kernel approximation
• Lagrangian methods for approximating the viability kernel in high-dimensional systems
• Determining the viability of an unbounded polyhedron for a switched system
• OURS: over- and under-approximating reachable sets for analytic time-invariant differential equations
• Computation of viability kernels: a case study of by-catch fisheries
• Safety preserving control synthesis for sampled data systems
• Shadowing and the viability kernel algorithm
• Optimal semicomputable approximations to reachable and invariant sets
• Improving validated computation of viability kernels
• A \(kd\)-tree algorithm to discover the boundary of a black box hypervolume. Or how to peel potatoes by recursively cutting them in halves
• Computing the viability kernel in large state dimension
• Sampling-based approximation of the viability kernel for high-dimensional linear sampled-data systems
• Bracketing the solutions of an ordinary differential equation with uncertain initial conditions
• Barriers and potentially safe sets in hybrid systems: pendulum with non-rigid cable
• The computation of the viability kernel for switched systems
• Approximating viability kernel for control systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986752)