蚂蚁算法及程序（Ant algorithm and program）.docVIP

蚂蚁算法及程序（Ant algorithm and program） ant algorithm Open categories: algorithms, scientific knowledge Ant colony algorithm (ant colony optimization, ACO), also called ant algorithm, is a probabilistic technique used to find optimal paths in graphs. It was introduced in his doctoral thesis by Marco Dorigo in 1992, inspired by the discovery of paths by ants in the search for food. Why can a small ant find food? Do they have intelligence? Imagine how complicated the program would be if we were to design an artificial intelligence program for the ants First of all, you have to let the ants can avoid obstacles, it must be based on appropriate terrain to give it into instruction so that they can avoid obstacles, clever second, let the ants find food, you need to make all their points traverse space on; again, if you want the ants to find the shortest path, then you need to calculate all possible paths and compare their size, but more importantly, you should be careful programming, because the program error might let you down. What an incredible procedure it is! Its too complicated. Im afraid no one has ever been able to complete such tedious, redundant programs. However, the facts are not as complicated as you think. The program above each ants core program encodes just more than 100 lines! Why do such simple procedures make ants do such complicated things? The answer is: the emergence of simple rules. In fact, each ant is not like we need to imagine that the world of information, they only care about a small range in front of the information, and according to the local information using a few simple rules for decision-making, so, in the collective behavior of ant colony, the complex will come out. This is the law of artificial life and the interpretation of complex science! So, what are these simple rules? Details are described below: 1, scope: The range of ants is observed in a grid world, ants have a parameter for the speed radius (3), the scope of it can be observed that