Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

APPROXIMATING BACKSTOP VIABILITY KERNELS

Abstract : This paper denes a specic viability domain called backstop viability kernel and 4 proposes a new algorithm that approximates such sets in a compact constraint set of d dimensions. 5 The algorithm uses a set approximation technique based on a sample chosen in a regular grid of 6 n d vertices covering the considered constraint set. We show that, in some conditions, the result 7 of the algorithm is the direct approximation of the backstop viability kernel by this approximation 8 technique. This theoretical result is illustrated on examples for which the viability kernel is equal to 9 the backstop viability kernel and can be derived analytically, using two set approximation methods: 10 the nearest neighbour, ensuring a convergence rate in O(n −1), and a recently developed technique, 11 the recursive simplex stars (resistars), ensuring a convergence rate in O(n −2). 12
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [43 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02961487
Contributor : Guillaume Deffuant Connect in order to contact the contributor
Submitted on : Thursday, October 8, 2020 - 2:49:35 PM
Last modification on : Tuesday, March 23, 2021 - 5:22:02 PM
Long-term archiving on: : Saturday, January 9, 2021 - 6:43:34 PM

File

backstopSIAM-V7.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02961487, version 1

Collections

Citation

Guillaume Deffuant, Isabelle Alvarez, Sophie Martin, Patrick Saint Pierre. APPROXIMATING BACKSTOP VIABILITY KERNELS. 2020. ⟨hal-02961487⟩

Share

Metrics

Record views

24

Files downloads

47