TY - GEN
T1 - An Integrated Approach for a Universal Routing Algorithm
AU - Hedderich, Mareike
AU - Fastenrath, Ulrich
AU - Cao, Zhiguang
AU - Bell, Michael
AU - Bogenberger, Klaus
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/10
Y1 - 2019/10
N2 - Stress and anxiety are well known feelings for a car driver when it comes to finding a free on-street parking spot in an urban area or estimating the time for punctual arrival at a certain destination. Cars looking for a free on-street parking spot could constitute up to 50 percent of urban traffic, as studies have shown. This results in time loss for the driver, increased air pollution and congested cities. The integrated routing approach presented in this paper aims at overcoming these problems. It is called universal routing algorithm and combines a park spot routing (PSR) and a stochastic routing algorithm. The PSR uses on-street parking information, while the stochastic route utilizes historic travel time data to address punctual arrival. The universal route leads the driver through streets with high parking probabilities close to the destination while maximizing the probability of arriving on time. This paper presents a method on how to combine the two algorithms in order to provide an integrated approach to the user. Additionally, the algorithm is verified on an artificial grid.
AB - Stress and anxiety are well known feelings for a car driver when it comes to finding a free on-street parking spot in an urban area or estimating the time for punctual arrival at a certain destination. Cars looking for a free on-street parking spot could constitute up to 50 percent of urban traffic, as studies have shown. This results in time loss for the driver, increased air pollution and congested cities. The integrated routing approach presented in this paper aims at overcoming these problems. It is called universal routing algorithm and combines a park spot routing (PSR) and a stochastic routing algorithm. The PSR uses on-street parking information, while the stochastic route utilizes historic travel time data to address punctual arrival. The universal route leads the driver through streets with high parking probabilities close to the destination while maximizing the probability of arriving on time. This paper presents a method on how to combine the two algorithms in order to provide an integrated approach to the user. Additionally, the algorithm is verified on an artificial grid.
UR - http://www.scopus.com/inward/record.url?scp=85076806619&partnerID=8YFLogxK
U2 - 10.1109/ITSC.2019.8917123
DO - 10.1109/ITSC.2019.8917123
M3 - Conference contribution
AN - SCOPUS:85076806619
T3 - 2019 IEEE Intelligent Transportation Systems Conference, ITSC 2019
SP - 3088
EP - 3093
BT - 2019 IEEE Intelligent Transportation Systems Conference, ITSC 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2019 IEEE Intelligent Transportation Systems Conference, ITSC 2019
Y2 - 27 October 2019 through 30 October 2019
ER -
