A batch informed sampling-based algorithm for fast anytime asymptotically-optimal motion planning in cluttered environments

•Present an anytime asymptotically-optimal motion planning algorithm.•A strategy is proposed that balances the “lazy” and “non-lazy” optimal search.•Analyze the swift convergence and computational complexity for the algorithm.•The proposed algorithm is comprehensively evaluated by rigorous experimen...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Expert systems with applications Ročník 144; s. 113124
Hlavní autori:	Xu, Jing, Song, Kechen, Dong, Hongwen, Yan, Yunhui
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Elsevier Ltd 15.04.2020 Elsevier BV
Predmet:	Algorithms Anytime algorithm Asymptotic optimality Asymptotic properties Cost analysis Expert systems Graph theory Modules Motion planning Motion stability Optimal path planning Robustness (mathematics) Sampling Searching Motion planning Asymptotic optimality Optimal path planning Anytime algorithm
ISSN:	0957-4174, 1873-6793
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!