Constructive reachability for linear control problems under conic constraints - MAP5 Access content directly
Preprints, Working Papers, ... Year : 2024

Constructive reachability for linear control problems under conic constraints

Abstract

Motivated by applications requiring sparse or nonnegative controls, we investigate reachability properties of linear infinite-dimensional control problems under conic constraints. Relaxing the problem to convex constraints if the initial cone is not already convex, we provide a constructive approach based on minimising a properly defined dual functional, which covers both the approximate and exact reachability problems. Our main results heavily rely on convex analysis, Fenchel duality and the Fenchel-Rockafellar theorem. As a byproduct, we uncover new sufficient conditions for approximate and exact reachability under convex conic constraints. We also prove that these conditions are in fact necessary. When the constraints are nonconvex, our method leads to sufficient conditions ensuring that the constructed controls fulfill the original constraints, which is in the flavour of bang-bang type properties. We show that our approach encompasses and generalises several works, and we obtain new results for different types of conic constraints and control systems.
Fichier principal
Vignette du fichier
HAL_v1.pdf (740.31 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04572161 , version 1 (10-05-2024)

Identifiers

  • HAL Id : hal-04572161 , version 1

Cite

Camille Pouchol, Emmanuel Trélat, Christophe Zhang. Constructive reachability for linear control problems under conic constraints. 2024. ⟨hal-04572161⟩
0 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More