With the advancement of modern IT technologies, the operation of autonomous vehicles is becoming a reality, and route planningis essential for this. Generally, route planning involves proposing the shortest path to minimize travel distance and the qui...
With the advancement of modern IT technologies, the operation of autonomous vehicles is becoming a reality, and route planningis essential for this. Generally, route planning involves proposing the shortest path to minimize travel distance and the quickest pathto minimize travel time. However, the quality of these routes depends on the topological characteristics of the road network graph. Ifthe connectivity structure of the road network is not rational, there are limits to the performance improvement that routing algorithmscan achieve. Real drivers consider psychological factors such as the number of turns, surrounding environment, traffic congestion, androad quality when choosing routes, and they particularly prefer routes with fewer turns. This paper introduces a simple path algorithmthat seeks routes with the fewest turns, in addition to the traditional shortest distance and quickest time routes, to evaluate thecharacteristics of road networks. Using this simple path algorithm, we compare and evaluate the connectivity characteristics of roadnetworks in 20 major cities worldwide. By analyzing these road network characteristics, we can identify the strengths and weaknessesof urban road networks and develop more efficient and safer route planning algorithms. This paper comprehensively examines the qualityof road networks and the efficiency of route planning by analyzing and comparing the road network characteristics of each city usingthe proposed simple path algorithm.