High order computation of optimal transport, mean field planning, and mean field games
arXiv:2302.02308 · doi:10.1016/j.jcp.2023.112346
Abstract
Mean-field games (MFGs) have shown strong modeling capabilities for large systems in various fields, driving growth in computational methods for mean-field game problems. However, high order methods have not been thoroughly investigated. In this work, we explore applying general high-order numerical schemes with finite element methods in the space-time domain for computing the optimal transport (OT), mean-field planning (MFP), and MFG problems. We conduct several experiments to validate the convergence rate of the high order method numerically. Those numerical experiments also demonstrate the efficiency and effectiveness of our approach.
References in corpus (9)
- A Machine Learning Framework for Solving High-Dimensional Mean Field Game and Mean Field Control Problems
- Optimal Transport with Proximal Splitting
- Finite mean field games: fictitious play and convergence to a first order continuous mean field game
- Dynamical Optimal Transport on Discrete Surfaces
- Computational Mean-field information dynamics associated with Reaction diffusion equations
- Scalable Deep Reinforcement Learning Algorithms for Mean Field Games
- Random Features for High-Dimensional Nonlocal Mean-Field Games
- Controlling conservation laws II: compressible Navier-Stokes equations
- Alternating the Population and Control Neural Networks to Solve High-Dimensional Stochastic Mean-Field Games