Set-Membership Method for Discrete Optimal Control - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Set-Membership Method for Discrete Optimal Control

Résumé

The objective of this paper is twofold. First we propose a new approach for computing C t 0 ,t f the subset of initial states of a system from which there exists at least one trajectory reaching a target T in a finite time t f from a time t 0. This is done considering a discrete time t k and a control vector continuous over a time [t k−1 ,t k ]. Then, using the previously mentioned work and given a cost function, the objective is to estimate an enclosure of the discrete optimal control vector from an initial state of C t 0 ,t f to the target. Whereas classical methods do not provide any guaranty on the set of state vectors that belong to the C t 0 ,t f , interval analysis and guaranteed numerical integration allow us to avoid any indetermination. We present an algorithm able to provide guaranteed characterizations of the inner C − t 0 ,t f and an the outer C + t 0 ,t f of C t 0 ,t f , such that C − t 0 ,t f ⊆ C t 0 ,t f ⊆ C + t 0 ,t f. In addition to that, the presented algorithm is extended in order enclose the discrete optimal control vector of the system, form an initial state to the target, by a set of discrete trajectories.

Domaines

Automatique
Fichier principal
Vignette du fichier
ICINCO2013.pdf (199.5 Ko) Télécharger le fichier
ICINCO2013 (1).pdf (172.18 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00874162 , version 1 (19-01-2021)

Identifiants

  • HAL Id : hal-00874162 , version 1

Citer

Rémy Guyonneau, Sébastien Lagrange, Laurent Hardouin, Mehdi Lhommeau. Set-Membership Method for Discrete Optimal Control. 10th International Conference on Informatics in Control, Automation and Robotics, Jul 2013, Reykjavík, Iceland. ⟨hal-00874162⟩

Collections

UNIV-ANGERS
54 Consultations
30 Téléchargements

Partager

Gmail Facebook X LinkedIn More