arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0609624math.OC
收藏

无需通信的多辆车的高效路由

Efficient routing of multiple vehicles with no communications

Alessandro Arsie, Emilio Frazzoli

摘要:

在本文中,我们考虑了一类动态车辆路径问题,其中的一些移动代理在平面上必须访问随着时间的推移产生的随机过程的目标点。期望设计运动协调策略,以便最小化目标点的出现与其被代理之一访问的时间之间的预期时间。我们提出的控制策略,而使最小或没有假设代理之间的通信,提供最知名的分散策略所实现的稳态性能相同的水平。换句话说,我们证明了代理间的通信并没有提高这样的系统的效率,而只是影响收敛到稳定状态的收敛速率。此外,所提出的策略不依赖于基本的随机过程的细节的知识。最后,我们表明,我们提出的策略提供了一个有效的,纯粹的纳什均衡的问题,其中每个代理的目标是最大限度地提高访问的目标数量的博弈论制定。仿真结果进行了介绍和讨论。

英文摘要:

In this paper we consider a class of dynamic vehicle routing problems, in which a number of mobile agents in the plane must visit target points generated over time by a stochastic process. It is desired to design motion coordination strategies in order to minimize the expected time between the appearance of a target point and the time it is visited by one of the agents. We propose control strategies that, while making minimal or no assumptions on communications between agents, provide the same level of steady-state performance achieved by the best known decentralized strategies. In other words, we demonstrate that inter-agent communication does not improve the efficiency of such systems, but merely affects the rate of convergence to the steady state. Furthermore, the proposed strategies do not rely on the knowledge of the details of the underlying stochastic process. Finally, we show that our proposed strategies provide an efficient, pure Nash equilibrium in a game theoretic formulation of the problem, in which each agent's objective is to maximize the number of targets it visits. Simulation results are presented and discussed.

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

↑