arXiv Analytics

Sign in

arXiv:2307.13135 [math.OC]AbstractReferencesReviewsResources

High-dimensional Optimal Density Control with Wasserstein Metric Matching

Shaojun Ma, Mengxue Hou, Xiaojing Ye, Haomin Zhou

Published 2023-07-24Version 1

We present a novel computational framework for density control in high-dimensional state spaces. The considered dynamical system consists of a large number of indistinguishable agents whose behaviors can be collectively modeled as a time-evolving probability distribution. The goal is to steer the agents from an initial distribution to reach (or approximate) a given target distribution within a fixed time horizon at minimum cost. To tackle this problem, we propose to model the drift as a nonlinear reduced-order model, such as a deep network, and enforce the matching to the target distribution at terminal time either strictly or approximately using the Wasserstein metric. The resulting saddle-point problem can be solved by an effective numerical algorithm that leverages the excellent representation power of deep networks and fast automatic differentiation for this challenging high-dimensional control problem. A variety of numerical experiments were conducted to demonstrate the performance of our method.

Comments: 8 pages, 4 figures. Accepted for IEEE Conference on Decision and Control 2023
Categories: math.OC
Subjects: 93E20, 76N25, 49L99
Related articles: Most relevant | Search more
arXiv:1804.01572 [math.OC] (Published 2018-04-04, updated 2019-06-05)
Distributed Online Optimization for Multi-Agent Optimal Transport
arXiv:2410.08987 [math.OC] (Published 2024-10-11)
Gradient-adjusted underdamped Langevin dynamics for sampling
arXiv:2311.18226 [math.OC] (Published 2023-11-30)
On the nonexistence of a genuinely optimal solution to the search problem