Research on multi-target path planning of domestic mobile robot based on ant colony algorithm

In home mobile robots, in order to realize that the mobile robot can plan the shortest path traversing each task node when receiving multiple task commands at the same time, a multi-target path planning method based on ant colony algorithm is proposed. First, the algorithm models the operating environment of the mobile robot, and uses the visualization method and Dijkstra to find the minimum distance matrix between the points of the operating environment; then, the improved ant colony algorithm is used to find the order of traversing each node; and finally Generate a shortest path. The simulation results show that this method solves the problem that the traditional ant colony algorithm cannot solve the shortest distance problem because each node is only traversed once in the Traveling Salesman Problem, so that the robot can move to each target point quickly and safely.