Ant robotics is a special case of swarm robotics. Swarm robots are simple (and hopefully, therefore cheap) robots with limited sensing and computational capabilities. This makes it feasible to deploy teams of swarm robots and take advantage of the resulting fault tolerance and parallelism. Swarm robots cannot use conventional planning methods due to their limited sensing and computational capabilities. Thus, their behavior is often driven by local interactions. Ant robots are swarm robots that can communicate via markings, similar to ants that lay and follow pheromone trails. Some ant robots use long-lasting trails, (either regular trails of a chemical substance, or smart trails of transceivers.) Others use short-lasting trails including heat, odor, alcohol, and/or light. Others even use virtual trails.
In 1991, American electrical engineer James McLurkin was the first to conceptualize the idea of "robot ants" while working at the MIT Computer Science and Artificial Intelligence Laboratory at the Massachusetts Institute of Technology. The robots consisted of sensors, infrared emitters, and communication systems capable of detecting objects in their path. McLurkin's invention was through studying the behavior of real ants in ant colonies and keeping ant farms as a basis for his programming. Through this examination, he could better understand how insects structured their workloads in order to produce a viable and working prototype of robotic ants.
Researchers have developed ant robot hardware and software and demonstrated, both in simulation and on physical robots, that single ant robots or teams of ant robots solve robot-navigation tasks (such as path following and terrain coverage) robustly and efficiently. For example, trails coordinate the ant robots via implicit communication and provide an alternative to probabilistic reasoning for solving the simultaneous localization and mapping problem.
Researchers have also developed a theoretical foundation for ant robotics, based on ideas from real-time heuristic search, stochastic analysis and graph theory. Recently, it was shown that a single ant robot (modeled as finite state machine) can simulate the execution of any arbitrary Turing machine. This proved that a single ant robot, using pheromones, can execute arbitrarily complex single-robot algorithms. However, the result unfortunately does not hold for N robots.
- J. Svennebring and S. Koenig. Building terrain-covering ant robots. Autonomous Robots, 16, (3), 313-332, 2004.
- M. Batalin and G. Sukhatme. Efficient exploration without localization. Proceedings of the International Conference on Robotics and Automation, 2714-2719, 2003.
- R. Russell. Heat trails as short-lived navigational markers for mobile robots. Proceedings of the International Conference on Robotics and Automation, 3534-3539, 1997.
- R. Russell. Odour detection by mobile robots. World Scientific Publishing. 1999.
- R. Sharpe and B. Webb. Simulated and situated models of chemical trail following in ants. Proceedings of the International Conference on Simulation of Adaptive Behavior, 195-204, 1998.
- B. Ranjbar-Sahraei, S. Alers, K. Tuyls, G. Weiss. StiCo in Action. Proceedings of the 12th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), 1403-1404, 2013
- . Vaughan, K. Stoy, G. Sukhatme, and M. Mataric. LOST: Localization-space trails for robot teams. IEEE Transactions on Robotics and Automation, 18(5):796-812, 2002.
- "James McLurkin". Massachusetts Institute of Technology.
- I. Wagner and A. Bruckstein, Special Issue on Ant Robotics, Annals of Mathematics and Artificial Intelligence, 31(1-4), 2001.
- Shiloni, A., Agmon, N. and Kaminka, G. A. Of Robot Ants and Elephants. In Proceedings of the Eighth International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS-09), 2009.
- Shiloni, A., Agmon, N. and Kaminka, G. A. Of Robot Ants and Elephants: A Computational Comparison. In Theoretical Computer Science, 412, 5771-5788, 2011.
The text of this article was adopted from the Tutorial on Ant Robotics in compliance with their Creative Commons Attribution-Sharealike Unported License and the GNU Free Documentation License.