Abstract
We present an oblivious pattern formation algorithm for anonymous mobile robots in the asynchronous model. The robots obeying the algorithm, starting from any initial configuration I, always form a given pattern F, if I and F do not contain multiplicities and ρ(I) divides ρ(F), where ρ(·) denotes the geometric symmetricity. Our algorithm substantially outdoes an algorithm by Dieudonné et al. proposed in DISC 2010, which is dedicated to ρ(I) = 1. Our algorithm is best possible (as long as I and F do not contain multiplicities), since there is no algorithm that always forms F from I when ρ(F) is not divisible by ρ(I).
All known pattern formation algorithms are constructed from scratch. We instead use a bipartite matching algorithm (between the robots and the points in F) we proposed in OPODIS 2011 as a core subroutine, to make the description of algorithm concise and easy to understand.
This work is supported in part by MEXT/IPSJ KAKENHI 21650002, 22300004, 23700019, 24104003 and 24650008.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bandettini, A., Luporini, F., Biglietta, G.: A survey on open problems for mobile robots, arXiv:1111.2259v1 (2011)
Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Solving the Robots Gathering Problem. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1181–1196. Springer, Heidelberg (2003)
Dijkstra, E.W.: Self stabilizing systems in spite of distributed control. Commu. ACM 17, 643–644 (1974)
Dieudonné, Y., Petit, F., Villain, V.: Leader Election Problem versus Pattern Formation Problem. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 267–281. Springer, Heidelberg (2010)
Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. Theoretical Computer Science 407, 412–447 (2008)
Fujinaga, N., Ono, H., Kijima, S., Yamashita, M.: Pattern Formation through Optimum Matching by Oblivious CORDA Robots. In: Lu, C., Masuzawa, T., Mosbah, M. (eds.) OPODIS 2010. LNCS, vol. 6490, pp. 1–15. Springer, Heidelberg (2010)
Izumi, T., Soussi, S., Katayama, Y., Inuzuka, N., Défago, X., Wada, K., Yamashita, M.: The gathering problem for two oblivious robots with unreliable compasses. SIAM J. of Comput. 41(1), 26–46 (2012)
Nagamochi, H., Yamashita, M., Ibaraki, T.: Distributed algorithm for cooperative controlling of anonymous mobile robots. Technical Reports of IEICE, COMP95-24, pp. 31–40 (1995) (in Japanese)
Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: Formation of geometric patterns. SIAM J. of Comput. 28(4), 1347–1363 (1999)
Yamashita, M., Suzuki, I.: Characterizing geometric patterns formable by oblivious anonymous mobile robots. Theoretical Computer Science 411, 2433–2453 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fujinaga, N., Yamauchi, Y., Kijima, S., Yamashita, M. (2012). Asynchronous Pattern Formation by Anonymous Oblivious Mobile Robots. In: Aguilera, M.K. (eds) Distributed Computing. DISC 2012. Lecture Notes in Computer Science, vol 7611. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33651-5_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-33651-5_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33650-8
Online ISBN: 978-3-642-33651-5
eBook Packages: Computer ScienceComputer Science (R0)