Pattern generation in cellular robotic systems
- 6 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A computational model of cellular robotic systems (CRSs) is introduced. It employs a large (but finite) number of autonomous robots operating on a cellular space under distributed control. No synchronous clock or shared memory is assumed. Robots in such systems have to cooperate to accomplish prespecified global tasks under the government of a protocol. The problem of robots in a CRS spatially rearranging themselves to form desired patterns within the field of operation is discussed. Example protocols that generate alternating and arbitrarily predefined patterns in one-dimensional linear arrangements and protocols that make robots seal one side or all sides of two-dimensional grids are presented. Mathematical proofs of the correctness of these protocols have been obtained. A Sun-Unix based simulation platform has been implemented upon which the pattern forming protocols are exercised.Keywords
This publication has 7 references indexed in Scilit:
- Connectivity analysis of multi-dimensional multi-valued imagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- The concept of cellular robotic systemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The mutual exclusion problemJournal of the ACM, 1986
- The mutual exclusion problemJournal of the ACM, 1986
- Universality and complexity in cellular automataPhysica D: Nonlinear Phenomena, 1984
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978
- Real-time language recognition by one-dimensional cellular automataJournal of Computer and System Sciences, 1972