Anytime route planning with constrained devices

详细信息    查看全文

• 作者：Marcus de L. Braga ; ^a ; ^c ; ^{marcus@gta.ufrj.br" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Alyson de J. dos Santos^a ; ^c ; ^{alyson@gta.ufrj.br" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Aloysio C.P. Pedroza^a ; ^{aloysio@gta.ufrj.br" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Luí ; s Henrique M.K. Costa^a ; ^{luish@gta.ufrj.br" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Marcelo Dias de Amorim^b ; ^{marcelo.amorim@lip6.fr" class="auth_mail" title="E-mail the corresponding author}Author Vitae ; Yacine Ghamri-Doudane^c ; ^{yacine.ghamri@univ-lr.fr" class="auth_mail" title="E-mail the corresponding author}Author Vitae
• 关键词：Route planning ; ARA* ; Vehicular networks ; Anytime algorithms
• 刊名：Computers & Electrical Engineering
• 出版年：2016
• 出版时间：August 2016
• 年：2016
• 卷：54
• 期：Complete
• 页码：53-67
• 全文大小：3066 K

文摘

Urban mobility became a major challenge around the world, with frequent congestion and ever growing travel time. Albeit recent advances in the area of Intelligent Transportation Systems (ITS), it is still difficult to predict and manage the road infrastructure due to dynamics and instability of the traffic. One key issue is how, given some traffic monitoring information, a vehicle decides to dynamically change its route. In this paper, we analyze algorithms of the anytime class to make the route planning considering GPS traces of buses in Rio de Janeiro, as a measurement of traffic flows. Anytime algorithms inform, in a timely fashion, a sub-optimal response and progressively improves it as time goes by. We evaluate time and memory consumption, route length, arrival time, average velocity, distance traveled, and pathways on an experimental platform composed of Raspberry Pi nodes. For different time windows, the results show that ARA* allows finding alternative routes that, if used, help reduce traffic congestion.