Abstract
Two mobile agents with range of vision 1 start at arbitrary points in the plane and have to accomplish the task of approach, which consists in getting at distance at most one from each other, i.e., in getting within each other’s range of vision. An adversary chooses the initial positions of the agents, their possibly different starting times, and assigns a different positive integer label and a possibly different speed to each of them. Each agent is equipped with a compass showing the cardinal directions, with a measure of length and a clock. Each agent knows its label and speed but not those of the other agent and it does not know the initial position of the other agent relative to its own. Agents do not have any global system of coordinates and they cannot communicate. Our main result is a deterministic algorithm to accomplish the task of approach, working in time polynomial in the unknown initial distance between the agents, in the length of the smaller label and in the inverse of the larger speed. The distance travelled by each agent until approach is polynomial in the first two parameters and does not depend on the third. The problem of approach in the plane reduces to a network problem: that of rendezvous in an infinite grid.
Similar content being viewed by others
References
Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM J. Comput. 36, 56–82 (2006)
Alpern, S.: The rendezvous search problem. SIAM J. Control Optim. 33, 673–683 (1995)
Alpern, S.: Rendezvous search on labelled networks. Naval Res. Logist. 49, 256–274 (2002)
Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Int. Series in Operations research and Management Science. Kluwer, Berlin (2002)
Alpern, J., Baston, V., Essegaier, S.: Rendezvous search on a graph. J. Appl. Prob. 36, 223–231 (1999)
Anderson, E., Weber, R.: The rendezvous problem on discrete locations. J. Appl. Prob. 28, 839–851 (1990)
Bampas, E., Czyzowicz, J., Gasieniec, L., Ilcinkas, D., Labourel, A.: Almost optimal asynchronous rendezvous in infinite multidimensional grids. In: Proceedings of 24th International Symposium on Distributed Computing (DISC 2010), pp. 297–311
Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Solving the robots gathering problem. In: Proceedings of 30th International Colloquium on Automata, Languages and Programming (ICALP 2003), pp. 1181–1196
Cohen, R., Peleg, D.: Convergence properties of the gravitational algorithm in asynchronous robot systems. SIAM J. Comput. 34, 1516–1528 (2005)
Cohen, R., Peleg, D.: Convergence of autonomous mobile robots with inaccurate sensors and movements. SIAM J. Comput. 38, 276–302 (2008)
Collins, A., Czyzowicz, J., Gasieniec, L., Labourel, A.: Tell me where I am so I can meet you sooner. In: Procedings of 37th international colloquium on automata, languages and programming (ICALP 2010), pp. 502–514
Czyzowicz, J., Kosowski, A., Pelc, A.: How to meet when you forget: log-space rendezvous in arbitrary graphs. Distrib. Comput. 25, 165–178 (2012)
Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms 8, Article 37 (2012)
De Marco, G., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vaccaro, U.: Asynchronous deterministic rendezvous in graphs. Theor. Comput. Sci. 355, 315–326 (2006)
Dessmark, A., Fraigniaud, P., Kowalski, D., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica 46, 69–96 (2006)
Dieudonné, Y., Pelc, A.: Anonymous meeting in networks. In: Proceedings 24rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), pp. 737–747
Dieudonné, Y., Pelc, A., Peleg, D.: Gathering despite mischief. In: Proceedings of thre 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pp. 527–540
Dieudonné, Y., Pelc, A., Villain, V.: How to meet asynchronously at polynomial cost. In: Proceedings 32nd Annual ACM Symposium on Principles of Distributed Computing (PODC 2013), pp. 92–99
Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous oblivious robots with limited visibility. In: Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2001), pp. 247–258
Fraigniaud, P., Pelc, A.: Delays induce an exponential memory gap for rendezvous in trees. ACM Trans. Algorithms 9, article 17 (2013)
Guilbault, S., Pelc, A.: Asynchronous rendezvous of anonymous agents in arbitrary graphs. In: Proceedings of 15th International Conference on Principles of Distributed Systems (OPODIS 2011), pp. 162–173
Klasing, R., Kosowski, A., Navarra, A.: Taking advantage of symmetries: gathering of many asynchronous oblivious robots on a ring. Theor. Comput. Sci. 411, 3235–3246 (2010)
Klasing, R., Markou, E., Pelc, A.: Gathering asynchronous oblivious mobile robots in a ring. Theor. Comput. Sci. 390, 27–39 (2008)
Kowalski, D., Malinowski, A.: How to meet in anonymous network. In: Proceedings 13th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2006), pp. 44–58
Kranakis, E., Krizanc, D., Morin, P.: Randomized rendez-vous with limited memory, Proc. 8th Latin American Theoretical Informatics (LATIN 2008), Springer LNCS 4957, 605–616
Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile agent rendezvous in a ring. In: Proceedings of 23rd International Conference on Distributed Computing Systems (ICDCS 2003), IEEE, pp. 592–599
Lim, W., Alpern, S.: Minimax rendezvous on the line. SIAM J. Control Optim. 34, 1650–1665 (1996)
Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge (2005)
Pelc, A.: Deterministic rendezvous in networks: a comprehensive survey. Networks 59, 331–347 (2012)
Ta-Shma, A., Zwick, U.: Deterministic rendezvous, treasure hunts and strongly universal exploration sequences. In: Proceedings of 18th ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 599–608
Yu, X., Yung, M.: Agent rendezvous: a dynamic symmetry-breaking problem. In: Proceedings of International Colloquium on Automata, Languages, and Programming (ICALP 1996), pp. 610–621
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this paper appeared in the Proc. 40th International Colloquium on Automata, Languages and Programming (ICALP 2013), track C. Partially supported by NSERC discovery Grant and by the Research Chair in Distributed Computing at the Université du Québec en Outaouais.
Rights and permissions
About this article
Cite this article
Dieudonné, Y., Pelc, A. Deterministic polynomial approach in the plane. Distrib. Comput. 28, 111–129 (2015). https://doi.org/10.1007/s00446-014-0216-5
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00446-014-0216-5