Skip to Main content Skip to Navigation
Journal articles

Approximating viability kernels with support vector machines

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download
Contributor : Import Ws Irstea <>
Submitted on : Thursday, November 29, 2012 - 3:06:40 PM
Last modification on : Wednesday, November 18, 2020 - 10:26:20 AM
Long-term archiving on: : Saturday, December 17, 2016 - 5:45:06 PM


Files produced by the author(s)


  • HAL Id : hal-00758886, version 1
  • IRSTEA : PUB00036305



G. Deffuant, L. Chapel, S. Martin. Approximating viability kernels with support vector machines. IEEE Transactions on Automatic Control, Institute of Electrical and Electronics Engineers, 2007, 52 (5), p. 933 - p. 937. ⟨hal-00758886⟩



Record views


Files downloads