Search
Abstract
We consider two versions of the rendezvous problem: exact RV, when the points representing agents have to coincide at some time, and e-RV, when these points have to get at distance less than e in the terrain. In any terrain, each agent chooses its trajectory, but the movements of the agent on this trajectory are controlled by an adversary that may, e.g. speed up or slow down the agent.
Citations
-
0
CrossRef
-
0
Web of Science
-
0
Scopus
Authors (3)
-
Jurek Czyzowicz
- Great Britain Great Britain
-
Andrzej Pelc
- Canada ..
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Articles
- Type:
- artykuł w czasopiśmie wyróżnionym w JCR
- Published in:
-
THEORY OF COMPUTING SYSTEMS
no. 52,
pages 179 - 199,
ISSN: 1432-4350 - Language:
- English
- Publication year:
- 2013
- Bibliographic description:
- Czyzowicz J., Kosowski A., Pelc A.: Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains// THEORY OF COMPUTING SYSTEMS. -Vol. 52, nr. 2 (2013), s.179-199
- DOI:
- Digital Object Identifier (open in new tab) 10.1007/978-3-642-15155-2_27
- Verified by:
- Gdańsk University of Technology
seen 99 times
Recommended for you
Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
- J. Czyzowicz,
- A. Kosowski,
- A. Pelc
2010
Rendezvous of heterogeneous mobile agents in edge-weighted networks
- D. Dereniowski,
- R. Klasing,
- A. Kosowski
- + 1 authors
2015
Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks
- D. Dereniowski,
- Ł. Kuszner,
- A. Kosowski
- + 1 authors
2014
How to meet when you forget: log-space rendezvous in arbitrary graphs
- J. Czyzowicz,
- A. Kosowski,
- A. Pelc
2011