Optimal transport over nonlinear systems via infinitesimal generators on graphs
Karthik Elamvazhuthi, Piyush Grover

TL;DR
This paper introduces a graph-based computational framework for optimal transport in nonlinear dynamical systems, enabling provably optimal control laws and insights into complex system behaviors.
Contribution
It develops a convex fluid dynamics formulation on graphs using infinitesimal generators, connecting dynamical systems with optimal transport theory for nonlinear control.
Findings
Optimal control laws for nonlinear systems are derived.
The framework applies to chaotic and non-holonomic systems.
Insights into invariant manifolds and lobe dynamics are provided.
Abstract
We present a set-oriented graph-based computational framework for continuous-time optimal transport over nonlinear dynamical systems. We recover provably optimal control laws for steering a given initial distribution in phase space to a final distribution in prescribed finite time for the case of non-autonomous nonlinear control-affine systems, while minimizing a quadratic control cost. The resulting control law can be used to obtain approximate feedback laws for individual agents in a swarm control application. Using infinitesimal generators, the optimal control problem is reduced to a modified Monge-Kantorovich optimal transport problem, resulting in a convex Benamou-Brenier type fluid dynamics formulation on a graph. The well-posedness of this problem is shown to be a consequence of the graph being strongly-connected, which in turn is shown to result from controllability of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
