arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2204.00567cs.ROcs.GR
收藏

紧空间中非对称交互的多智能体路径规划

Multi-Agent Path Planning with Asymmetric Interactions In Tight Spaces

University of Toronto(多伦多大学);Texas A&M University(德州农工大学)

Vismay Modi, Yixin Chen, Abhishek Madan, Shinjiro Sueda, David I. W. Levin

摘要:

从运动基本上是一个决策问题的假设出发,我们使用世界线的概念,从狭义相对论的启发,一种新的多智能体路径规划方法。我们已经确定了一组特殊的问题,到目前为止被忽视的以前的作品。我们提出了我们的解决方案,为每个代理的全局路径规划问题,并确保顺利本地避碰的每对代理在现场。我们通过将代理的轨迹建模为2D空间和时间的3D曲线来实现这一点。全局路径规划是使用修改后的Replikstra算法来解决的,以确保代理的初始轨迹不相交。然后,我们使用拟牛顿内点求解器求解平滑的局部轨迹,为轨迹曲线提供半径,将其变成杆。随后,解决杆的碰撞确保没有两个代理同时处于相同的空间位置。这种时空公式使我们能够模拟以前被忽视的现象,如在非常有限的环境中高度不对称的相互作用。它还为具有不自然对称代理对齐的场景提供了解决方案,而不需要抖动代理位置或速度。

英文摘要:

By starting with the assumption that motion is fundamentally a decision making problem, we use the world-line concept from Special Relativity as the inspiration for a novel multi-agent path planning method. We have identified a particular set of problems that have so far been overlooked by previous works. We present our solution for the global path planning problem for each agent and ensure smooth local collision avoidance for each pair of agents in the scene. We accomplish this by modeling the trajectories of the agents through 2D space and time as curves in 3D. Global path planning is solved using a modified Djikstra's algorithm to ensure that initial trajectories for agents do not intersect. We then solve for smooth local trajectories using a quasi-Newton interior point solver, providing the trajectory curves with a radius to turn them into rods. Subsequently, resolving collision of the rods ensures that no two agents are in the same spatial position at the same time. This space-time formulation allows us to simulate previously ignored phenomena such as highly asymmetric interactions in very constrained environments. It also provides a solution for scenes with unnaturally symmetric agent alignments without the need for jittering agent positions or velocities.

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

↑