Computing the viability kernel using maximal reachable sets
From MaRDI portal
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
Cited in
(22)- Interval computing of the viability kernel with application to robotic collision avoidance
- The computation of the viability kernel for switched systems
- OURS: over- and under-approximating reachable sets for analytic time-invariant differential equations
- Viable set computation for hybrid systems
- Safety preserving control synthesis for sampled data systems
- Model-invariant viability kernel approximation
- Lagrangian methods for approximating the viability kernel in high-dimensional systems
- 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
- Computation of viability kernels: a case study of by-catch fisheries
- Optimal semicomputable approximations to reachable and invariant sets
- Sampling-based approximation of the viability kernel for high-dimensional linear sampled-data systems
- Bracketing backward reach sets of a dynamical system
- Improving validated computation of viability kernels
- Viability Kernels and Control Sets
- Approximating viability kernel for control systems
- Approximating Viability Kernels of Non-linear Systems
- On the computation of the robust viability kernel for switched systems
- Determining the viability of an unbounded polyhedron for a switched system
- Shadowing and the viability kernel algorithm
- Computing the viability kernel in large state dimension
- A kd-tree algorithm to discover the boundary of a black box hypervolume. Or how to peel potatoes by recursively cutting them in halves
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)
