Purpose: To numerically approximate the viability kernel of a discrete or continuous system.
Principle:
- Discretize time and space.
- Progressively eliminate points in the constraint set that do not allow for a viable evolution.
Simplified steps:
Input: Grille d’états G ⊂ K, dynamique F, pas de temps h
Output: Approximation de Viab_F(K)
1. Viab := G
2. Repeat
a. Pour chaque point x ∈ Viab
i. Calculer les successeurs possibles via F(x)
ii. Si aucun successeur ∉ Viab alors supprimer x
3. Until convergence
4. Return Viab