Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains

  • Authors:

  • Jurek Czyzowicz;Adrian Kosowski;Andrzej Pelc

  • Affiliations:

  • Département d'informatique, Université du Québec en Outaouais, Gatineau, Québec, Canada;Department of Algorithms and System Modeling, Gdańsk University of Technology, Gdańsk, Poland;Département d'informatique, Université du Québec en Outaouais, Gatineau, Québec, Canada

  • Venue:
  • MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Two mobile agents, modeled as points starting at different locations of an unknown terrain, have to meet. The terrain is a polygon with polygonal holes. We consider two versions of this rendezvous problem: exact RV, when the points representing the agents have to coincide at some time, and ε-RV, when these points have to get at distance less than ε 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. Agents have bounded memory: their computational power is that of finite state machines. Our aim is to compare the feasibility of exact and of ε-RV when agents are anonymous vs. when they are labeled. We show classes of polygonal terrains which distinguish all the studied scenarios from the point of view of feasibility of rendezvous. The features which influence the feasibility of rendezvous include symmetries present in the terrains, boundedness of their diameter, and the number of vertices of polygons in the terrains.