Viabilitree: A kd-tree Framework for Viability-based Decision - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2016

Viabilitree: A kd-tree Framework for Viability-based Decision

Abstract

The mathematical viability theory offers concepts and methods that are suitable to study the compatibility between a dynamical system described by a set of differential equations and constraints in the state space. The result sets built during the viability analysis can give very useful information regarding management issues in fields where it is easier to discuss constraints than objective functions. However, computational problems arise very quickly with the number of state variables, and the practical implementation of the method is difficult, although there exists a convergent numerical scheme and several approaches to bypass the computational problems. In order to popularize the use of viability analysis we propose a framework in which the viability sets are represented and approximated with particular kd-trees. The computation of the viability kernel is seen as an active learning problem. We prove the convergence of the algorithm and assess the approximation it produces for known problems with analytical solution. This framework aims at simplifying the declaration of the viability problem and provides useful methods to assist further use of viability sets produced by the computation.
Fichier principal
Vignette du fichier
FrameworkForViabilityKBShal.pdf (1.91 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01319738 , version 1 (22-05-2016)

Identifiers

  • HAL Id : hal-01319738 , version 1

Cite

Isabelle Alvarez, Romain Reuillon, Ricardo de Aldama. Viabilitree: A kd-tree Framework for Viability-based Decision. 2016. ⟨hal-01319738⟩
453 View
204 Download

Share

Gmail Facebook X LinkedIn More