Application of angle related cost function optimization for dynamic path planning algorithm
Summary: 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.
- Dynamic path planning of mobile robot based on improved simulated annealing algorithm
- Decremental algorithm for adaptive routing incorporating traveler information
- Application improvement of \(\mathrm{A}^*\) algorithm in intelligent vehicle trajectory planning
- A new intelligence algorithm for determination of shortest path for dynamic guidance of vehicles based on service level criterion
- Adaptive granular planning for robust plan generation under uncertain traffic conditions
This page was built for publication: Application of angle related cost function optimization for dynamic path planning algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2331659)