Global shortest path planning for a wheeled mobile robot navigated by a sensor network in dynamic cluttered environments
Hang Li · 2016
This paper presents a non-real time global shortest path planning algorithm for a mobile robot in a dynamic environment detected by a vision-type sensor network. The objective is to calculate the shortest collision-free path from a initial position to a target in a dynamic environment with moving obstacles. The dynamic environment is detected completely by a sensor network. The shortest path has been proved by mathematical proof. Finally, computer simulations are carried out to confirm the performance of the proposed algorithm.