Skip to Main content Skip to Navigation
Conference papers

Algorithme d'approximation du noyau de viabilité avec procédure de classification

Abstract : Viability theory proposes concepts and tools to control a dynamical system such that it can remain inside a viability constraint set. Integrating viability models in a tool support for participatory management is a new application of the viability theory. In this context, we propose an algorithm for viability kernel approximation, which focuses on improving the computing time. This algorithm uses the classification procedure based on the method of Nearest Neighbor Search. The algorithm satisfies the conditions of convergence, and is easy to use with a graphical user interface. We compare its results for models for which the exact viability kernels have been determined. The accuracy of this algorithm is always greater than 90 percent. The computing time is very interesting for decision support tools
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Amélie Cordier Connect in order to contact the contributor
Submitted on : Tuesday, January 17, 2012 - 9:25:46 PM
Last modification on : Monday, October 11, 2021 - 10:26:04 AM
Long-term archiving on: : Wednesday, April 18, 2012 - 2:28:36 AM


Files produced by the author(s)


  • HAL Id : hal-00656555, version 1


Wei Wei, Isabelle Alvarez, Sophie Martin. Algorithme d'approximation du noyau de viabilité avec procédure de classification. RFIA 2012 (Reconnaissance des Formes et Intelligence Artificielle), Jan 2012, Lyon, France. ⟨hal-00656555⟩



Record views


Files downloads