On the transfer time complexity of cooperative vehicle routing

Abstract

Motivated by next-generation air transportation systems, this paper investigates the relationship between traffic volume and congestion in a multi-agent system, assuming that the agents can communicate their intentions with one another. In particular, we consider n independent mobile agents, each assigned an origin and a destination point, and study how the minimum time necessary to safely transfer all agents from their origin to their destination scales with the number of agents n. We provide an algorithm for which the transfer time scales logarithmically in n. This is an improvement over previous results that rely on more conservative conflict models because the agents do not leverage inter-agent cooperation to the same degree, resulting in transfer times that scale as √n.

Original document

The different versions of the original document can be found in:

• https://dspace.mit.edu/bitstream/1721.1/65572/2/Frazzoli-2010-On%20the%20transfer%20time%20complexity%20of%20cooperative%20vehicle%20routing.pdf

• http://xplorestaging.ieee.org/ielx5/5512481/5530425/05530630.pdf?arnumber=5530630,

http://dx.doi.org/10.1109/acc.2010.5530630

• http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005530630,

http://dspace.mit.edu/handle/1721.1/65572,

https://people.kth.se/~dimos/ACC10Complexity.pdf,

https://ieeexplore.ieee.org/document/5530630,

http://people.kth.se/~dimos/ACC10Complexity.pdf,

https://academic.microsoft.com/#/detail/2059230517