arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1204.3820eess.SYcs.AIcs.ROcs.SY
收藏

图上具有紧收敛时间保证的距离最优编队控制

Distance Optimal Formation Control on Graphs with a Tight Convergence Time Guarantee

University of Illinois at Urbana-Champaign(伊利诺伊大学厄巴纳-香槟分校)

Jingjin Yu, Steven M. LaValle

AI总结:

针对连通图上单位边距下无碰撞移动多个不可区分智能体到任意目标顶点集的任务,提出一种快速距离最优控制算法,并给出紧收敛时间保证。

摘要:

对于在单位边距的连通图上将一组不可区分智能体无碰撞地移动到任意目标顶点集的任务,我们提出了一种快速距离最优控制算法,引导智能体进入期望编队。此外,我们证明了该算法还提供了紧收敛时间保证(时间最优性和距离最优性无法同时满足)。我们的通用图表述允许该算法应用于诸如具有孔洞(模拟障碍物)的任意维度网格等场景。在线可用的仿真验证了我们的理论发展。

英文摘要:

For the task of moving a set of indistinguishable agents on a connected graph with unit edge distance to an arbitrary set of goal vertices, free of collisions, we propose a fast distance optimal control algorithm that guides the agents into the desired formation. Moreover, we show that the algorithm also provides a tight convergence time guarantee (time optimality and distance optimality cannot be simultaneously satisfied). Our generic graph formulation allows the algorithm to be applied to scenarios such as grids with holes (modeling obstacles) in arbitrary dimensions. Simulations, available online, confirm our theoretical developments.

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

↑