Approximate Wasserstein attraction flows for dynamic mass transport over networks

DOI10.1016/J.AUTOMATICA.2022.110432zbMATH Open1502.37091arXiv2109.09182OpenAlexW4283066029MaRDI QIDQ2158987FDOQ2158987

Authors: Ferran Arqué, César A. Uribe, Carlos Ocampo-Martinez 

Publication date: 26 July 2022

Published in: Automatica (Search for Journal in Brave)

Abstract: This paper presents a Wasserstein attraction approach for solving dynamic mass transport problems over networks. In the transport problem over networks, we start with a distribution over the set of nodes that needs to be "transported" to a target distribution accounting for the network topology. We exploit the specific structure of the problem, characterized by the computation of implicit gradient steps, and formulate an approach based on discretized flows. As a result, our proposed algorithm relies on the iterative computation of constrained Wasserstein barycenters. We show how the proposed method finds approximate solutions to the network transport problem, taking into account the topology of the network, the capacity of the communication channels, and the capacity of the individual nodes. Finally, we show the performance of this approach applied to large-scale water transportation networks.

Full work available at URL: https://arxiv.org/abs/2109.09182

Recommendations

• Fast iterative solution of the optimal transport problem on graphs
• Optimal transport over nonlinear systems via infinitesimal generators on graphs
• Dynamic Optimal Transport on Networks
• Entropic approximation of Wasserstein gradient flows
• A multilevel method for the solution of time dependent optimal transport

zbMATH Keywords

networkoptimal transportWasserstein distancediscrete flowconstrained Wasserstein barycenter

Mathematics Subject Classification ID

Optimal transportation (49Q22) Approximation methods and numerical treatment of dynamical systems (37M99)

Cites Work

• Minimum-cost flow algorithms: an experimental evaluation
• Network flows. Theory, algorithms, and applications.
• The earth mover's distance as a metric for image retrieval
• Polar factorization and monotone rearrangement of vector‐valued functions
• Gradient flows in metric spaces and in the space of probability measures
• Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
• The Variational Formulation of the Fokker--Planck Equation
• Geodesic convexity of the relative entropy in reversible Markov chains
• An Algorithm for Restricted Least Squares Regression
• Iterative Bregman Projections for Regularized Transportation Problems
• Application of predictive control strategies to the management of complex networks in the urban water cycle [Applications of Control]
• On the translocation of masses
• Title not available (Why is that?)
• Computation of optimal transport on discrete metric measure spaces
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
• Entropic Approximation of Wasserstein Gradient Flows
• Quadratically Regularized Optimal Transport on Graphs
• A Smoothed Dual Approach for Variational Wasserstein Problems
• Efficient Robust Routing for Single Commodity Network Flows
• On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows
• Stochastic model predictive control approaches applied to drinking water networks

Cited In (1)

• Dynamic programming in probability spaces via optimal transport

This page was built for publication: Approximate Wasserstein attraction flows for dynamic mass transport over networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158987)