22 citations · 30 across the 10 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
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.RO2017★ 2 cited
The Generalized Label Correcting Method for Optimal Kinodynamic Motion Planning
Brian Paden
Nearly all autonomous robotic systems use some form of motion planning to compute reference motions through their environment. An increasing use of autonomous robots in a broad ran…
cs.RO2017
Landmark Guided Probabilistic Roadmap Queries
Brian Paden, Yannik Nager, Emilio Frazzoli
A landmark based heuristic is investigated for reducing query phase run-time of the probabilistic roadmap (\PRM) motion planning method. The heuristic is generated by storing minim…