{"title":"蜂窝式机器人系统中的模式生成","authors":"J. Wang, Gerardo Beni","doi":"10.1109/ISIC.1988.65406","DOIUrl":null,"url":null,"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.<<ETX>>","PeriodicalId":155616,"journal":{"name":"Proceedings IEEE International Symposium on Intelligent Control 1988","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"37","resultStr":"{\"title\":\"Pattern generation in cellular robotic systems\",\"authors\":\"J. Wang, Gerardo Beni\",\"doi\":\"10.1109/ISIC.1988.65406\",\"DOIUrl\":null,\"url\":null,\"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.<<ETX>>\",\"PeriodicalId\":155616,\"journal\":{\"name\":\"Proceedings IEEE International Symposium on Intelligent Control 1988\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-08-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"37\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE International Symposium on Intelligent Control 1988\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIC.1988.65406\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE International Symposium on Intelligent Control 1988","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIC.1988.65406","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
