Cellular ANTomata

摘要

Cellular automata can form the basis of a practical model for a broad range of tasks that require the coordination of many simple computing devices. We propose using semi-synchronous cellular automata as a platform for efficiently realizing ant-inspired algorithms that coordinate robots within a fixed, geographically constrained environment. We present an appropriate formalization of the resulting Cellular ANTomaton model, illustrated via proof-of-concept problems that have ant-robots move and aggregate in various ways.