By Topic

Pattern generation in cellular robotic systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jing Wang ; Center for Robotic Syst., California Univ., Santa Barbara, CA, USA ; Beni, G.

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

Published in:

Intelligent Control, 1988. Proceedings., IEEE International Symposium on

Date of Conference:

24-26 Aug 1988