Optimal control under action duration constraint for non-convex dynamics
The motivation of this paper stems from a family of optimal control problems wherein the control’s active duration is constrained within a predefined limit. The duration constraint can be perceived as an additional variable in the dynamics, and the relaxation of the naturally associated control problem is equivalent to a an $\mathbb{L}^{1}$-constraint. The paper provides a generalization of a preliminary work by the authors to encompass scenarios with non-convex dynamics. The relaxed problems are formulated through Linear Programming techniques and their qualitative properties, alongside the interrelations between different formulations, are investigated.
Authors
- Dan Goreac (ORCID: https://orcid.org/0000-0002-8693-6672)
- Alain Rapaport (ORCID: https://orcid.org/0000-0002-8515-0838)
Institutions
- Centre National de la Recherche Scientifique (FR)
- Shandong University (CN)
- Université Paris-Est Créteil (FR)
- Université de Montpellier (FR)
- Institut National de Recherche pour l'Agriculture, l'Alimentation et l'Environnement (FR)
- Mathématiques, Informatique et Statistique pour l'Environnement et l'Agronomie (FR)
- Laboratoire d’Analyse et de Mathématiques Appliquées (FR)
- Université Gustave Eiffel (FR)
- Université Laval (CA)
Publication Details
- Published
- 2024-12-16
- DOI
- https://doi.org/10.1109/cdc56724.2024.10886472
- Primary Topic
- Advanced Control Systems Optimization
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Science Foundation
- Agence Nationale de la Recherche