Bi-HS-RRTX: an efficient sampling-based motion planning algorithm for unknown dynamic environments

In the field of autonomous mobile robots, sampling-based motion planning methods have demonstrated their efficiency in complex environments. Although the Rapidly-exploring Random Tree (RRT) algorithm and its variants have achieved significant success in known static environment, it is still challeng...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Complex & intelligent systems Ročník 10; číslo 6; s. 7497 - 7512
Hlavní autori: Liao, Longjie, Xu, Qimin, Zhou, Xinyi, Li, Xu, Liu, Xixiang
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Cham Springer International Publishing 01.12.2024
Springer Nature B.V
Predmet:
Algorithms
Asymptotic methods
Complexity
Computational Intelligence
Data Structures and Information Theory
Efficiency
Engineering
Heuristic
Motion planning
Optimization
Original Article
Real time
Robot dynamics
Sampling
Searching
Unknown environments
Motion planning
Replanning
Bidirectional search
Heuristic sampling
Dynamic environments
ISSN:2199-4536, 2198-6053
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In the field of autonomous mobile robots, sampling-based motion planning methods have demonstrated their efficiency in complex environments. Although the Rapidly-exploring Random Tree (RRT) algorithm and its variants have achieved significant success in known static environment, it is still challenging in achieving optimal motion planning in unknown dynamic environments. To address this issue, this paper proposes a novel motion planning algorithm Bi-HS-RRT X , which facilitates asymptotically optimal real-time planning in continuously changing unknown environments. The algorithm swiftly determines an initial feasible path by employing the bidirectional search. When dynamic obstacles render the planned path infeasible, the bidirectional search is reactivated promptly to reconstruct the search tree in a local area, thereby significantly reducing the search planning time. Additionally, this paper adopts a hybrid heuristic sampling strategy to optimize the planned path quality and search efficiency. The convergence of the proposed algorithm is accelerated by merging local biased sampling with nominal path and global heuristic sampling in hyper-ellipsoid region. To verify the effectiveness and efficiency of the proposed algorithm in unknown dynamic environments, numerous comparative experiments with existing algorithms were conducted. The experimental results indicate that the proposed planning algorithm has significant advantages in planned path length and planning time.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2199-4536
2198-6053
DOI:10.1007/s40747-024-01557-2