CZYZOWICZ, Jurek; ILCINKAS, David; LABOUREL, Arnaud; PELC, Andrzej

doi:10.1016/j.tcs.2011.09.002

Métadonnées

Licence d’utilisation du document

CZYZOWICZ, Jurek
Département d'Informatique et d'Ingénierie [DII]

ILCINKAS, David
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]

LABOUREL, Arnaud
Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 [LIF]

Langue

Article de revue

Ce document a été publié dans

Theoretical Computer Science. 2011-11, vol. 412, n° 50, p. 6926-6937

Elsevier

Résumé en anglais

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.< Réduire

Mots clés

mobile agent

rendezvous

deterministic

polygon

obstacle

URI

https://oskar-bordeaux.fr/handle/20.500.12278/198027

DOI

http://dx.doi.org/10.1016/j.tcs.2011.09.002

Project ANR

Algorithm Design and Analysis for Implicitly and Incompletely Defined Interaction Networks - ANR-07-BLAN-0322

Origine

Importé de hal

Unités de recherche

Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800