 |
university of Provence - Aix-Marseille I |  |
|
university of Provence - Aix-Marseille I | |
| HAL: hal-00643686, version 1 |
| DOI: 10.1016/j.tcs.2011.09.002 |
| Detailed view |  Export this paper |
 |
| Theoretical Computer Science 412, 50 (2011) 6926-6937 |
|
|
|
|
| Asynchronous deterministic rendezvous in bounded terrains |
|
|
| Jurek Czyzowicz 1David Ilcinkas 2, 3 |
|
|
| (2011-11) |
|
|
|
| Two mobile agents (robots) have to meet in an a priori unknown bounded terrain modeled as a polygon, possibly with polygonal obstacles. Robots are modeled as points, and each of them is equipped with a compass. Compasses of robots may be incoherent. Robots construct their routes, but the actual walk of each robot is decided by the adversary that may, e.g., speed up or slow down the robot. We consider several scenarios, depending on three factors: (1) obstacles in the terrain are present, or not, (2) compasses of both robots agree, or not, (3) robots have or do not have a map of the terrain with their positions marked. The cost of a rendezvous algorithm is the worst-case sum of lengths of the robots' trajectories until they meet. For each scenario we design a deterministic rendezvous algorithm and analyze its cost. We also prove lower bounds on the cost of any deterministic rendezvous algorithm in each case. For all scenarios these bounds are tight. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Département d'Informatique et d'Ingénierie (DII) |
|
|
|
Université du Québec en Outaouais |
|
|
| 2: | Laboratoire Bordelais de Recherche en Informatique (LaBRI) |
|
|
|
CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) – Université Victor Segalen - Bordeaux II |
|
|
| 3: | CEPAGE (INRIA Bordeaux - Sud-Ouest) |
|
|
|
INRIA – CNRS : UMR5800 – Université Sciences et Technologies - Bordeaux I – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) |
|
|
| 4: | Laboratoire d'informatique Fondamentale de Marseille (LIF) |
|
|
|
CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Distributed, Parallel, and Cluster Computing Computer Science/Computational Geometry |
|
|
| mobile agent – rendezvous – deterministic – polygon – obstacle |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00643686, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00643686 | |
| oai:hal.archives-ouvertes.fr:hal-00643686 | |
| From: David Ilcinkas | |
| Submitted on: Tuesday, 22 November 2011 15:40:04 | |
| Updated on: Tuesday, 22 November 2011 15:59:55 | |
