arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2308.07972cs.RO
收藏

PKE-RRT:由多任务学习模型驱动的高效多目标路径查找算法

PKE-RRT: Efficient Multi-Goal Path Finding Algorithm Driven by Multi-Task Learning Model

Waseda University(早稻田大学)

Yuan Huang

AI总结:

提出PKE-RRT算法,利用多任务学习模型PKE估计局部路径长度并预测启发式信息,结合优先访问顺序,高效解决多目标路径查找问题,实验验证其性能优越。

摘要:

多目标路径查找(MGPF)旨在寻找一条闭合且无碰撞的路径,以按顺序访问一系列目标。作为一个物理旅行商问题,具有精确权重的无向完全图对于确定访问顺序至关重要。顶点之间局部路径先验知识的缺乏,给满足算法的最优性和效率要求带来了挑战。在本研究中,设计了一个名为先验知识提取(PKE)的多任务学习模型,用于估计成对顶点之间的局部路径长度作为图的权重。同时,预测一个有前景的区域和一条引导线作为路径查找过程的启发式信息。利用PKE模型的输出,提出了一种快速探索随机树(RRT)的变体,称为PKE-RRT。它通过结合优先访问顺序的局部规划器有效解决MGPF问题,该顺序从完全图中获得。此外,预测的区域和引导线促进了树结构的高效探索,使算法能够快速提供次优解。大量数值实验证明了PKE-RRT在不同目标数量的MGPF问题上在计算时间、路径成本、样本数量和成功率方面的出色性能。

英文摘要:

Multi-goal path finding (MGPF) aims to find a closed and collision-free path to visit a sequence of goals orderly. As a physical travelling salesman problem, an undirected complete graph with accurate weights is crucial for determining the visiting order. Lack of prior knowledge of local paths between vertices poses challenges in meeting the optimality and efficiency requirements of algorithms. In this study, a multi-task learning model designated Prior Knowledge Extraction (PKE), is designed to estimate the local path length between pairwise vertices as the weights of the graph. Simultaneously, a promising region and a guideline are predicted as heuristics for the path-finding process. Utilizing the outputs of the PKE model, a variant of Rapidly-exploring Random Tree (RRT) is proposed known as PKE-RRT. It effectively tackles the MGPF problem by a local planner incorporating a prioritized visiting order, which is obtained from the complete graph. Furthermore, the predicted region and guideline facilitate efficient exploration of the tree structure, enabling the algorithm to rapidly provide a sub-optimal solution. Extensive numerical experiments demonstrate the outstanding performance of the PKE-RRT for the MGPF problem with a different number of goals, in terms of calculation time, path cost, sample number, and success rate.

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

↑