## Abstract

We consider a rendezvous problem in which two identical anonymous mobile entities A and B, called later robots, are asked to meet at some node in the network modelled by an arbitrary undirected graph G=(V,E). Most of the work devoted to rendezvous in graphs assumes robots have access to the same sets of nodes and edges, and the topology of connections is either known or unknown to the robots. In this work we assume that each robot may access only specific nodes and edges in G of which full map is given to the robot in advance. We consider three variants of rendezvous differentiated by the level of restricted maneuverability of robots in both synchronous and asynchronous models of computation. In each adopted variant and model of computation we study feasibility of rendezvous, and if rendezvous is possible we propose the relevant algorithms and discuss their efficiency.

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

Pages (from-to) | 49-59 |

Number of pages | 11 |

Journal | Journal of Computer and System Sciences |

Volume | 106 |

DOIs | |

State | Published - Dec 2019 |

Externally published | Yes |

## Keywords

- Distributed algorithm
- Mobile agents
- Rendezvous

## ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Networks and Communications
- Computational Theory and Mathematics
- Applied Mathematics