<?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=Altche_Fortelle_2016a</id>
		<title>Altche Fortelle 2016a - 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=Altche_Fortelle_2016a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Altche_Fortelle_2016a&amp;action=history"/>
		<updated>2026-05-05T08:27:52Z</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=Altche_Fortelle_2016a&amp;diff=207963&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 517022547 to Altche Fortelle 2016a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Altche_Fortelle_2016a&amp;diff=207963&amp;oldid=prev"/>
				<updated>2021-02-03T19:23:47Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_517022547&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 517022547&quot;&gt;Draft Content 517022547&lt;/a&gt; to &lt;a href=&quot;/public/Altche_Fortelle_2016a&quot; title=&quot;Altche Fortelle 2016a&quot;&gt;Altche Fortelle 2016a&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 19:23, 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=Altche_Fortelle_2016a&amp;diff=207962&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  International audience; The deployment of Cooperative Intelligent Transportation Systems (C-ITS) raises the question of future traffic management systems, whi...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Altche_Fortelle_2016a&amp;diff=207962&amp;oldid=prev"/>
				<updated>2021-02-03T19:23:44Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  International audience; The deployment of Cooperative Intelligent Transportation Systems (C-ITS) raises the question of future traffic management systems, whi...&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;
International audience; The deployment of Cooperative Intelligent Transportation Systems (C-ITS) raises the question of future traffic management systems, which will be operating with an increasing amount of information and control over the infrastructure and the vehicles. This topic of research shares some similarities with robot coordination problems, inspiring our research on autonomous intersection management. In this article, we use a mixed-integer linear programming formulation for time-optimal robots coordination along specified paths and apply it to intersection management for autonomous vehicles. Our formulation allows to simultaneously solve a discrete optimal vehicle ordering problem, and a (discretized) continuous optimal velocity planning problem taking into account kinodynamics constraints. This allows faster pruning of the decision tree for the discrete problem, thus reducing computation time. A possible application for ITS is to evaluate the efficiency loss from a given vehicle ordering policy, or dynamically adapt policies to improve their efficiency. Moreover, any intermediary solution found by the solver can be used as a heuristically good policy, with proved bounds on sub-optimality.&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://hal-mines-paristech.archives-ouvertes.fr/hal-01348275/file/MILP_IV_final.pdf https://hal-mines-paristech.archives-ouvertes.fr/hal-01348275/file/MILP_IV_final.pdf]&lt;br /&gt;
&lt;br /&gt;
* [http://xplorestaging.ieee.org/ielx7/7527552/7535353/07535369.pdf?arnumber=7535369 http://xplorestaging.ieee.org/ielx7/7527552/7535353/07535369.pdf?arnumber=7535369],&lt;br /&gt;
: [http://dx.doi.org/10.1109/ivs.2016.7535369 http://dx.doi.org/10.1109/ivs.2016.7535369]&lt;br /&gt;
&lt;br /&gt;
* [https://dblp.uni-trier.de/db/conf/ivs/ivs2016.html#AltcheF16 https://dblp.uni-trier.de/db/conf/ivs/ivs2016.html#AltcheF16],&lt;br /&gt;
: [https://hal-mines-paristech.archives-ouvertes.fr/hal-01348275 https://hal-mines-paristech.archives-ouvertes.fr/hal-01348275],&lt;br /&gt;
: [https://ieeexplore.ieee.org/document/7535369 https://ieeexplore.ieee.org/document/7535369],&lt;br /&gt;
: [https://hal-mines-paristech.archives-ouvertes.fr/hal-01348275/document https://hal-mines-paristech.archives-ouvertes.fr/hal-01348275/document],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2510875290 https://academic.microsoft.com/#/detail/2510875290]&lt;br /&gt;
&lt;br /&gt;
* [https://hal-mines-paristech.archives-ouvertes.fr/hal-01348275 https://hal-mines-paristech.archives-ouvertes.fr/hal-01348275],&lt;br /&gt;
: [https://hal-mines-paristech.archives-ouvertes.fr/hal-01348275/document https://hal-mines-paristech.archives-ouvertes.fr/hal-01348275/document],&lt;br /&gt;
: [https://hal-mines-paristech.archives-ouvertes.fr/hal-01348275/file/MILP_IV_final.pdf https://hal-mines-paristech.archives-ouvertes.fr/hal-01348275/file/MILP_IV_final.pdf]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>