Set-Membership Method for Discrete Optimal Control

• Published in: Proceedings of the 10th International Conference on Informatics in Control, Automation and Robotics
• Main Authors: Guyonneau, Rémy, Lagrange, Sébastien, Hardouin, Laurent, Lhommeau, Mehdi
• Other Authors: Laboratoire d'Ingéniérie des Systèmes Automatisés (LISA), Université d'Angers (UA)
• Format: Conference Object
• Language: English
• Published: HAL CCSD 2013
• Subjects: [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]; Iceland
• Online Access: https://hal.science/hal-01113457; https://hal.science/hal-01113457/document; https://hal.science/hal-01113457/file/icinco2013.pdf; https://doi.org/10.5220/0004458001930200

International audience The objective of this paper is twofold: to propose a new approach for computing Ct0,tf 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 t0, and, using that work and given a cost function, to estimate an enclosure of the optimal control vector from an initial state of Ct0 ,t f to the target. Whereas classical methods do not provide any guaranteed on the set of state vectors that belong to the Ct0 ,t f , interval analysis and guarantee numerical integration allow us to avoid any indetermination. We present an algorithm able to provide guaranteed characterizations of the inner C− t0,tf and an the outer C+ of C , such that C− ⊆ C ⊆ C+ . In addition to that, the presented algorithm is t0,tf t0,tf t0,tf t0,tf t0,tf extended in order enclose the optimal control vector of the system, form an initial state to the target, by a set of trajectories.