Algorithme d'approximation du noyau de viabilité avec procédure de classification - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

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
Fichier principal
Vignette du fichier
rfia2012_submission_72.pdf (314.69 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00656555 , version 1 (17-01-2012)

Identifiers

  • HAL Id : hal-00656555 , version 1

Cite

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⟩
247 View
134 Download

Share

Gmail Mastodon Facebook X LinkedIn More