Guided Incremental Local Densification for Accelerated Sampling-based Motion Planning
Aditya Mandalika, Rosario Scalise, Brian Hou, Sanjiban Choudhury,, Siddhartha S. Srinivasa

TL;DR
This paper introduces GuILD, a novel sampling strategy that improves motion planning efficiency by utilizing shorter paths to vertices within the search tree, outperforming traditional uniform sampling methods.
Contribution
GuILD is a new method that guides sampling by leveraging shorter paths to vertices, enhancing incremental densification in motion planning.
Findings
GuILD outperforms uniform sampling in simulated environments.
GuILD accelerates convergence to optimal paths.
GuILD is effective in high-dimensional and complex environments.
Abstract
Sampling-based motion planners rely on incremental densification to discover progressively shorter paths. After computing feasible path between start and goal , the Informed Set (IS) prunes the configuration space by conservatively eliminating points that cannot yield shorter paths. Densification via sampling from this Informed Set retains asymptotic optimality of sampling from the entire configuration space. For path length and Euclidean heuristic , . Relying on the heuristic can render the IS especially conservative in high dimensions or complex environments. Furthermore, the IS only shrinks when shorter paths are discovered. Thus, the computational effort from each iteration of densification and planning is wasted if it fails to yield a shorter path, despite improving the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · Robotics and Sensor-Based Localization · Human Pose and Action Recognition
