A Novel Ant Clustering Algorithm Based on Cellular Automata
IAT '04 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Theory of Self-Reproducing Automata
Theory of Self-Reproducing Automata
Small Robots Team Up to Tackle Large Tasks
IEEE Distributed Systems Online
Real-time computation by n-dimensional iterative arrays of finite-state machines
SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Modeling and Controlling Parallel Tasks in Droplet-Based Microfluidic Systems
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
| Hi-index | 0.00 |
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.