ACM Home Page
Please provide us with feedback. Feedback
Circle formation for oblivious anonymous mobile robots with no common sense of orientation
Full text PdfPdf (189 KB)
Source ACM Workshop On Principles Of Mobile Computing archive
Proceedings of the second ACM international workshop on Principles of mobile computing table of contents
Toulouse, France
SESSION: Dynamic Networks table of contents
Pages: 97 - 104  
Year of Publication: 2002
ISBN:1-58113-511-4
Authors
Xavier Défago  Japan Advanced Institute of Science and Technology (JAIST), Nomigun, Ishikawa, Japan
Akihiko Konagaya  Japan Advanced Institute of Science and Technology (JAIST), Nomigun, Ishikawa, Japan
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 49,   Citation Count: 10
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/584490.584509
What is a DOI?

ABSTRACT

This paper proposes a distributed algorithm by which a collection of mobile robots roaming on a plane move to form a circle. The algorithm operates under the premises that robots (1) are unable to recall past actions and observations (i.e., oblivious), (2) cannot be distinguished from each others (i.e., anonymous), (3) share no common sense of direction, and (4) are unable to communicate in any other ways than by observing each others position.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
H. Ando, Y. Oasa, I. Suzuki, and M. Yamashita. Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Trans. on Robotics and Automation, 15(5):818--828, Oct. 1999.
2
 
3
I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis. On the average and worst-case efficiency of some new distributed communication and control algorithms for ad-hoc mobile networks. In Proc. 1st ACM Int'l Workshop on Principles of Mobile Computing (POMC'01), pages 1--19, Newport, RI, USA, Aug. 2001.
4
 
5
X. Défago. Distributed computing on the move: From mobile computing to cooperative robotics and nanorobotics (a position paper). In Proc. 1st ACM Int'l Workshop on Principles of Mobile Computing (POMC'01), pages 49--55, Newport, RI, USA, Aug. 2001.
 
6
M. B. Dias and A. Stentz. A free market architecture for distributed control of a multirobot system. In Proc. 6th Int'l Conf. on Intelligent Autonomous Systems (IAS-6), pages 115--122, Venice, Italy, July 2000.
 
7
 
8
 
9
 
10
 
11
M. J. B. Krieger, J.-B. Billeter, and L. Keller. Ant-like task allocation and recruitment in cooperative robots. Nature, 406(6799):992--995, Aug. 2000.
 
12
 
13
K. Sugihara and I. Suzuki. Distributed algorithms for formation of geometric patterns with many mobile robots. Journal on Robotics Systems, 3(13):127--139, Mar. 1996.
 
14
 
15
 
16

CITED BY  10

Collaborative Colleagues:
Xavier Défago: colleagues
Akihiko Konagaya: colleagues