.png){kind=icon}
.png){kind=icon}
Return
Distributed online optimization for multi-agent optimal transport
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2024.111880.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a scalable, distributed algorithm for the optimal transport of large-scale multi-agent systems. We formulate the problem as one of steering the collective towards a target probability measure while minimizing the total cost of transport, with the additional constraint of distributed implementation. Using optimal transport theory, we realize the solution as an iterative transport based on a stochastic proximal descent scheme. At each stage of the transport, the agents implement an online, distributed primal-dual algorithm to obtain local estimates of the Kantorovich potential for optimal transport from the current distribution of the collective to the target distribution. Using these estimates as their local objective functions, the agents then implement the transport by stochastic proximal descent. This two-step process is carried out recursively by the agents to converge asymptotically to the target distribution. We rigorously establish the underlying theoretical framework and convergence of the algorithm and test its behavior in numerical experiments.
Keywords:
Optimal transport
Stochastic optimization
Distributed online optimization
Multi-agent systems
Journal
IF:
5.9
Papers:
1.2W
Citations:
5.2W
