Search
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:
Citations
-
5
CrossRef
-
0
Web of Science
-
5
Scopus
Authors (4)
-
Ashley Farrugia
- . .
-
Leszek Gąsieniec
- . .
-
Eduardo Pacheco
- . .
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Conference activity
- Type:
- materiały konferencyjne indeksowane w Web of Science
- Title of issue:
- 41st International Conference on Current Trends in Theory and Practice of Computer Science ((SOFSEM) strony 189 - 200
- Language:
- English
- Publication year:
- 2015
- Bibliographic description:
- Farrugia A., Gąsieniec L., Kuszner Ł., Pacheco E..: Deterministic Rendezvous in Restricted Graphs, W: 41st International Conference on Current Trends in Theory and Practice of Computer Science ((SOFSEM), 2015, Springer,.
- DOI:
- Digital Object Identifier (open in new tab) 10.1007/978-3-662-46078-8_16
- Verified by:
- Gdańsk University of Technology
seen 64 times
Recommended for you
How to meet when you forget: log-space rendezvous in arbitrary graphs
- J. Czyzowicz,
- A. Kosowski,
- A. Pelc
2011
A Point Set Connection Problem for Autonomous Mobile Robots in a Grid
- A. Kosowski,
- I. Suzuki,
- P. Zylinski
2012
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- R. Klasing,
- A. Kosowski,
- A. Navarra
2010