Application research of landmarks in path planning algorithms of mobile robots

Abstract

A way of incorporating landmark information matrix QR to affect the global path planning algorithm is proposed for the use of landmarks in robot localization and navigation. It is also investigated how this method affects the pace at which the original algorithm solves problems. The reward and punishment items in this technique include dangerous locations with lots of obstacles around them, landmarks with location information connected to the ground, and the two combined. Three representative common robot path planning algorithms are also imposed as influences. Through MATLAB simulation experiment, find the optimal path planning algorithm that is appropriate for applying reward and punishment by comparing the quality of the robot's driving path and the algorithm solution speed before and after the reward and punishment. According to the simulation results, the reward and punishment approach is practical and efficient. The heuristic search algorithm is better suited for reward and punishment, and both its path quality and speed of solution have greatly increased.