https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Houissa_et_al_2018aHouissa et al 2018a - Revision history2026-05-06T22:01:25ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10https://www.scipedia.com/wd/index.php?title=Houissa_et_al_2018a&diff=206202&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 412984413 to Houissa et al 2018a2021-02-03T17:16:29Z<p>Scipediacontent moved page <a href="/public/Draft_Content_412984413" class="mw-redirect" title="Draft Content 412984413">Draft Content 412984413</a> to <a href="/public/Houissa_et_al_2018a" title="Houissa et al 2018a">Houissa et al 2018a</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 17:16, 3 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=Houissa_et_al_2018a&diff=206201&oldid=prevScipediacontent: Created page with " == Abstract == Urban Parking is a problem that costs time and energy. That is why intelligent parking is a field of research that is growing very quickly. In a city where no..."2021-02-03T17:16:25Z<p>Created page with " == Abstract == Urban Parking is a problem that costs time and energy. That is why intelligent parking is a field of research that is growing very quickly. In a city where no..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
Urban Parking is a problem that costs time and energy. That is why intelligent parking is a field of research that is growing very quickly. In a city where no sensor infrastructure within each place is deployed but only a counting system at every intersection is available, we show that it still possible to propose an efficient method that determines an itinerary that minimizes the expected time to find an available parking place. For this, we first model the urban area by a graph. Then, we implement an algorithm constructing step by step the itinerary. At each step, we choose the next segment by an evaluation of the future expectation time within this segment. We evaluate the performance of the algorithm by realistic simulations. The simulation data are extracted from the map of Versailles.<br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [https://zenodo.org/record/1440942 https://zenodo.org/record/1440942] under the license http://creativecommons.org/licenses/by-nc-nd/4.0/legalcode<br />
<br />
* [http://dx.doi.org/10.5281/zenodo.1440942 http://dx.doi.org/10.5281/zenodo.1440942],<br />
: [https://zenodo.org/record/1440942 https://zenodo.org/record/1440942] under the license http://creativecommons.org/licenses/by-nc-nd/4.0/legalcode<br />
<br />
* [https://zenodo.org/record/1440942 https://zenodo.org/record/1440942],<br />
: [http://dx.doi.org/10.5281/zenodo.1440941 http://dx.doi.org/10.5281/zenodo.1440941] under the license http://creativecommons.org/licenses/by-nc-nd/4.0/legalcode<br />
<br />
<br />
<br />
DOIS: 10.5281/zenodo.1440942 10.5281/zenodo.1440941</div>Scipediacontent