返回
Surface Optimal Path Planning Using an Extended Dijkstra Algorithm
DOI:10.1109/ACCESS.2020.3015976.png)
摘要
En 中文
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. This paper proposes an extended Dijkstra algorithm. We utilize the Delaunay triangulation to model the surface environment. Based on keeping the triangle side length unchanged, the triangle mesh on the surface is equivalently converted into a triangle on the two-dimensional plane. Through this transformation, we set up the two-dimensional developable passable channel of the surface and solve the optimal route on this channel. Traversing all the two-dimensional developable and passable paths of the surface, we can get the shortest route among all the optimal paths. Then the inverse transformation from the two-dimensional plane coordinates to the corresponding surface coordinates obtains the surface optimal path. The simulation results show that, compared with the traditional Dijkstra algorithm, this method improves the accuracy of the surface optimization path in single-robot single-target and multi-robot multi-target path planning tasks.
Keyword:
Path planning
Euclidean distance
Planning
Transportation
Task analysis
Mobile robots
Routing
Dijkstra algorithm
path planning
surface
Delaunay triangulation
mobile robots
optimization methods
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
32.6W
机构
暂无机构信息
引用论文
Composition, toxic and antinutritional factors of newly developed cultivars of Brazilian soybean (Glycine max).巴西大豆(Glycine max)新开发品种的组成、毒性和抗营养因子。
A Multi-Scale Map Method Based on Bioinspired Neural Network Algorithm for Robot Path Planning
IEEE ACCESS
IF3.6

