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

基于图卷积神经网络的约束最短路径搜索

Constrained Shortest Path Search with Graph Convolutional Neural Networks

Safran Electronics & Defense(赛峰电子与防务公司);LAMSADE, Université Paris-Dauphine(巴黎多芬大学LAMSADE实验室);Safran SA(赛峰集团);MACCLIA, Ecoles de Saint-Cyr Coëtquidan(圣西尔军校MACCLIA机构)

Kevin Osanlou, Christophe Guettier, Andrei Bursuc, Tristan Cazenave, Eric Jacopin

摘要:

自主无人地面车辆(AUGV)的规划仍然是一个挑战,特别是在困难的,越野的,关键的情况下。自动规划可用于达到任务目标,执行导航或机动。大多数情况下,问题在于找到从源到目的地的路径,同时满足一些操作约束。在无负圈的图中,从起始点到结束点的单对最短路的计算在多项式时间内解决。然而,解决方案路径上的额外约束可能会使问题更难解决。当我们需要路径通过几个强制节点而不需要特定的访问顺序时,就会出现这种情况。复杂性随着要访问的强制节点的数量呈指数级增长。在本文中,我们专注于最短路径搜索与强制节点上给定的连通图。我们提出了一个混合模型,结合了基于约束的求解器和图卷积神经网络,以提高搜索性能。在现实的场景中获得了令人满意的结果。

英文摘要:

Planning for Autonomous Unmanned Ground Vehicles (AUGV) is still a challenge, especially in difficult, off-road, critical situations. Automatic planning can be used to reach mission objectives, to perform navigation or maneuvers. Most of the time, the problem consists in finding a path from a source to a destination, while satisfying some operational constraints. In a graph without negative cycles, the computation of the single-pair shortest path from a start node to an end node is solved in polynomial time. Additional constraints on the solution path can however make the problem harder to solve. This becomes the case when we need the path to pass through a few mandatory nodes without requiring a specific order of visit. The complexity grows exponentially with the number of mandatory nodes to visit. In this paper, we focus on shortest path search with mandatory nodes on a given connected graph. We propose a hybrid model that combines a constraint-based solver and a graph convolutional neural network to improve search performance. Promising results are obtained on realistic scenarios.

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

↑