Farrugia, Ashley, Gasieniec, Leszek 
ORCID: 0000-0003-1809-9814, Kuszner, Lukasz and Pacheco, Eduardo
(2019)
Deterministic rendezvous with different maps.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 106.
pp. 49-59.
|
Text
elements.pdf - Author Accepted Manuscript Download (270kB) | Preview |
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.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Distributed algorithm, Mobile agents, Rendezvous |
| Depositing User: | Symplectic Admin |
| Date Deposited: | 20 Aug 2019 10:34 |
| Last Modified: | 19 Jan 2023 00:28 |
| DOI: | 10.1016/j.jcss.2019.06.001 |
| Related URLs: | |
| URI: | https://livrepository.liverpool.ac.uk/id/eprint/3052128 |
Dimensions
Dimensions
