다양한 경로 모형을 이용한 도시 도로망의 특성 분석
Characteristic Analysis on Urban Road Networks Using Various Path Models
1
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
최신 IT 기술의 발달로 자율주행 자동차의 운행이 현실화되고 있으며, 이를 위해 경로 탐색은 필수적이다. 일반적으로 경로 탐색에서는 이동거리를 최소화하는 최단거리 경로와 이동 시간을 최소화하는 최단시간 경로가 제시된다. 그러나 이러한 경로의 품질은 도로망의 그래프 위상적특성에 따라 달라진다. 도로망의 연결구조가 합리적이지 않으면 라우팅 알고리즘의 성능 개선에 한계가 있다. 실제 운전자들은 회전 횟수, 주변환경, 교통체증, 도로 품질 등의 심리적 요소를 고려하며, 특히 회전이 적은 경로를 선호한다. 본 논문에서는 도로망 특성을 평가할 때 최단거리와최단시간 경로뿐 아니라 회전이 가장 적은 경로를 찾는 단순 경로 알고리즘을 제시한다. 이를 통해 국내외 20개 주요 대도시 도로망의 연결 특성을비교 평가하고, 도로망의 강점과 약점을 파악하여 효율적이고 안전한 경로 탐색 알고리즘을 개발할 수 있다. 제안된 단순 경로 알고리즘을 활용하여각 도시의 도로망 특성을 비교 평가함으로써 도로망의 품질과 경로 탐색의 효율성을 종합적으로 검토한다.
Abstract
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.
참고문헌 (12)
- R. G. Golledge, "Path selection and route preference in human navigation: A progress report", International Conference on Spatial Information Theory (1995), Springer Berlin Heidelberg
- Y. Zhou, "A fewestturn-and-shortest path algorithm based on breadth-first search", Geo-spatial Information Science, 17(4), pp.201~207 (2014)
- B. Jiang, "Computing the fewest-turn map directions based on the connectivity of natural roads", International Journal of Geographical Information Science, 25(7), pp.1069~1082 (2011)
- M. Denis, "Spatial discourse and navigation : An analysis of route directions in the city of Venice", Applied Cognitive Psychology: The Official Journal of the Society for Applied Research in Memory and Cognition, 13(2), pp.145~174 (1999)
- D. Das, "Road network analysis of Guwahati city using GIS", SN Applied Sciences, 1, pp.1~11 (2019)
- P. E. Hart, "A formal basis for the heuristic determination of minimum cost paths", IEEE transactions on Systems Science and Cybernetics, 4(2), pp.100~107 (1968)
- B. Geum, "Time-Distance Balanced Path Finding Algorithms in Urban Road Networks", Proceedings of the Korea Information Science Society Conference, pp.244~246 (2023)
- D. Eppstein, "Finding the k shortest paths", SIAM Journal on Computing, 28(2), pp.652~673 (1998)
- G. Boeing, "OSMnx : New methods for acquiring, constructing, analyzing, and visualizing complex street networks", Computers, Environment And Urban Systems, 65, pp.126~139 (2017)
- G. Boeing, "OSMnx: A Python package to work with graph-theoretic OpenStreetMap street networks", Journal of Open Source Software, 2(12) (2017)
- N. Basu, "A systematic review of the fac"tors associated with pedestrian route choice", Transport Reviews, 42(5), pp.672~694 (2022)
- A. Sevtsuk, "A big data approach to understanding pedestrian route choice preferences : Evidence from San Francisco", Travel Behaviour and Society, 25, pp.41~51 (2021)