Guaranteed approximations of arbitrarily quantified reachability problems - École polytechnique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

Guaranteed approximations of arbitrarily quantified reachability problems

Eric Goubault
Sylvie Putot

Résumé

We propose an approach to compute inner and outer-approximations of the sets of values satisfying constraints expressed as arbitrarily quantified formulas. Such formulas arise for instance when specifying important problems in control such as robustness, motion planning or controllers comparison. We propose an interval-based method which allows for tractable but tight approximations. We demonstrate its applicability through a series of examples and benchmarks using a prototype implementation.
Fichier principal
Vignette du fichier
2309.07662.pdf (366.71 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04336386 , version 1 (11-12-2023)

Identifiants

Citer

Eric Goubault, Sylvie Putot. Guaranteed approximations of arbitrarily quantified reachability problems. 2023. ⟨hal-04336386⟩

Collections

X IP_PARIS CIEDS
17 Consultations
13 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More