Of robot ants and elephants: A computational comparison

Asaf Shiloni, Noa Agmon, Gal A. Kaminka

Research output: Contribution to journalReview articlepeer-review

2 Scopus citations

Abstract

In the robotics community, there exist implicit assumptions concerning the computational capabilities of robots. Two computational classes of robots emerge as focal points of recent research: robot ants and robot elephants. Ants have poor memory and communication capabilities, but are able to communicate using pheromones, in effect, turning their work area into a shared memory. By comparison, elephants are computationally stronger, have large memory, and are equipped with strong sensing and communication capabilities. Unfortunately, not much is known about the relation between the capabilities of these models in terms of the tasks they can address. In this paper, we present formal models of both ants and elephants, and investigate if one dominates the other. We present two algorithms: AntEater, which allows elephant robots to execute ant algorithms and ElephantGun, which converts elephant algorithmsspecified as Turing machinesinto ant algorithms. By exploring the computational capabilities of these algorithms, we reach interesting conclusions regarding the computational power of both models.

Original languageEnglish
Pages (from-to)5771-5788
Number of pages18
JournalTheoretical Computer Science
Volume412
Issue number41
DOIs
StatePublished - 23 Sep 2011

Fingerprint

Dive into the research topics of 'Of robot ants and elephants: A computational comparison'. Together they form a unique fingerprint.

Cite this