Author(s)

Jiale Wang, Jiawei Ye, Zhengying Yang

Corresponding Author

Jiale Wang

ABSTRACT

The problem of urban traffic optimal path planning is studied in this paper. As the urban traffic network is complex, which increases the difficulty of planning, the traditional optimal path planning algorithm does not take into account the traffic restrictions in the urban road network, but also ignores the time of vehicle turning delay at road intersections, which does not accord with the actual situation of urban traffic. In order to solve the above problems, this paper first establishes a traffic model of urban road network. Then the linear programming model of the optimal path planning problem is established by using the linear programming method. Finally, the bucket sorting algorithm is used to optimize the Dijestra algorithm, and a new optimal path planning algorithm is obtained to solve the linear programming model. The simulation results show that the optimal path searched by the algorithm is more in line with the actual road network, which provides a theoretical basis for the design.

KEYWORDS

Optimal path planning, road network traffic model, linear programming, Dijstra algorithm, bucket sorting algorithm