Mean-Field Optimal Control
Not on the map. Why?
Abstract (arXiv)
We introduce the concept of it mean-field optimal control which is the rigorous limit process connecting finite dimensional optimal control problems with ODE constraints modeling multi-agent interactions to an infinite dimensional optimal control problem with a constraint given by a PDE of Vlasov-type, governing the dynamics of the probability distribution of interacting agents. While in the classical mean-field theory one studies the behavior of a large number of small individuals it freely interacting with each other, by simplifying the effect of all the other individuals on any given individual by a single averaged effect, we address the situation where the individuals are actually influenced also by an external it policy maker, and we propagate its effect for the number N of individuals going to infinity. On the one hand, from a modeling point of view, we take into account also that the policy maker is constrained to act according to optimal strategies promoting its most parsimonious interaction with the group of individuals. This will be realized by considering cost functionals including L1-norm terms penalizing a broadly distributed control of the group, while promoting its sparsity. On the other hand, from the analysis point of view, and for the sake of generality, we consider broader classes of convex control penalizations. In order to develop this new concept of limit rigorously, we need to carefully combine the classical concept of mean-field limit, connecting the finite dimensional system of ODE describing the dynamics of each individual of the group to the PDE describing the dynamics of the respective probability distribution, with the well-known concept of Gamma-convergence to show that optimal strategies for the finite dimensional problems converge to optimal strategies of the infinite dimensional problem.
Key facts. Cited by 9 papers in the map (data through 13 Oct 2026). First posted on arXiv 25 Jun 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1; 2023: 1; 2024: 3; 2025: 3.
9 papers.
- 2022Indexability is Not Enough for Whittle: Improved, Near-Optimal Algorithms for Restless Banditscited by 10
- 2024Score-based Neural Ordinary Differential Equations for Computing Mean Field Control Problemscited by 7
- 2021Learning Swarm Interaction Dynamics from Density Evolutioncited by 2
- 2025Solving Continuous Mean Field Games: Deep Reinforcement Learning for Non-Stationary Dynamicscited by 2
- 2023On kernel-based statistical learning in the mean field limitcited by 1
- 2024Learning to Stop: Deep Learning for Mean Field Optimal Stoppingcited by 1
- 2025Score Matching Diffusion Based Feedback Control and Planning of Nonlinear Systemscited by 1
- 2024Data/moment-driven approaches for fast predictive control of collective dynamicscited by 0
- 2025Maximum Principle of Optimal Probability Density Controlcited by 0
- 2025Solving Continuous Mean Field Games: Deep Reinforcement Learning for Non-Stationary Dynamics25 Oct 2025
- 2025Maximum Principle of Optimal Probability Density Control23 May 2025
- 2025Score Matching Diffusion Based Feedback Control and Planning of Nonlinear Systems14 Apr 2025
- 2024Learning to Stop: Deep Learning for Mean Field Optimal Stopping11 Oct 2024
- 2024Score-based Neural Ordinary Differential Equations for Computing Mean Field Control Problems24 Sep 2024
- 2024Data/moment-driven approaches for fast predictive control of collective dynamics23 Feb 2024
- 2023On kernel-based statistical learning in the mean field limit27 Oct 2023
- 2022Indexability is Not Enough for Whittle: Improved, Near-Optimal Algorithms for Restless Bandits31 Oct 2022
- 2021Learning Swarm Interaction Dynamics from Density Evolution5 Dec 2021