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

多智能体路径规划与网络流

Multi-agent Path Planning and Network Flow

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

Jingjin Yu, Steven M. LaValle

AI总结:

将图上的多智能体路径规划问题归约到网络流问题,利用组合网络流算法和线性规划技术求解,并证明当目标置换不变时存在最长完成时间不超过 n+V-1 步的可行解路径集,给出 O(nVE) 时间算法,进一步研究时间和距离最优性及其帕累托最优结构。

摘要:

本文将图(路标图)上的多智能体路径规划与网络流问题联系起来,表明前者可以归约到后者,从而使得组合网络流算法以及一般的线性规划技术能够应用于图上的多智能体路径规划问题。利用这一联系,我们证明当目标是置换不变时,该问题总是存在一个可行解路径集,其最长完成时间不超过 $n + V - 1$ 步,其中 $n$ 是智能体数量,$V$ 是底层图的顶点数。然后,我们给出一个完整算法,在 $O(nVE)$ 时间内找到这样的解,其中 $E$ 是图的边数。进一步,我们研究可行解的时间和距离最优性,表明它们具有成对的帕累托最优结构,并再次为优化这两个实际目标提供了高效算法。

英文摘要:

This paper connects multi-agent path planning on graphs (roadmaps) to network flow problems, showing that the former can be reduced to the latter, therefore enabling the application of combinatorial network flow algorithms, as well as general linear program techniques, to multi-agent path planning problems on graphs. Exploiting this connection, we show that when the goals are permutation invariant, the problem always has a feasible solution path set with a longest finish time of no more than $n + V - 1$ steps, in which $n$ is the number of agents and $V$ is the number of vertices of the underlying graph. We then give a complete algorithm that finds such a solution in $O(nVE)$ time, with $E$ being the number of edges of the graph. Taking a further step, we study time and distance optimality of the feasible solutions, show that they have a pairwise Pareto optimal structure, and again provide efficient algorithms for optimizing two of these practical objectives.

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

↑