HB-RRT:A path planning algorithm for mobile robots using Halton sequence-based rapidly-exploring random tree

Path planning remains crucial for efficient robot operation. A Halton Biased Rapidly-exploring Random Tree (HB-RRT) path planning algorithm is introduced in this study. The Halton sequence, known for its uniform distribution and low discrepancy, is employed for sampling. Issues arising from the pseu...

Celý popis

Podrobná bibliografie

Vydáno v:	Engineering applications of artificial intelligence Ročník 133; s. 108362
Hlavní autoři:	Zhong, Huageng, Cong, Ming, Wang, Minghao, Du, Yu, Liu, Dong
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 01.07.2024
Témata:	Halton sequence Mobile robotics Optimal path planning Path planning Rapidly-exploring random tree (RRT) Sampling-based algorithms Path planning Rapidly-exploring random tree (RRT) Halton sequence Optimal path planning Mobile robotics Sampling-based algorithms
ISSN:	0952-1976, 1873-6769
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!