ABF-RRT*: Bidirectional fast optimal rapidly-exploring random tree via adaptive sampling of a permissible hyper-ellipsoid

Abstract This paper proposes a global path planning algorithm based on adaptive sampling and bidirectional fast exploration, ABF-RRT*. ABF-RRT* introduces an adaptive sampler that dynamically constructs a hyper-ellipsoid according to the progress of dual-tree exploration and adaptively weighs the sa...

Description complète

Détails bibliographiques

Auteurs principaux:	Zhaoyang Zeng, Yufang Chang
Format:	Artigo
Langue:	Inglês
Publié:	Springer 2025-08-01
Collection:	Journal of King Saud University: Computer and Information Sciences
Sujets:	Motion planning Sampling-based algorithms Rapidly-exploring random tree (RRT) Optimal path planning
Accès en ligne:	https://doi.org/10.1007/s44443-025-00186-0
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!