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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer
2025-08-01
|
| Series: | Journal of King Saud University: Computer and Information Sciences |
| Subjects: | |
| Online Access: | https://doi.org/10.1007/s44443-025-00186-0 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|