No-collision Transportation Maps

TL;DR

This paper introduces no-collision transportation maps that prevent particle collisions, characterizes them via half-space preservation, connects them to BSP trees, and shows they approximate optimal transport maps efficiently.

Contribution

It characterizes no-collision maps through half-space preservation, links them to BSP trees, and provides efficient algorithms to construct nearly optimal transportation maps.

Findings

BSP algorithms for no-collision maps run in O(n log n) time.

No-collision maps approximate optimal transport maps within a few percent.

Maps are effective for computing nearly optimal solutions in Wasserstein metrics.

Abstract

Transportation maps between probability measures are critical objects in numerous areas of mathematics and applications such as PDE, fluid mechanics, geometry, machine learning, computer science, and economics. Given a pair of source and target measures, one searches for a map that has suitable properties and transports the source measure to the target one. Here, we study maps that possess the \textit{no-collision} property; that is, particles simultaneously traveling from sources to targets in a unit time with uniform velocities do not collide. These maps are particularly relevant for applications in swarm control problems. We characterize these no-collision maps in terms of \textit{half-space preserving} property and establish a direct connection between these maps and \textit{binary-space-partitioning (BSP) tree} structures. Based on this characterization, we provide explicit BSP algorithms, of cost $O(n \log n)$, to construct no-collision maps. Moreover, interpreting these maps as approximations of optimal transportation maps, we find that they succeed in computing nearly optimal maps for $q$-Wasserstein metric ($q=1,2$). In some cases, our maps yield costs that are just a few percent off from being optimal.