Abstract
In this work, we reconsider the well-known Go-To-The-Center algorithm due to Ando, Suzuki, and Yamashita [2] for gathering in the plane n autonomous mobile robots with limited viewing range. The above authors have introduced it as a discrete, round-based algorithm and proved its correctness. In [8], by Degener et al. it is shown that the algorithm gathers in \(\varTheta \left( n^2\right) \) rounds. Remarkably, this algorithm exploits the fact, that during its execution, many collisions of robots occur. Such collisions are interpreted as a success because it is assumed that such collided robots behave the same from now on. This is o.k. under the assumption, those robots have no extent. Otherwise, collisions should be avoided.
In this paper, we consider a continuous Go-To-The-Center (GTC) strategy in which the robots continuously observe the positions of their neighbors and adapt their speed (assuming a speed limit) and direction. Our first results are time bounds of \(O\left( n^2\right) \) for gathering in two-dimensional Euclidean space, and \(\varTheta \left( n\right) \) for the one-dimensional case.
Our main contribution is the introduction and evaluation of a continuous algorithm which performs Go-To-The-Center considering only the neighbors of a robots w.r.t. the Gabriel subgraph of the visibility graph (GTGC). We show that this modification still correctly executes gathering in one and two dimensions, with the same time bounds as above. Simulations exhibit a severe difference of the behavior of the GTC and the GTGC strategy: Whereas lots of collisions occur during a run of the GTC strategy, typically only one, namely the final collision occurs during a run of the GTGC strategy. We can prove this “collisionless property” of the GTGC algorithm for the one-dimensional case. In the case of the two-dimensional Euclidean space, we conjecture that the “collisionless property” holds for almost every initial configuration.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This work was partially supported by the German Research Foundation (DFG) within the Collaborative Research Center “On-The-Fly Computing” (SFB 901) and the International Graduate School “Dynamic Intelligent Systems”.
This work is submitted to Distributed & Mobile track of ALGOSENSORS 2016.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Find a video at: https://youtu.be/jA9foyZegFY.
References
Agathangelou, C., Georgiou, C., Mavronicolas, M.: A distributed algorithm for gathering many fat mobile robots in the plane. In: Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing, PODC 2013, pp. 250–259. ACM, New York, NY, USA (2013)
Ando, H., Suzuki, I., Yamashita, M.: Formation and agreement problems for synchronous mobile robots with limited visibility. In: Proceedings of the 1995 IEEE International Symposium on Intelligent Control, 1995, pp. 453–460 (1995)
Chrystal, G.: On the problem to construct the minimum circle enclosing n givenpoints in a plane. In: Proceedings of the Edinburgh Mathematical Society, Third Meeting, pp. 30–35 (1885)
Cohen, R., Peleg, D.: Convergence properties of the gravitational algorithm in asynchronous robot systems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 228–239. Springer, Heidelberg (2004). doi:10.1007/978-3-540-30140-0_22
Cord-Landwehr, A., et al.: Collisionless gathering of robots with an extent. In: Černá, I., Gyimóthy, T., Hromkovič, J., Jefferey, K., Králović, R., Vukolić, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol. 6543, pp. 178–189. Springer, Heidelberg (2011). doi:10.1007/978-3-642-18381-2_15
Cortes, J., Martinez, S., Bullo, F.: Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions. IEEE Trans. Autom. Control 51(8), 1289–1298 (2006)
Czyzowicz, J., Gsieniec, L., Pelc, A.: Gathering few fat mobile robots in the plane. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 350–364. Springer, Heidelberg (2006). doi:10.1007/11945529_25
Degener, B., Kempkes, B., Langner, T., auf der Heide, F.M., Pietrzyk, P., Wattenhofer, R.: A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2011, pp. 139–148. ACM, New York, NY, USA (2011)
Ruben Gabriel, K., Sokal, R.: A new statistical approach to geographic variation analysis. Syst. Biol. 18(3), 259–278 (1969)
Gordon, N., Wagner, I.A., Bruckstein, A.M.: Gathering multiple robotic a(ge)nts with limited sensing capabilities. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., Stützle, T. (eds.) ANTS 2004. LNCS, vol. 3172, pp. 142–153. Springer, Heidelberg (2004). doi:10.1007/978-3-540-28646-2_13
Karp, B., Kung, H.T.: Gpsr: Greedy perimeter stateless routing for wireless networks. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, MobiCom 2000, pp. 243–254. ACM, New York, NY, USA (2000)
Kempkes, B., Kling, P., auf der Heide, F.M.: Optimal and competitive runtime bounds for continuous, local gathering of mobile robots. In: Proceedinbgs of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2012, pp. 18–26. ACM, New York, NY, USA (2012)
Megiddo, N.: Linear-time algorithms for linear programming in \(\mathbb{R}^3\) and related problems. SIAM J. Comput. 12(4), 759–776 (1983)
Pagli, L., Prencipe, G., Viglietta, G.: Getting close without touching. In: Even, G., Halldórsson, M.M. (eds.) SIROCCO 2012. LNCS, vol. 7355, pp. 315–326. Springer, Heidelberg (2012). doi:10.1007/978-3-642-31104-8_27
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
A Appendix
A Appendix
1.1 A.1 Examples and experimental results
The Fig. 3 highlights the difference between GTC and GTGC. Initial configuration (Fig. 3(a)) is connected. Figure 3(b) and (c) represent the evolution of the group of the robots that uses GTC algorithm. Figure 3(d) and (e) represent robots that use GTGC algorithm at the same points in time \(t_1 < t_2\). Robots 2, 6 and 3, 5 that use unit disc graph neighborhood have an early collision at time \(t_2\) and behave as one since that point in time. On the other hand, robots that used GTGC algorithm had no collisions.
The Figs. 4, 5, 6 illustrate instances of the graphs used in the experiments.
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Li, S., Meyer auf der Heide, F., Podlipyan, P. (2017). The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots. In: Chrobak, M., Fernández Anta, A., Gąsieniec, L., Klasing, R. (eds) Algorithms for Sensor Systems. ALGOSENSORS 2016. Lecture Notes in Computer Science(), vol 10050. Springer, Cham. https://doi.org/10.1007/978-3-319-53058-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-53058-1_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-53057-4
Online ISBN: 978-3-319-53058-1
eBook Packages: Computer ScienceComputer Science (R0)