Robot Networks with Homonyms: The Case of Patterns Formation-Reference-Cited by-同舟云学术

Robot Networks with Homonyms: The Case of Patterns Formation

Published:2011 Issue: Volume: Page:92-107
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bouzid Zohir,Lamani Anissa

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-24550-3_9

Reference11 articles.

1. Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for autonomous mobile robots. SODA 11(14), 1070–1078 (2004)

2. Lecture Notes in Computer Science;L. Anderegg,2005

3. Bouzid, Z., Lamani, A.: Robot networks with homonyms: The case of patterns formation. hal.inria.fr (2011)

4. Chandrasekaran, R., Tamir, A.: Algebraic optimization: the fermat-weber location problem. Mathematical Programming 46(1), 219–224 (1990)

5. Das, S., Flocchini, P., Santoro, N., Yamashita, M.: On the computational power of oblivious robots: forming a series of geometric patterns. In: PODC, pp. 267–276. ACM, New York (2010)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Pattern Formation;Distributed Computing by Mobile Entities;2019

2. Brief Announcement;Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing;2016-07-25

3. Probabilistic Asynchronous Arbitrary Pattern Formation (Short Paper);Lecture Notes in Computer Science;2016

4. Forming sequences of geometric patterns with oblivious mobile robots;Distributed Computing;2014-06-03

5. Gathering of Mobile Robots Tolerating Multiple Crash Faults;2013 IEEE 33rd International Conference on Distributed Computing Systems;2013-07