Description: Based on the ant colony algorithm, the path of the robot with the obstacle is modeled by the method of grid discretization, and the environment is stored by the adjacency matrix, so that the problem is transformed into the ant colony algorithm to find the shortest path.
To Search:
File list (Check if you may need any files):
Ant Colony Algorithm.docx
Download