相关论文: Numerical Analysis of the 1-D Parabolic Optimal Tr…

In this article we study the numerical solution of the $L^1$-Optimal Transport Problem on 2D surfaces embedded in $R^3$, via the DMK formulation introduced in [FaccaCardinPutti:2018]. We extend from the Euclidean into the Riemannian setting…

We consider the problem of finding an optimal transport plan between an absolutely continuous measure $\mu$ on $\mathcal{X} \subset \mathbb{R}^d$ and a finitely supported measure $\nu$ on $\mathbb{R}^d$ when the transport cost is the…

This article provides numerical simulation of an optimal transport path from a single source to an atomic measure of equal total mass. We first construct an initial transport path, and then modify the path as much as possible by using both…

We propose a space-time scheme that combines an unfitted finite element method in space with a discontinuous Galerkin time discretisation for the accurate numerical approximation of parabolic problems with moving domains or interfaces. We…

We construct Two-Point Flux Approximation (TPFA) finite volume schemes to solve the quadratic optimal transport problem in its dynamic form, namely the problem originally introduced by Benamou and Brenier. We show numerically that these…

Optimal transport is a fundamental topic that has attracted a great amount of attention from the optimization community in the past decades. In this paper, we consider an interesting discrete dynamic optimal transport problem: can we…

In the theory and practice of inverse problems for partial differential equations (PDEs) much attention is paid to the problem of the identification of coefficients from some additional information. This work deals with the problem of…

An adaptive, adversarial methodology is developed for the optimal transport problem between two distributions $\mu$ and $\nu$, known only through a finite set of independent samples $(x_i)_{i=1..N}$ and $(y_j)_{j=1..M}$. The methodology…

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…

Many numerical and learning algorithms rely on the solution of the Monge-Kantorovich problem and Wasserstein distances, which provide appropriate distributional metrics. While the natural approach is to treat the problem as an…

This work originates from a heart's images tracking which is to generate an apparent continuous motion, observable through intensity variation from one starting image to an ending one both supposed segmented. Given two images p0 and p1, we…

In the regime of bounded transportation costs, additive approximations for the optimal transport problem are reduced (rather simply) to relative approximations for positive linear programs, resulting in faster additive approximation…

We consider the problem of optimizing the trajectory of an Unmanned Aerial Vehicle (UAV). Assuming a traffic intensity map of users to be served, the UAV must travel from a given initial location to a final position within a given duration…

The geometric transportation problem takes as input a set of points $P$ in $d$-dimensional Euclidean space and a supply function $\mu : P \to \mathbb{R}$. The goal is to find a transportation map, a non-negative assignment $\tau : P \times…

Many combinatorial optimization problems can be formulated as the search for a subgraph that satisfies certain properties and minimizes the total weight. We assume here that the vertices correspond to points in a metric space and can take…

We consider the problem of time-optimal path planning for simple nonholonomic vehicles. In previous similar work, the vehicle has been simplified to a point mass and the obstacles have been stationary. Our formulation accounts for a…

We introduce an alternative approach for the analysis and numerical approximation of the optimal feedback control mapping. It consists in looking at a typical optimal control problem in such a way that feasible controls are mappings…

Replacing positivity constraints by an entropy barrier is popular to approximate solutions of linear programs. In the special case of the optimal transport problem, this technique dates back to the early work of Schr\"odinger. This approach…

We consider the problem of optimal incomplete transportation between the empirical measure on an i.i.d. uniform sample on the d-dimensional unit cube $[0,1]^d$ and the true measure. This is a family of problems lying in between classical…

We present a branch-and-bound algorithm for globally solving parabolic optimal control problems with binary switches that have bounded variation and possibly need to satisfy further combinatorial constraints. More precisely, for a given…