Approximating viability kernels with support vector machines
type: Dataset
description: We propose an algorithm which performs a progressive approximation of a viability kernel, iteratively using a classification method. We establish the mathematical conditions that the classification method should fulfill to guarantee the convergence to the actual viability kernel. We study more particularly the use of support vector machines (SVMs) as classification techniques. We show that they make possible to use gradient optimisation techniques to find a viable control at each time step, and over several time steps. This allows us to avoid the exponential growth of the computing time with the dimension of the control space. It also provides simple and efficient control procedures. We illustrate the method with some examples inspired from ecology.
issued: 2026-06-03T02:58:18.558837
language: en
modified: 2026-06-03T02:58:18.558843
contact point: Organization
  fn: CCSD
keyword: algorithme
keyword: ecologie
keyword: infoeu-reposemanticsarticle
keyword: journal-articles
keyword: machine-a-vecteurs-de-support
keyword: sdeenvironmental-sciences
keyword: theorie-de-la-viabilite
landing page: 0018-9286

Approximating viability kernels with support vector machines
type: Distribution
format: HTML
issued: 2026-06-03T02:58:18.582760
modified: 2026-06-03T02:58:18.524387
access URL: https://hal.science/hal-00758886

test_moissonnage_selune
type: Agent