Abstract
In this paper we consider the problem of synchronous rendezvous in which two anonymous mobile entities (robots) A and B are expected to meet at the same time and point in a graph G = (V,E). Most of the work devoted to rendezvous in graphs assumes that robots have access to the same sets of nodes and edges, where the topology of connections may be initially known or unknown. In our work we assume the movement of robots is restricted by the topological properties of the graph space coupled with the intrinsic characteristics of robots preventing them from visiting certain edges in E.
We consider three rendezvous models reflecting on restricted maneuverability of robots A and B. In Edge Monotonic Model each robot X ∈ {A,B} has weight w X and each edge in E has a weight restriction. Consequently, a robot X is only allowed to traverse edges with weight restrictions greater that w X . In the remaining two models graph G is unweighted and the restrictions refer to more arbitrary subsets of traversable nodes and edges. In particular, in Node Inclusive Model the set of nodes V X available to robot X, for X ∈ {A,B} satisfies the condition V A ⊆ V B or vice versa, and in Blind Rendezvous Model the relation between V A and V B is arbitrary. In each model we design and analyze efficient rendezvous algorithms. We conclude with a short discussion on the asynchronous case and related open problems.
Research partially supported by the Polish National Science Center grant DEC-2011/02/A/ST6/00201 and by Network Sciences and Technologies initiative at University of Liverpool.
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 subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agathangelou, C., Georgiou, C., Mavronicolas, M.: A distributed algorithm for gathering many fat mobile robots in the plane. In: Proc. PODC 2013, pp. 250–259 (2013)
Alpern, S.: The rendezvous search problem. SIAM J. Control and Optimization (33), 673–683 (1995)
Alpern, S.: Rendezvous search on labeled networks. Naval Reaserch Logistics (49), 256–274 (2002)
Alpern, S., Fokkink, R.: Gąsieniec, L., Lindelauf, R., Subrahmanian, V.S.: Search Theory, A Game Theoretic Perspective. Springer (2013)
Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer Academic Publishers (2002)
Anderson, E., Fekete, S.: Asymmetric rendezvous on the plane. In: Proc. Symp. on Computational Geometry, pp. 365–373 (1998)
Anderson, E., Fekete, S.: Two-dimensional rendezvous search. Operations Research (49), 107–118 (2001)
Anderson, E., Weber, R.: The rendezvous problem on discrete locations. Journal of Applied Probability (28), 839–851 (1990)
Baston, V., Gal, S.: Rendezvous on the line when the players’ initial distance is given by an unknown probability distribution. SIAM J. Control and Optimization (36), 1880–1889 (1998)
Baston, V., Gal, S.: Rendezvous search when marks are left at the starting points. Naval Reaserch Logistics (48), 722–731 (2001)
Chen, S., Russell, A., Samanta, A., Sundaram, R.: Deterministic Blind Rendezvous in Cognitive Radio Networks. In: Proc. ICDCS (2014)
Collins, A., Czyzowicz, J., Gąsieniec, L., Labourel, A.: Tell Me Where I Am So I Can Meet You Sooner. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 502–514. Springer, Heidelberg (2010)
Collins, A., Czyzowicz, J., Gąsieniec, L., Kosowski, A., Martin, R.: Synchronous Rendezvous for Location-Aware Agents. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 447–459. Springer, Heidelberg (2011)
Czyzowicz, J., Gąsieniec, L., Pelc, A.: Gathering few fat mobile robots in the plane. Theoretical Computer Science 410(6-7), 481–499 (2009)
Czyzowicz, J., Kosowski, A., Pelc, A.: How to meet when you forget: Log-space rendezvous in arbitrary graphs. Distributed Computing (25), 165–178 (2012)
Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. ACM Transactions on Algorithms (8), article 37 (2012)
Dereniowski, D., Klasing, R., Kosowski, A., Kuszner, Ł.: Rendezvous of heterogeneous mobile agents in edge-weighted networks. In: Halldórsson, M.M. (ed.) SIROCCO 2014. LNCS, vol. 8576, pp. 311–326. Springer, Heidelberg (2014)
Kowalski, D., Malinowski, A.: How to meet in anonymous network. Theoretical Computer Science (399), 141–156 (2008)
An, H.-C., Krizanc, D., Rajsbaum, S.: Mobile Agent Rendezvous: A Survey. In: Flocchini, P., Gąsieniec, L. (eds.) SIROCCO 2006. LNCS, vol. 4056, pp. 1–9. Springer, Heidelberg (2006)
Lin, Z., Liu, H., Chu, X., Leung, Y.-W.: Jump-stay based channel-hopping algorithm with guaranteed rendezvous for cognitive radio networks. In: Proc. INFOCOM, pp. 2444–2452 (2011)
Miller, A., Pelc, A.: Time Versus Cost Tradeoffs for Deterministic Rendezvous in Networks. In: Proc. PODC, pp. 282–290 (2014)
Pelc, A.: Deterministic rendezvous in networks: A comprehensive survey. Networks (59), 331–347 (2012)
Schelling, T.: The Strategy of Conflict. Harvard Univ. Press, Cambridge (1960)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Farrugia, A., Gąsieniec, L., Kuszner, Ł., Pacheco, E. (2015). Deterministic Rendezvous in Restricted Graphs. In: Italiano, G.F., Margaria-Steffen, T., Pokorný, J., Quisquater, JJ., Wattenhofer, R. (eds) SOFSEM 2015: Theory and Practice of Computer Science. SOFSEM 2015. Lecture Notes in Computer Science, vol 8939. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46078-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-662-46078-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-46077-1
Online ISBN: 978-3-662-46078-8
eBook Packages: Computer ScienceComputer Science (R0)