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...
Main Authors: | Min Luo, Xiaorong Hou, Jing Yang |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9165710/ |
Similar Items
-
Path Planning of Rail-Mounted Logistics Robots Based on the Improved Dijkstra Algorithm
by: Xiwei Zhou, et al.
Published: (2023-09-01) -
A Dynamic Fusion Pathfinding Algorithm Using Delaunay Triangulation and Improved A-Star for Mobile Robots
by: Zhihai Liu, et al.
Published: (2021-01-01) -
A Comprehensive Survey on Delaunay Triangulation: Applications, Algorithms, and Implementations Over CPUs, GPUs, and FPGAs
by: Yahia S. Elshakhs, et al.
Published: (2024-01-01) -
Shortest Path Search Futsal Field Location With Dijkstra Algorithm
by: Delpiah Wahyuningsih, et al.
Published: (2018-07-01) -
An RRT-Dijkstra-Based Path Planning Strategy for Autonomous Vehicles
by: Ruinan Chen, et al.
Published: (2022-11-01)