Pages that link to "Item:Q2986752"
From MaRDI portal
The following pages link to Computing the viability kernel using maximal reachable sets (Q2986752):
Displaying 16 items.
- Shadowing and the viability kernel algorithm (Q843970) (← links)
- Computing the viability kernel in large state dimension (Q855462) (← links)
- A \(kd\)-tree algorithm to discover the boundary of a black box hypervolume. Or how to peel potatoes by recursively cutting them in halves (Q905994) (← links)
- Interval computing of the viability kernel with application to robotic collision avoidance (Q1622606) (← links)
- The computation of the viability kernel for switched systems (Q1713546) (← links)
- OURS: over- and under-approximating reachable sets for analytic time-invariant differential equations (Q2154032) (← links)
- Viable set computation for hybrid systems (Q2252963) (← links)
- Safety preserving control synthesis for sampled data systems (Q2252964) (← links)
- Model-invariant viability kernel approximation (Q2327367) (← links)
- Lagrangian methods for approximating the viability kernel in high-dimensional systems (Q2356655) (← links)
- Barriers and potentially safe sets in hybrid systems: pendulum with non-rigid cable (Q2409309) (← links)
- Bracketing the solutions of an ordinary differential equation with uncertain initial conditions (Q2422853) (← links)
- Computation of viability kernels: a case study of by-catch fisheries (Q2438092) (← links)
- Optimal semicomputable approximations to reachable and invariant sets (Q2642902) (← links)
- Bracketing backward reach sets of a dynamical system (Q3386553) (← links)
- Determining the viability of an unbounded polyhedron for a switched system (Q6607631) (← links)
