https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Cherfaoui_Guyard_2019aCherfaoui Guyard 2019a - Revision history2026-04-22T03:36:56ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10https://www.scipedia.com/wd/index.php?title=Cherfaoui_Guyard_2019a&diff=196978&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 765018142 to Cherfaoui Guyard 2019a2021-02-01T19:07:53Z<p>Scipediacontent moved page <a href="/public/Draft_Content_765018142" class="mw-redirect" title="Draft Content 765018142">Draft Content 765018142</a> to <a href="/public/Cherfaoui_Guyard_2019a" title="Cherfaoui Guyard 2019a">Cherfaoui Guyard 2019a</a></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<tr style='vertical-align: top;' lang='en'>
<td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 19:07, 1 February 2021</td>
</tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Scipediacontenthttps://www.scipedia.com/wd/index.php?title=Cherfaoui_Guyard_2019a&diff=196977&oldid=prevScipediacontent: Created page with " == Abstract == International audience; In this article, we propose a distributed fusion algorithm to detect traffic congestion through the exchange of messages in vehicle ne..."2021-02-01T19:07:49Z<p>Created page with " == Abstract == International audience; In this article, we propose a distributed fusion algorithm to detect traffic congestion through the exchange of messages in vehicle ne..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
International audience; In this article, we propose a distributed fusion algorithm to detect traffic congestion through the exchange of messages in vehicle network. This algorithm is based on the Dempster-Shafer theory that manages the uncertainties on data and sources of information. Each vehicle updates its database with local measurements (speed and interdistance) and information received from other vehicles and can calculate its route. Thanks to the collaboration, smart cars can avoid congested roads and take a better path to their destination. Several variants of the algorithm are studied and compared to a centralized approach through experiments carried out on the SUMO simulator using real urban road networks.<br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [https://hal.archives-ouvertes.fr/hal-02446142/file/papierITSC.pdf https://hal.archives-ouvertes.fr/hal-02446142/file/papierITSC.pdf]<br />
<br />
* [http://xplorestaging.ieee.org/ielx7/8907344/8916833/08917443.pdf?arnumber=8917443 http://xplorestaging.ieee.org/ielx7/8907344/8916833/08917443.pdf?arnumber=8917443],<br />
: [http://dx.doi.org/10.1109/itsc.2019.8917443 http://dx.doi.org/10.1109/itsc.2019.8917443]<br />
<br />
* [https://dblp.uni-trier.de/db/conf/itsc/itsc2019.html#GuyardC19 https://dblp.uni-trier.de/db/conf/itsc/itsc2019.html#GuyardC19],<br />
: [https://academic.microsoft.com/#/detail/2990021108 https://academic.microsoft.com/#/detail/2990021108]<br />
<br />
* [https://hal.archives-ouvertes.fr/hal-02446142 https://hal.archives-ouvertes.fr/hal-02446142],<br />
: [https://hal.archives-ouvertes.fr/hal-02446142/document https://hal.archives-ouvertes.fr/hal-02446142/document],<br />
: [https://hal.archives-ouvertes.fr/hal-02446142/file/papierITSC.pdf https://hal.archives-ouvertes.fr/hal-02446142/file/papierITSC.pdf]</div>Scipediacontent