Application of Angle Related Cost Function Optimization for Dynamic Path Planning Algorithm

Abstract

Abstract:In recent years, Intelligent Transportation Systems (ITS) have developed a lot. More and more sensors and communication technologies (e.g., cloud computing) are being integrated into cars, which opens up a new design space for vehicular-based applications. In this paper, we present the Spatial Optimized Dynamic Path Planning algorithm. Our contributions are, firstly, to enhance the effective of loading mechanism for road maps by dividing the connected sub-net, and building a spatial index; and secondly, to enhance the effect of the dynamic path planning by optimizing the search direction. We use the real road network and real-time traffic flow data of Karamay city to simulate the effect of our algorithm. Experiments show that our Spatial Optimized Dynamic Path Planning algorithm can significantly reduce the time complexity, and is better suited for use as a real-time navigation system. The algorithm can achieve superior real-time performance and obtain the optimal solution in dynamic path planning.

Constructing an Environmental Friendly Low-Carbon-Emission Intelligent Transportation System Based on Big Data and Machine Learning Methods

“…In this paper, we chose to apply an optimized dynamic path planning algorithm based on the A* search algorithm to take care of the path planning jobs, which is a contribution from our previous research. The performance and other details of the algorithm are demonstrated in [42].…”

“…By virtue of the contributions of Mingbin Zeng and Xu Yang in [42], this paper is not intended for further discussion of the above two approaches. As a result, the following is used to calculate the heuristic estimated cost h(n): h…”

Dynamic Path Planning Based on Service Level of Road Network

“…In RPP, the actual driving route of the vehicle is formed by splicing local optimal paths planned in multiple stages, but the superposition of multiple local optima does not necessarily equal the global optimal. Zeng et al [16] presented a spatial optimized dynamic path planning algorithm, enhancing the effect of the dynamic path planning by optimizing the search direction, and finally obtained the optimal solution in dynamic path planning, proving its feasibility and accuracy through experiments. Guo et al [17] proposed a global path planning approach with time division-based hierarchical topology maps to achieve a legal optimal path with the consideration of complicated topology maps caused by the dynamic traffic rules in local intersections and lanes.…”