3 citations · 3 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…
cs.RO2013
Free-configuration Biased Sampling for Motion Planning: Errata
Joshua Bialkowski, Michael Otte, Emilio Frazzoli
This document contains improved and updated proofs of convergence for the sampling method presented in our paper "Free-configuration Biased Sampling for Motion Planning".
cs.RO2013★ 3 cited
Fast Collision Checking: From Single Robots to Multi-Robot Teams
Joshua Bialkowski, Michael Otte, Emilio Frazzoli
We examine three different algorithms that enable the collision certificate method from [Bialkowski, et al.] to handle the case of a centralized multi-robot team. By taking advanta…