97 citations · 102 across the 3 of their papers we have counts for
3 papers
cs.DS2013
An O(M log M) Algorithm for Bipartite Matching with Roadmap Distances
Kyle Treleaven, Josh Bialkowski, Emilio Frazzoli
An algorithm is presented which produces the minimum cost bipartite matching between two sets of M points each, where the cost of matching two points is proportional to the minimum…
stat.CO2013★ 5 cited
An Explicit Formulation of the Earth Movers Distance with Continuous Road Map Distances
Kyle Treleaven, Emilio Frazzoli
The Earth movers distance (EMD) is a measure of distance between probability distributions which is at the heart of mass transportation theory. Recent research has shown that the E…
eess.SY2012★ 97 cited
Asymptotically Optimal Algorithms for Pickup and Delivery Problems with Application to Large-Scale Transportation Systems
Kyle Treleaven, Marco Pavone, Emilio Frazzoli
The Stacker Crane Problem is NP-Hard and the best known approximation algorithm only provides a 9/5 approximation ratio. The objective of this paper is threefold. First, by embeddi…