Chain of set inversion problems; Application to reachability analysis - ENSTA Bretagne - École nationale supérieure de techniques avancées Bretagne Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Chain of set inversion problems; Application to reachability analysis

Résumé

This paper deals with the set inversion problem X = f −1 (Y) in the case where f : R n → R m depends on a parameter vector p ∈ R q which is known to be inside a box [p]. We show that for a large class of problems, we can obtain an accurate approximation of the solution set, without bisecting in the p-space. To do this, symbolic methods are required to cast our initial problem into a chain of set-inversion problems, the links of which have some nice properties with respect to p. As an application, we consider the problem of computing the set of all initial states of an uncertain discrete-time state system that reach a target set Y in a given time.
Fichier principal
Vignette du fichier
paper_chain.pdf (830.26 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01702404 , version 1 (06-02-2018)

Identifiants

  • HAL Id : hal-01702404 , version 1

Citer

Benoît Desrochers, Luc Jaulin. Chain of set inversion problems; Application to reachability analysis. 20th World Congress of the International Federation of Automatic Control, IFAC 2017, Jul 2017, Toulouse, France. ⟨hal-01702404⟩
192 Consultations
133 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More