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

使用多个随机树的多目标路径规划

Multi-goal path planning using multiple random trees

Czech Technical University in Prague(布拉格捷克理工大学)

Jaroslav Janoš, Vojtěch Vonásek, Robert Pěnička

AI总结:

针对障碍物环境中多目标路径规划需为TSP提供短目标间路径的问题,提出多随机树采样规划器SFF*,通过并行建林、显式扩展节点与RRT*重布线获得更短无碰撞路径并降低TSP总成本。

摘要:

本文提出了一种新颖的基于采样的规划器,用于障碍物之间的多目标路径规划,其目标是在最小化行程成本的同时访问预定义的目标位置。访问目标的顺序通常通过求解旅行商问题(TSP)或其变体来实现。TSP需要定义各个目标之间的成本,而在带有障碍物的地图中,这需要计算目标之间的相互路径。这些通过路径规划找到的路径既用于定义成本(例如基于其长度或遍历时间),也定义了后续在最终解决方案中使用的路径。为了使TSP能够找到高质量的解决方案,必须尽可能短地找到这些目标到目标的路径。我们提出了一种名为Space-Filling Forest(SFF*)的基于采样的规划器,用于解决寻找无碰撞路径的部分。SFF*使用从目标逐步且同时构建的多个树(森林),并尝试找到与其他树的连接以形成路径。与使用最近邻规则选择扩展节点的快速探索随机树(RRT)不同,SFF*维护一个明确的扩展节点列表。各个树以RRT*方式生长,即通过重新连接节点以最小化其成本。计算结果表明,SFF*比现有方法提供更短的目标到目标路径,因此最终的TSP解决方案也具有更低的成本。

英文摘要:

In this paper, we propose a novel sampling-based planner for multi-goal path planning among obstacles, where the objective is to visit predefined target locations while minimizing the travel costs. The order of visiting the targets is often achieved by solving the Traveling Salesman Problem (TSP) or its variants. TSP requires to define costs between the individual targets, which - in a map with obstacles - requires to compute mutual paths between the targets. These paths, found by path planning, are used both to define the costs (e.g., based on their length or time-to-traverse) and also they define paths that are later used in the final solution. To enable TSP finding a good-quality solution, it is necessary to find these target-to-target paths as short as possible. We propose a sampling-based planner called Space-Filling Forest (SFF*) that solves the part of finding collision-free paths. SFF* uses multiple trees (forest) constructed gradually and simultaneously from the targets and attempts to find connections with other trees to form the paths. Unlike Rapidly-exploring Random Tree (RRT), which uses the nearest-neighbor rule for selecting nodes for expansion, SFF* maintains an explicit list of nodes for expansion. Individual trees are grown in a RRT* manner, i.e., with rewiring the nodes to minimize their cost. Computational results show that SFF* provides shorter target-to-target paths than existing approaches, and consequently, the final TSP solutions also have a lower cost.

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

↑