Research On Mobile Robot Path Planning Algorithm

The path planning problem is an important direction in the research of mobile robots.The path planning of mobile robots is mainly to solve the problem of shortest path.The problems are generally divided into two forms: the first case is the location and size of the obstacle is given,and remain unchanged during the operation;the other case is the information of feasible area is not known or part of the feasible area is unknown,it needs to make a real-time detection.The method of studying the two cases is also different,it is necessary to find a suitable algorithm can be adapted to different situations to optimize the mobile path.At present,there are many ways to study path planning.The general idea is to convert the optimal path problem into the combination of geometric and functional problems.These methods are simple and development are more mature,but the ability of these methods are not strong enough,such as the model need to be reconstructed when the environmental space changes,and with the increase of environmental dimensions and the number of obstacles,the computational complexity will be significantly increased,the computing cycle is lengthened and the processing efficiency is greatly reduced.With the continuous development of modern computing technology,the majority of scholars also use intelligent algorithms to solve this problem,these bionic evolution method not only has a strong adaptability to adapt to the environment,and performance is relatively stable.The main contents of this paper are divided into two parts: the path planning method of single target point and multi-target point.In the path planning of single target point.Firstly,this paper uses the dynamic programming based on grid method to plan the optimal path of the mobile robot.Then the paper research the path planning based on neural network algorithm to improve the shortcomings of the traditional methods;in multi-target point path planning of the mobile robot,at first the environment is modeled by viewable method,then use the improved Dijkstra algorithm to solve the minimum path between points,and finally the paper use two methods to solve the optimal route and analyze the two methods.