A dynamic path planning algorithm for multi-core navigation device

The traditional navigation system is based on static data to plan the shortest path, which does not refer to real-time traffic information. And with the development of transportation technology, real-time traffic information can be got easily. So a dynamic path planning algorithm based on the real-time traffic information is practicable to provide more accurate solutions for actual navigation systems. But such an algorithm requires more computation cost. On the other hand, multi-core technology improves the computing power of navigation devices largely. In this paper, we proposed an asynchronous parallel dynamic path planning algorithm based on multi-core navigation devices, called APWD* (Asynchronous Parallel Weight D* Lite algorithm), which could balance the quality of result and execution time under complex and changing environment.