AI summary

70% confidence

The paper proposes an efficient primal-dual algorithm for high-dimensional mean-field control with non-local interactions, utilizing basis expansions of kernels to reduce computational complexity.

Generated by MESSAI extraction pipeline · review against source PDF

Generic MFCRepresentative model
Click to animate flow
loading 3D model…

Representative MFC — matched on the paper’s system type only, not its reactor or geometry.

Extraction

Reported parameters

No values extracted from this paper yet.

Open in lab for full controls, parameter editing, and template overlays.

Open in lab →

What they did

System
MFC

What worked

No outcome metrics extracted yet.

Abstract

Mean-field control (MFC) problems aim to find the optimal policy to control massive populations of interacting agents. These problems are crucial in areas such as economics, physics, and biology. We consider the non-local setting, where the interactions between agents are governed by a suitable kernel. For $N$ agents, the interaction cost has $\mathcal{O}(N^2)$ complexity, which can be prohibitively slow to evaluate and differentiate when $N$ is large. To this end, we propose an efficient primal-dual algorithm that utilizes basis expansions of the kernels. The basis expansions reduce the cost of computing the interactions, while the primal-dual methodology decouples the agents at the expense of solving for a moderate number of dual variables. We also demonstrate that our approach can further be structured in a multi-resolution manner, where we estimate optimal dual variables using a moderate $N$ and solve decoupled trajectory optimization problems for large $N$. We illustrate the effectiveness of our method on an optimal control of 5000 interacting quadrotors.

Keywords

Kernel (algebra)Field (mathematics)

Identifiers

Journal
2025 American Control Conference (ACC)
Year
2024