Approximating Viability Kernels With Support Vector Machines

DOI10.1109/TAC.2007.895881MaRDI QIDQ5282127zbMATH OpenOpenAlexFDO

Authors Guillaume Deffuant, Laetitia Chapel, Sophie Martin

Publication date 27 July 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tac.2007.895881

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Controllability (93B05)

Recommendations

• Approximation of the viability kernel
• Model-invariant viability kernel approximation
• Improving validated computation of viability kernels
• Support vector machine with kernel methods and simulations
• Approximating Viability Kernels of Non-linear Systems
• Computing the viability kernel in large state dimension
• Lagrangian methods for approximating the viability kernel in high-dimensional systems
• Approximating viability kernel for control systems
• scientific article; zbMATH DE number 1314294
• Probabilistic kernel support vector machines

Cited in

(14)

• Comparison theorem for viability kernels via conic preorders
• Capture basin approximation using interval analysis
• On the computation of the robust viability kernel for switched systems
• Solving viability problems in dynamic games using individual strategies derived from guaranteed viability kernels: application to an agricultural cooperative model
• Viable immersion and invariance control for a class of nonlinear systems and its application to aero-engines
• The viability kernel of dynamical systems with mixed constraints: a level-set approach
• Lagrangian methods for approximating the viability kernel in high-dimensional systems
• Computation of viability kernels: a case study of by-catch fisheries
• Determining the viability of an unbounded polyhedron for a switched system
• Shadowing and the viability kernel algorithm
• SVM approximation of value function contours in target hitting problems
• A kd-tree algorithm to discover the boundary of a black box hypervolume. Or how to peel potatoes by recursively cutting them in halves
• The computation of the viability kernel for switched systems
• Determining the viable unbounded polyhedron under linear control systems

This page was built for publication: Approximating Viability Kernels With Support Vector Machines

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