On The Transfer Time Complexity of Cooperative Vehicle Routing
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 as...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers / American Automatic Control Council
2011
|
| Online Access: | http://hdl.handle.net/1721.1/65572 https://orcid.org/0000-0002-0505-1400 |
| _version_ | 1826211066588168192 |
|---|---|
| author | Spieser, Kevin Dimarogonas, Dimos V. Frazzoli, Emilio |
| author2 | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics |
| author_facet | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics Spieser, Kevin Dimarogonas, Dimos V. Frazzoli, Emilio |
| author_sort | Spieser, Kevin |
| collection | MIT |
| description | 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 [square root of n]. |
| first_indexed | 2024-09-23T15:00:02Z |
| format | Article |
| id | mit-1721.1/65572 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T15:00:02Z |
| publishDate | 2011 |
| publisher | Institute of Electrical and Electronics Engineers / American Automatic Control Council |
| record_format | dspace |
| spelling | mit-1721.1/655722022-09-29T11:57:24Z On The Transfer Time Complexity of Cooperative Vehicle Routing Spieser, Kevin Dimarogonas, Dimos V. Frazzoli, Emilio Massachusetts Institute of Technology. Department of Aeronautics and Astronautics Massachusetts Institute of Technology. Laboratory for Information and Decision Systems Frazzoli, Emilio Spieser, Kevin Dimarogonas, Dimos V. Frazzoli, Emilio 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 [square root of n]. United States. National Aeronautics and Space Administration. (Grant NNX08AY52A) 2011-08-31T17:21:10Z 2011-08-31T17:21:10Z 2010-06 Article http://purl.org/eprint/type/ConferencePaper 978-1-4244-7426-4 0743-1619 INSPEC Accession Number: 11508791 ThA20.1 http://hdl.handle.net/1721.1/65572 Spieser, K., D.V. Dimarogonas, and E. Frazzoli. “On the Transfer Time Complexity of Cooperative Vehicle Routing.” American Control Conference (ACC 2010), Marriott Waterfront, Baltimore, MD, USA June 30-July 02, 2010, p.3039-3044. ©2010 AACC American Automatic Control Council. https://orcid.org/0000-0002-0505-1400 en_US http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=5530630&isnumber=5530425 American Control Conference (ACC) 2010 Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. application/pdf Institute of Electrical and Electronics Engineers / American Automatic Control Council IEEE |
| spellingShingle | Spieser, Kevin Dimarogonas, Dimos V. Frazzoli, Emilio On The Transfer Time Complexity of Cooperative Vehicle Routing |
| title | On The Transfer Time Complexity of Cooperative Vehicle Routing |
| title_full | On The Transfer Time Complexity of Cooperative Vehicle Routing |
| title_fullStr | On The Transfer Time Complexity of Cooperative Vehicle Routing |
| title_full_unstemmed | On The Transfer Time Complexity of Cooperative Vehicle Routing |
| title_short | On The Transfer Time Complexity of Cooperative Vehicle Routing |
| title_sort | on the transfer time complexity of cooperative vehicle routing |
| url | http://hdl.handle.net/1721.1/65572 https://orcid.org/0000-0002-0505-1400 |
| work_keys_str_mv | AT spieserkevin onthetransfertimecomplexityofcooperativevehiclerouting AT dimarogonasdimosv onthetransfertimecomplexityofcooperativevehiclerouting AT frazzoliemilio onthetransfertimecomplexityofcooperativevehiclerouting |