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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE access Jg. 8; S. 1
Hauptverfasser:	Luo, Min, Hou, Xiaorong, Yang, Jing
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Piscataway IEEE 01.01.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!