5 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.CG2017★ 5 cited
Efficient Nearest-Neighbor Search for Dynamical Systems with Nonholonomic Constraints
Valerio Varricchio, Brian Paden, Dmitry Yershov +1
Nearest-neighbor search dominates the asymptotic complexity of sampling-based motion planning algorithms and is often addressed with k-d tree data structures. While it is generally…
cs.RO2016
Design of Admissible Heuristics for Kinodynamic Motion Planning via Sum-of-Squares Programming
Brian Paden, Valerio Varriccho, Emilio Frazzoli
How does one obtain an admissible heuristic for a kinodynamic motion planning problem? This paper develops the analytical tools and techniques to answer this question. A sufficient…