### 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.

Original language | English (US) |
---|---|

Title of host publication | SOFSEM 2015 |

Subtitle of host publication | Theory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science, |

Editors | Giuseppe F. Italiano, Tiziana Margaria-Steffen, Jaroslav Pokorný, Jean-Jacques Quisquater, Roger Wattenhofer |

Publisher | Springer Verlag |

Pages | 189-200 |

Number of pages | 12 |

ISBN (Electronic) | 9783662460771 |

DOIs | |

State | Published - 2015 |

Event | 41st International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2015 - Pec pod Sněžkou, Czech Republic Duration: Jan 24 2015 → Jan 29 2015 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 8939 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 41st International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2015 |
---|---|

Country | Czech Republic |

City | Pec pod Sněžkou |

Period | 1/24/15 → 1/29/15 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Deterministic rendezvous in restricted graphs'. Together they form a unique fingerprint.

## Cite this

*SOFSEM 2015: Theory and Practice of Computer Science - 41st International Conference on Current Trends in Theory and Practice of Computer Science,*(pp. 189-200). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8939). Springer Verlag. https://doi.org/10.1007/978-3-662-46078-8_16