相关论文: New Computable Necessary Conditions for the Regula…

Optimal Transport (OT) is a resource allocation problem with applications in biology, data science, economics and statistics, among others. In some of the applications, practitioners have access to samples which approximate the continuous…

Existence and uniqueness for rough flows, transport and continuity equations driven by general geometric rough paths are established.

This paper introduces a graph-based, potential-guided method for path planning problems in unknown environments, where obstacles are unknown until the robots are in close proximity to the obstacle locations. Inspired by optimal transport…

The optimal transport problem with quadratic regularization is useful when sparse couplings are desired. The density of the optimal coupling is described by two functions called potentials; equivalently, potentials can be defined as a…

Transportation is an essential area in the nowadays society, both for business sector and citizenry. There are different kinds of transportation systems, each one with its own characteristics. In the same way, various areas of knowledge can…

We address the problem of optimal transport with a quadratic cost functional and a constraint on the flux through a constriction along the path. The constriction, conceptually represented by a toll station, limits the flow rate across. We…

This paper addresses the challenge of ensuring realistic traffic conditions by proposing a methodology that systematically identifies traffic simulation requirements. Using a structured approach based on sub-goals in each study phase,…

Global infrastructure robustness and local transport efficiency are critical requirements for transportation networks. However, since passengers often travel greedily to maximize their own benefit and trigger traffic jams, overall…

We investigate the link between regularised self-transport problems and maximum likelihood estimation in Gaussian mixture models (GMM). This link suggests that self-transport followed by a clustering technique leads to principled estimators…

We introduce a more restrictive version of the strict $CD(K,\infty)$ -condition, the so-called very strict $CD(K,\infty)$ -condition, and show the existence of optimal maps in very strict $CD(K,\infty)$ -spaces despite the possible lack of…

For the classical N-body problem, an approach is proposed based on the introduction of some natural in the physical sense optimization problems of mathematical programming for finding a conditional minimum for the characteristics of the…

In this paper, we introduce a class of nonlinear optimisation problems. Under mild assumptions, we obtain the existence of potential functions and show that the potential function is a generalised solution of a Monge-Amp\`ere type equation.…

Quantum optimal transportation seeks an operator which minimizes the total cost of transporting a quantum state to another state, under some constraints that should be satisfied during transportation. We formulate this issue by extending…

The classical problem of optimal transportation can be formulated as a linear optimization problem on a convex domain: among all joint measures with fixed marginals find the optimal one, where optimality is measured against a cost function.…

The theory of optimal transportation has developed into a powerful and elegant framework for comparing probability distributions, with wide-ranging applications in all areas of science. The fundamental idea of analyzing probabilities by…

Transport engineering has significant potential to benefit from quantum computing. The rise of intelligent transport systems, autonomous vehicles, and the Internet of Things has created an unprecedented demand for efficient information…

We introduce a discrete-time fractional calculus of variations. First and second order necessary optimality conditions are established. Examples illustrating the use of the new Euler-Lagrange and Legendre type conditions are given. They…

In this paper we address several constrained transportation optimization problems (e.g. vehicle routing, shortest Hamiltonian path), for which we present novel algorithmic solutions and extensions, considering several optimization…

The aim of this work is to develop general optimization methods for finite difference schemes used to approximate linear differential equations. The specific case of the transport equation is exposed. In particular, the minimization of the…

This paper presents a widely applicable approach to solving (multi-marginal, martingale) optimal transport and related problems via neural networks. The core idea is to penalize the optimization problem in its dual formulation and reduce it…