Abstract

The optimal path planning is one of the hot spots in the research of intelligence transportation and geographic information systems. There are many productions and applications in path planning and navigation, however due to the complexity of urban road networks, the difficulty of the traffic prediction increases. The optimal path means not only the shortest distance in geography, but also the shortest time, the lowest cost, the maximum road capacity, etc. In fast-paced modern cities, people tend to reach the destination with the shortest time. The corresponding paths are considered as the optimal paths. However, due to the high data sensing speed of GPS devices, it is different to collect or describe real traffic flows. To address this problem, we propose an innovative path planning method in this paper. Specially, we first introduce a crossroad link analysis algorithm to calculate the real-time traffic conditions of crossroads (i.e. the $CrossRank$ values). Then, we adopt a $CrossRank$ value based $A$ - $Star$ for the path planning by considering the real-time traffic conditions. To avoid the high volume update of $CrossRank$ values, a $R$ - $Tree$ structure is proposed to dynamically update local $CrossRank$ values from the multi-level subareas. In the optimization process, to achieve desired navigation results, we establish the traffic congestion coefficient to reflect different traffic congestion conditions. To verify the effectiveness of the proposed method, we use the actual traffic data of Beijing. The experimental results show that our method is able to generate the appropriate path plan in the peak and low dynamic traffic conditions as compared to online applications.

Highlights

  • In the modern transportation system, the main traffic problems faced by cities are frequent traffic accidents, traffic environment deterioration, traffic congestion and so on

  • 1) Initially, this paper introduced a continuously real-time mathematical function, for each GPS data provider, our proposed function generates its corresponding vectors according to its sampling data, which describes the current road condition according to the number of vector of real-time road condition, in other words, we consider amount of speed or volume, and their updating frequencies in traffic state representation

  • EVALUATION METHOD AND EXPERIMENTAL SETTINGS 1) EVALUATION METHOD Due to the following three main reasons, our experimental evaluation method in this paper is not verified against the existing path planning methods or algorithms in relevant research articles: 1) Inconsistent dataset, the experiment uses Beijing road network data and Beijing vehicle trajectory data, while different evaluation dataset have different properties, restrictions, i.e. sampling frequencies

Read more

Summary

A Novel Vector-Based Dynamic Path Planning Method in Urban Road Network

College of Computer Science, Beijing University of Technology, Beijing 100124, China.

INTRODUCTION
RELATED WORK
THE LINK ANALYSIS ALGORITHM
ALGORITHM DESIGN
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call