2 citations · 2 across the 1 of their papers we have counts for
2 papers
cs.RO2017★ 2 cited
Anytime Motion Planning on Large Dense Roadmaps with Expensive Edge Evaluations
Shushman Choudhury, Oren Salzman, Sanjiban Choudhury +2
We propose an algorithmic framework for efficient anytime motion planning on large dense geometric roadmaps, in domains where collision checks and therefore edge evaluations are co…
cs.DS2016
A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors
Christopher M. Dellin, Siddhartha S. Srinivasa
While the shortest path problem has myriad applications, the computational efficiency of suitable algorithms depends intimately on the underlying problem domain. In this paper, we…