Lagrangian methods for approximating the viability kernel in high-dimensional systems

DOI10.1016/j.automatica.2013.03.020zbMath1364.93057OpenAlexW2085744412WikidataQ61684329 ScholiaQ61684329MaRDI QIDQ2356655

John N. Maidens, Shahab Kaynama, Ian M. Mitchell, Meeko M. K. Oishi, Guy A. Dumont

Publication date: 6 June 2017

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2013.03.020

zbMATH Keywords

reachabilitycontrolled invarianceformal verificationsafety-critical systemsviabilityhigh-dimensional systemsset-theoretic methods

Mathematics Subject Classification ID

Related Items (14)

Comparison theorem for viability kernels via conic preorders ⋮ Optimal retention of the trajectories of a discrete-time stochastic system in a tube: one problem statement ⋮ Bracketing the solutions of an ordinary differential equation with uncertain initial conditions ⋮ A novel unified framework for solving reachability and invariance problems ⋮ Aircraft control during cruise flight in windshear conditions: viability approach ⋮ The calculation of discriminating kernel based on viability kernel and reachability ⋮ The computation of the viability kernel for switched systems ⋮ Anticipating Shocks in the State Space: Characterizing Robustness and Building Increasingly Robust Evolutions ⋮ Safety preserving control synthesis for sampled data systems ⋮ Lagrangian approximations for stochastic reachability of a target tube ⋮ Temporal logic control for stochastic linear systems using abstraction refinement of probabilistic games ⋮ The viability kernel of dynamical systems with mixed constraints: a level-set approach ⋮ Model-invariant viability kernel approximation ⋮ Fault detection and isolation using viability theory and interval observers

Uses Software

• MPT
• Ellipsoidal Toolbox
• SpaceEx

Cites Work

• Unnamed Item
• Unnamed Item
• Computing the viability kernel in large state dimension
• Reachability analysis of linear systems using support functions
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• Approximation of the viability kernel
• Ellipsoidal techniques for reachability analysis: Internal approximation
• On reachability and minimum cost optimal control
• Computing the viability kernel using maximal reachable sets
• Graph Implementations for Nonsmooth Convex Programs
• Viability Theory
• Comparing Forward and Backward Reachability as Tools for Safety Analysis
• Reachability Analysis of Hybrid Systems Using Support Functions
• Variational Analysis
• Computational techniques for hybrid system verification
• A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games
• Approximating Viability Kernels With Support Vector Machines
• Hybrid Systems: Computation and Control
• Hybrid Systems: Computation and Control
• Set-theoretic methods in control
• Hybrid Systems: Computation and Control
• Viability theory
• Dynamic optimization for reachability problems.

This page was built for publication: Lagrangian methods for approximating the viability kernel in high-dimensional systems