Path planning of intelligent mobile robot based on Dijkstra algorithm

Under the premise of grid environment modeling method, a relaxed Dijkstra algorithm is proposed to solve the problem of real-time path planning for mobile robot in large-scale and obstacle intensive working environment. Firstly, four neighborhood search is used to construct the Manhattan distance po...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of physics. Conference series Ročník 2083; číslo 4; s. 42034 - 42041
Hlavný autor:	Li, Xueyan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	IOP Publishing 01.11.2021
Predmet:	Grid method Mobile robot Path planning Relaxed Dijkstra algorithm
ISSN:	1742-6588, 1742-6596
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!