相关论文: Stability of optimal traffic plans in the irrigati…

We show in full generality the stability of optimal traffic paths in branched transport: namely we prove that any limit of optimal traffic paths is optimal as well. This solves an open problem in the field (cf. Open problem 1 in the book…

We consider two variational models for transport networks, an urban planning and a branched transport model, in both of which there is a preference for networks that collect and transport lots of mass together rather than transporting all…

We prove that optimal traffic plans for the mailing problem in $\mathbb{R}^d$ are stable with respect to variations of the given coupling, above the critical exponent $\alpha=1-1/d$, thus solving an open problem stated in the book "Optimal…

This paper introduces two variational formulations for a model of robust optimal transport, that is, the problem of designing optimal transport networks that are resilient to potential damages, balancing construction costs against the…

We provide a new proof of the known partial regularity result for the optimal transportation map (Brenier map) between two sets. Contrary to the existing regularity theory for the Monge-Amp{\`e}re equation, which is based on the maximum…

We analyze controlled mass transportation plans with free end-time that minimize the transport cost induced by the generating function of a Lagrangian within a bounded domain, in addition to costs incurred as export and import tariffs at…

First we present two classical models of Branched Transport: the Lagrangian model introduced by Bernot, Caselles, Morel, Maddalena, Solimini, and the Eulerian model introduced by Xia. An emphasis is put on the Lagrangian model, for which we…

We consider optimal transport problems where the cost is optimized over controlled dynamics and the end time is free. Unlike the classical setting, the search for optimal transport plans also requires the identification of optimal "stopping…

Under mild regularity assumptions, the transport problem is stable in the following sense: if a sequence of optimal transport plans $\pi_1, \pi_2, \ldots$ converges weakly to a transport plan $\pi$, then $\pi$ is also optimal (between its…

Models involving branched structures are employed to describe several supply-demand systems such as the structure of the nerves of a leaf, the system of roots of a tree and the nervous or cardiovascular systems. Given a flow (traffic path)…

We study Monge's optimal transportation problem, where the cost is given by optimal control cost. We prove the existence and uniqueness of an optimal map under certain regularity conditions on the Lagrangian, absolute continuity of the…

The optimal (Monge-Kantorovich) transportation problem is discussed from several points of view. The Lagrangian formulation extends the action of the {\em Lagrangian} $L(v,x,t)$ from the set of orbits in $\R^n$ to a set of measure-valued…

The Gilbert-Steiner problem is a mass transportation problem, where the cost of the transportation depends on the network used to move the mass and it is proportional to a certain power of the "flow". In this paper, we introduce a new…

We establish the stability of solutions to the entropically regularized optimal transport problem with respect to the marginals and the cost function. The result is based on the geometric notion of cyclical invariance and inspired by the…

We propose an algorithm using method of evolving junctions to solve the optimal path planning problems with piece-wise constant flow fields. In such flow fields with a convex Lagrangian in the objective function, we can prove that the…

We study the optimal transport problem in the Euclidean space where the cost function is given by the value function associated with a Linear Quadratic minimization problem. Under appropriate assumptions, we generalize Brenier's Theorem…

We prove some theorems on the existence, uniqueness, stability and compactness properties of solutions to inhomogeneous transport equations with Sobolev coefficients, where the inhomogeneous term depends upon the solution through an…

The branched transport problem, a popular recent variant of optimal transport, is a non-convex and non-smooth variational problem on Radon measures. The so-called urban planning problem, on the contrary, is a shape optimization problem that…

We prove quantitative bounds on the stability of optimal transport maps and Kantorovich potentials from a fixed source measure $\rho$ under variations of the target measure $\mu$, when the cost function is the squared Riemannian distance on…

$c$-cyclical monotonicity is the most important optimality condition for an optimal transport plan. While the proof of necessity is relatively easy, the proof of sufficiency is often more difficult or even elusive. We present here a new…