Surface Optimal Path Planning Using An Extended Dijkstra Algorithm

Extensive studies have been conducted on the Dijkstra algorithm owing to its bright prospect. However, few of them have studied the surface path planning of mobile robots. Currently, some application fields (e.g., wild ground, planet ground, and game scene) need to solve the optimal surface path. Th...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE access Ročník 8; s. 1
Hlavní autori:	Luo, Min, Hou, Xiaorong, Yang, Jing
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Piscataway IEEE 01.01.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Delaunay triangulation Dijkstra algorithm Dijkstra's algorithm Euclidean distance Finite element method Mobile robots Multiple robots Optimization Optimization methods Path planning Planning Routing Surface Task analysis Transportation
ISSN:	2169-3536, 2169-3536
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!