<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Dimarogonas_et_al_2014a</id>
		<title>Dimarogonas et al 2014a - Revision history</title>
		<link rel="self" type="application/atom+xml" href="https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Dimarogonas_et_al_2014a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Dimarogonas_et_al_2014a&amp;action=history"/>
		<updated>2026-05-06T23:02:17Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Dimarogonas_et_al_2014a&amp;diff=209042&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 794020249 to Dimarogonas et al 2014a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Dimarogonas_et_al_2014a&amp;diff=209042&amp;oldid=prev"/>
				<updated>2021-02-03T20:42:39Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_794020249&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 794020249&quot;&gt;Draft Content 794020249&lt;/a&gt; to &lt;a href=&quot;/public/Dimarogonas_et_al_2014a&quot; title=&quot;Dimarogonas et al 2014a&quot;&gt;Dimarogonas et al 2014a&lt;/a&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;tr style='vertical-align: top;' lang='en'&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Revision as of 20:42, 3 February 2021&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan='2' style='text-align: center;' lang='en'&gt;&lt;div class=&quot;mw-diff-empty&quot;&gt;(No difference)&lt;/div&gt;
&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Dimarogonas_et_al_2014a&amp;diff=209041&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  Motivated by next-generation air transportation systems, this paper investigates the relationship between traffic volume and congestion in a multi-agent syste...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Dimarogonas_et_al_2014a&amp;diff=209041&amp;oldid=prev"/>
				<updated>2021-02-03T20:42:35Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  Motivated by next-generation air transportation systems, this paper investigates the relationship between traffic volume and congestion in a multi-agent syste...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&lt;br /&gt;
== Abstract ==&lt;br /&gt;
&lt;br /&gt;
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.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Original document ==&lt;br /&gt;
&lt;br /&gt;
The different versions of the original document can be found in:&lt;br /&gt;
&lt;br /&gt;
* [https://dspace.mit.edu/bitstream/1721.1/65572/2/Frazzoli-2010-On%20the%20transfer%20time%20complexity%20of%20cooperative%20vehicle%20routing.pdf https://dspace.mit.edu/bitstream/1721.1/65572/2/Frazzoli-2010-On%20the%20transfer%20time%20complexity%20of%20cooperative%20vehicle%20routing.pdf]&lt;br /&gt;
&lt;br /&gt;
* [http://xplorestaging.ieee.org/ielx5/5512481/5530425/05530630.pdf?arnumber=5530630 http://xplorestaging.ieee.org/ielx5/5512481/5530425/05530630.pdf?arnumber=5530630],&lt;br /&gt;
: [http://dx.doi.org/10.1109/acc.2010.5530630 http://dx.doi.org/10.1109/acc.2010.5530630]&lt;br /&gt;
&lt;br /&gt;
* [http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005530630 http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000005530630],&lt;br /&gt;
: [http://dspace.mit.edu/handle/1721.1/65572 http://dspace.mit.edu/handle/1721.1/65572],&lt;br /&gt;
: [https://people.kth.se/~dimos/ACC10Complexity.pdf https://people.kth.se/~dimos/ACC10Complexity.pdf],&lt;br /&gt;
: [https://ieeexplore.ieee.org/document/5530630 https://ieeexplore.ieee.org/document/5530630],&lt;br /&gt;
: [http://people.kth.se/~dimos/ACC10Complexity.pdf http://people.kth.se/~dimos/ACC10Complexity.pdf],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2059230517 https://academic.microsoft.com/#/detail/2059230517]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>