Decomposed resolution of finite-state aggregative optimal control problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

Decomposed resolution of finite-state aggregative optimal control problems

Abstract

A class of finite-state and discrete-time optimal control problems is introduced. The problems involve a large number of agents with independent dynamics, which interact through an aggregative term in the cost function. The problems are intractable by dynamic programming. We describe and analyze a decomposition method that only necessitates to solve at each iteration small-scale and independent optimal control problems associated with each single agent. When the number of agents is large, the convergence of the method to a nearly optimal solution is ensured, despite the absence of convexity of the problem. The procedure is based on a method called Stochastic Frank-Wolfe algorithm, designed for general nonconvex aggregative optimization problems. Numerical results are presented, for a toy model of the charging management of a battery fleet.
Fichier principal
Vignette du fichier
CT23-revised.pdf (1.5 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03642127 , version 1 (14-04-2022)
hal-03642127 , version 2 (07-07-2023)

Licence

Attribution

Identifiers

Cite

Kang Liu, Nadia Oudjane, Laurent Pfeiffer. Decomposed resolution of finite-state aggregative optimal control problems. 2023 Proceedings of the Conference on Control and its Applications (CT), Jul 2023, Philadelphie (USA), United States. pp.56-63, ⟨10.1137/1.9781611977745.8⟩. ⟨hal-03642127v2⟩
91 View
20 Download

Altmetric

Share

Gmail Facebook X LinkedIn More