The Real-time Path Planning Algorithm In A Dynamic Environment And To Achieve

Path Planning is a classic problem in the field of the robot research. Its development runs through the whole history of the robots. With the development of times, there are some new requirements about the path planning of the mobile robots. In order to better meet the needs of the actual production and living, path planning under the dynamic environments has become a focus of the path planning problem.This dissertation aims to study the efficient real-time path planning under the dynamic environment, improve the robot's ability to adapt to the dynamic environment. Make sure the robot can still be accurate wayfinding in the complex environment. Given solutions to the existence problem in the traditional path planning. Finally, combining the path planning and virtual reality digital display platform, analysis some of the current applications of game, and achieve.The study method is form general to specific, from surface to depth discussions and form basic theory to expand and extend. First, starting from a development background, describes the research results at home and abroad. Discussed the global and local path planning, giving some example. Although the Intelligent and traditional path planning. Focuses on the artificial potential field method, ant colony algorithm and particle swarm optimization, as well as A* algorithm. This dissertation has several advantages:1) Achieve the global path planning and local obstacle avoidance strategy;2) Use the vector method with A* algorithm. reduce the complexity of search;3) Combine the genetic algorithm and ant colony optimization based on back-return method;4) Proposed dynamic programming on AI with scripting;Finally, summarize the entire article and mention some future development trends about the path planning.