AM-RRT*: Informed Sampling-based Planning with Assisting Metric
Daniel Armstrong, Andr\'e Jonasson

TL;DR
This paper introduces AM-RRT*, a sampling-based path planning algorithm that uses an assisting metric to improve performance in complex environments, achieving faster planning times and shorter paths while maintaining probabilistic completeness and optimality.
Contribution
The paper proposes a novel extension of RRT* that incorporates an assisting distance metric and targeted rewiring, significantly enhancing planning efficiency in obstacle-rich environments.
Findings
Planning times reduced by 99.5% compared to existing methods.
Path lengths decreased by 9.8% with the new approach.
Effective in environments with narrow passages and dynamic goal shifts.
Abstract
In this paper, we present a new algorithm that extends RRT* and RT-RRT* for online path planning in complex, dynamic environments. Sampling-based approaches often perform poorly in environments with narrow passages, a feature common to many indoor applications of mobile robots as well as computer games. Our method extends RRT-based sampling methods to enable the use of an assisting distance metric to improve performance in environments with obstacles. This assisting metric, which can be any metric that has better properties than the Euclidean metric when line of sight is blocked, is used in combination with the standard Euclidean metric in such a way that the algorithm can reap benefits from the assisting metric while maintaining the desirable properties of previous RRT variants - namely probabilistic completeness in tree coverage and asymptotic optimality in path length. We also…
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
MethodsDiffusion
