Path planning method of moving robot under dynamic and complicated environment

Abstract

The invention provides a global path planning method of a moving robot under a dynamic and complicated environment. The method includes the steps of building a global environment map according to an actual environment, building a dynamic barrier environment, obtaining a grid map by means of a grid method, converting a barrier distribution map obtained in the grid method into an empowered adjacent matrix of the map, carrying out global path planning on the environment by means of an ant colony algorithm, processing trap problems in the environment in a regressing method, judging whether a current position of a path is a target point, repeating the preceding steps if the answer is negative, and ending if the current position is the designated target point. The method is simple and easy to achieve, and the path planning effect is good.

Description

technical field [0001] The invention relates to a path planning method, in particular to a global path planning method for a mobile robot under the complex situation where dynamic obstacles and static obstacles coexist. Background technique [0002] As the application of robots becomes more and more extensive, people's requirements for robots continue to increase. As an important branch of robot applications, mobile robots are gradually showing their importance in production and life. The prerequisite for a robot to complete a certain task is to reach the task area, so the problem of robot path planning is the most basic and also the most important problem in robot research. [0003] At present, there are many methods to solve path planning, among which artificial potential field method and Dijkstra method are commonly used. The artificial potential field method has been widely used in real-time obstacle avoidance and smooth trajectory control because of its simple structur...

AI Technical Summary

Problems solved by technology

Dijkstra algorithm can get the optimal solution of the shortest path, but its disadvantage is that there are many nodes for traversal calculation, resulting in low operating efficiency

[0004] At the same time, most of the path planning methods are only for the structural map containing static obstacles, and there are not many studies on the complex environment including static obstacles and dynamic obstacles in the global environment, especially for the In the case of falling into the trap of an endless loop, the research is even more insufficient

Images