Asynchronous deterministic rendezvous in bounded terrains
| hal.structure.identifier | Département d'Informatique et d'Ingénierie [DII] | |
| dc.contributor.author | CZYZOWICZ, Jurek | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| hal.structure.identifier | Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE] | |
| dc.contributor.author | ILCINKAS, David | |
| hal.structure.identifier | Laboratoire d'informatique Fondamentale de Marseille - UMR 6166 [LIF] | |
| dc.contributor.author | LABOUREL, Arnaud | |
| hal.structure.identifier | Département d'Informatique et d'Ingénierie [DII] | |
| dc.contributor.author | PELC, Andrzej | |
| dc.date.accessioned | 2024-04-15T09:46:39Z | |
| dc.date.available | 2024-04-15T09:46:39Z | |
| dc.date.issued | 2011-11 | |
| dc.identifier.issn | 1879-2294 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/198027 | |
| dc.description.abstractEn | 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. | |
| dc.description.sponsorship | Algorithm Design and Analysis for Implicitly and Incompletely Defined Interaction Networks - ANR-07-BLAN-0322 | |
| dc.language.iso | en | |
| dc.publisher | Elsevier | |
| dc.subject | mobile agent | |
| dc.subject | rendezvous | |
| dc.subject | deterministic | |
| dc.subject | polygon | |
| dc.subject | obstacle | |
| dc.title.en | Asynchronous deterministic rendezvous in bounded terrains | |
| dc.type | Article de revue | |
| dc.identifier.doi | 10.1016/j.tcs.2011.09.002 | |
| dc.subject.hal | Informatique [cs]/Calcul parallèle, distribué et partagé [cs.DC] | |
| dc.subject.hal | Informatique [cs]/Géométrie algorithmique [cs.CG] | |
| bordeaux.journal | Theoretical Computer Science | |
| bordeaux.page | 6926-6937 | |
| bordeaux.volume | 412 | |
| bordeaux.hal.laboratories | Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 | * |
| bordeaux.issue | 50 | |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-00643686 | |
| hal.version | 1 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00643686v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Theoretical%20Computer%20Science&rft.date=2011-11&rft.volume=412&rft.issue=50&rft.spage=6926-6937&rft.epage=6926-6937&rft.eissn=1879-2294&rft.issn=1879-2294&rft.au=CZYZOWICZ,%20Jurek&ILCINKAS,%20David&LABOUREL,%20Arnaud&PELC,%20Andrzej&rft.genre=article |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||