arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2308.03026cs.RO
收藏

CDT-Dijkstra:二维连续空间中所有点全局最优路径的快速规划

CDT-Dijkstra: Fast Planning of Globally Optimal Paths for All Points in 2D Continuous Space

Zhejiang University of Technology(浙江工业大学);United Institute of Informatics Problems of the National Academy of Sciences of Belarus(白俄罗斯国家科学院联合信息学问题研究所)

Jinyuan Liu, Minglei Fu, Wenan Zhang, Bo Chen, Ryhor Prakapovich, Uladzislau Sychou

AI总结:

本文提出CDT-Dijkstra算法,通过将二维连续空间路径规划问题降至一维切割线状态空间,实现从单点到所有点的全局最优路径快速计算,并在复杂任务中优于现有先进算法。

摘要:

Dijkstra算法是一种经典的路径规划方法,在离散图空间中,它可以从指定的源节点出发,找到源节点与图中所有其他节点之间的最短路径。然而,据我们所知,目前尚无有效方法能够在连续空间中实现与Dijkstra算法类似的功能。本研究提出了一种称为凸分解拓扑(CDT)-Dijkstra的最优路径规划算法,该算法能够快速计算二维连续空间中从一点到所有其他点的全局最优路径。CDT-Dijkstra主要分为两个阶段:SetInit和GetGoal。在SetInit阶段,算法能够基于初始点x_{init}快速获得所有切割线的最优CDT编码集。在GetGoal阶段,算法能够以极高的速度返回任意目标点的全局最优路径。在本研究中,我们提出并证明了仅考虑切割线上点的规划原理,从而将距离最优路径规划任务的状态空间从二维降至一维。此外,我们提出了一种在同质类中寻找最优路径的快速方法,并从理论上证明了该方法的正确性。最后,通过在一系列环境中的测试,实验结果表明,CDT-Dijkstra不仅能够一次性规划出所有点的最优路径,而且在某些复杂任务上与先进算法相比具有显著优势。

英文摘要:

The Dijkstra algorithm is a classic path planning method, which in a discrete graph space, can start from a specified source node and find the shortest path between the source node and all other nodes in the graph. However, to the best of our knowledge, there is no effective method that achieves a function similar to that of the Dijkstra's algorithm in a continuous space. In this study, an optimal path planning algorithm called convex dissection topology (CDT)-Dijkstra is developed, which can quickly compute the global optimal path from one point to all other points in a 2D continuous space. CDT-Dijkstra is mainly divided into two stages: SetInit and GetGoal. In SetInit, the algorithm can quickly obtain the optimal CDT encoding set of all the cut lines based on the initial point x_{init}. In GetGoal, the algorithm can return the global optimal path of any goal point at an extremely high speed. In this study, we propose and prove the planning principle of considering only the points on the cutlines, thus reducing the state space of the distance optimal path planning task from 2D to 1D. In addition, we propose a fast method to find the optimal path in a homogeneous class and theoretically prove the correctness of the method. Finally, by testing in a series of environments, the experimental results demonstrate that CDT-Dijkstra not only plans the optimal path from all points at once, but also has a significant advantage over advanced algorithms considering certain complex tasks.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑