Ants meeting algorithms

摘要: Ant robots have very low computational power and limited memory. They communicate by leaving pheromones in the environment. In order to create a cooperative intelligent behavior, ants may need get together; however, they not know locations of other ants. Hence, we focus on an ant variant rendezvous problem, which two are be brought same location finite time. We introduce algorithms that solve this problem for simulating bidirectional search different environment settings. An algorithm with no obstacles general handles all types obstacles. provide detailed discussion attributes, size pheromone required, performance these algorithms.