Duality-based Dynamical Optimal Transport of Discrete Time Systems
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909347497377792 |
|---|---|
| author | Wu, Dongjun Rantzer, Anders |
| author_facet | Wu, Dongjun Rantzer, Anders |
| contents | We study dynamical optimal transport of discrete time systems (dDOT) with Lagrangian cost. The problem is approached by combining optimal control and Kantorovich duality theory. Based on the derived solution, a first order splitting algorithm is proposed for numerical implementation. While solving partial differential equations is often required in the continuous time case, a salient feature of our algorithm is that it avoids equation solving entirely. Furthermore, it is typical to solve a convex optimization problem at each grid point in continuous time settings, the discrete case reduces this to a straightforward maximization. Additionally, the proposed algorithm is highly amenable to parallelization. For linear systems with Gaussian marginals, we provide a semi-definite programming formulation based on our theory. Finally, we validate the approach with a simulation example. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_09801 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Duality-based Dynamical Optimal Transport of Discrete Time Systems Wu, Dongjun Rantzer, Anders Optimization and Control We study dynamical optimal transport of discrete time systems (dDOT) with Lagrangian cost. The problem is approached by combining optimal control and Kantorovich duality theory. Based on the derived solution, a first order splitting algorithm is proposed for numerical implementation. While solving partial differential equations is often required in the continuous time case, a salient feature of our algorithm is that it avoids equation solving entirely. Furthermore, it is typical to solve a convex optimization problem at each grid point in continuous time settings, the discrete case reduces this to a straightforward maximization. Additionally, the proposed algorithm is highly amenable to parallelization. For linear systems with Gaussian marginals, we provide a semi-definite programming formulation based on our theory. Finally, we validate the approach with a simulation example. |
| title | Duality-based Dynamical Optimal Transport of Discrete Time Systems |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2410.09801 |