Greedy Heuristics for Rapidly Exploring Random Trees in High-Dimensional State Spaces

This article presents Greedy RRT* (G-RRT*), an asymptotically optimal sampling-based planning algorithm that leverages greedy heuristics and bidirectional search to quickly find high-quality solutions in complex high-dimensional state spaces.