Abstract
We consider the plane formation problem that requires a set of autonomous mobile robots initially placed in the three-dimensional space to land on a common plane that is not defined a priori. The problem was first introduced for fully-synchronous (FSYNC) robots with rigid movement (i.e., the robots always reach the next position) and solvable instances are characterized in terms of the symmetry among the robots, i.e., the rotation group of the initial configuration of robots (Yamauchi et al. DISC 2015). We consider the plane formation problem for semi-synchronous (SSYNC) robots with non-rigid movement. We present a plane formation algorithm for oblivious SSYNC robots, and show that the SSYNC robots with non-rigid movement have the same plane formation power as the FSYNC robots with rigid movement.
Keywords
This work was supported by JSPS KAKENHI Grant Numbers JP15H00821, JP15K15938, JP25700002, JP15K11987, JP15H02666, and a Grant-in-Aid for Scientific Research on Innovative Areas “Molecular Robotics” (No. 24104003) of MEXT, Japan.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
We note that the effect of this non-rigid movement is rather moderate because the robots can get out of this loop when their moving distance becomes smaller than the minimum moving distance.
References
Cromwell, P.: Polyhedra. University Press, Cambridge (1997)
Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by mobile robots: gathering. SIAM J. of Comput. 41(4), 829–879 (2012)
Dijkstra, E.W.: Self stabilizing systems in spite of distributed control. Comm. ACM 17, 643–644 (1974)
Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Morgan & Claypool, San Rafeal (2012)
Flocchini, P., Prencipe, G., Santoro, N., Viglietta, G.: Distributed computing by mobile robots: Solving the uniform circle formation problem. In: Proceedings OPODIS 2014, pp. 217–232 (2014)
Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. Theor. Comput. Sci 407, 412–447 (2008)
Fujinaga, N., Yamauchi, Y., Ono, H., Kijima, S., Yamashita, M.: Pattern formation by oblivious asynchronous mobile robots. SIAM J. Comput. 44(3), 740–785 (2015)
Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: Formation of geometric patterns. SIAM J. on Comput. 28(4), 1347–1363 (1999)
Yamashita, M., Suzuki, I.: Characterizing geometric patterns formable by oblivious anonymous mobile robots. Theor. Comput. Sci. 411, 2433–2453 (2010)
Yamauchi, Y., Uehara, T., Kijima, S., Yamashita, M.: Plane formation by synchronous mobile robots in the three dimensional euclidean space. In: Moses, Y. (ed.) DISC 2015. LNCS, vol. 9363, pp. 92–106. Springer, Heidelberg (2015). doi:10.1007/978-3-662-48653-5_7
Yamauchi, Y., Uehara, T., Yamashita, M.: Brief announcement: pattern formation problem for synchronous mobile robots in the three dimensional euclidean space. In: Proceedings of PODC 2016, pp. 447–449 (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Uehara, T., Yamauchi, Y., Kijima, S., Yamashita, M. (2016). Plane Formation by Semi-synchronous Robots in the Three Dimensional Euclidean Space. In: Bonakdarpour, B., Petit, F. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2016. Lecture Notes in Computer Science(), vol 10083. Springer, Cham. https://doi.org/10.1007/978-3-319-49259-9_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-49259-9_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49258-2
Online ISBN: 978-3-319-49259-9
eBook Packages: Computer ScienceComputer Science (R0)