How many oblivious robots can explore a line
| hal.structure.identifier | School of Information Technology and Engineering [Ottawa] [SITE] | |
| dc.contributor.author | FLOCCHINI, Paola | |
| 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 | Département d'Informatique et d'Ingénierie [DII] | |
| dc.contributor.author | PELC, Andrzej | |
| hal.structure.identifier | School of Computer Science [Ottawa] | |
| dc.contributor.author | SANTORO, Nicola | |
| dc.date.accessioned | 2024-04-15T09:46:40Z | |
| dc.date.available | 2024-04-15T09:46:40Z | |
| dc.date.issued | 2011-10-31 | |
| dc.identifier.issn | 0020-0190 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/198028 | |
| dc.description.abstractEn | We consider the problem of exploring an anonymous line by a team of k identical, oblivious, asynchronous deterministic mobile robots that can view the environment but cannot communicate. We completely characterize sizes of teams of robots capable of exploring a n-node line. For k= 5, or k=4 and n is odd. For all values of k for which exploration is possible, we give an exploration algorithm. For all others, we prove an impossibility result. | |
| 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.en | distributed computing | |
| dc.subject.en | mobile robots | |
| dc.subject.en | asynchronous | |
| dc.subject.en | oblivious | |
| dc.subject.en | exploration | |
| dc.subject.en | line | |
| dc.title.en | How many oblivious robots can explore a line | |
| dc.type | Article de revue | |
| dc.identifier.doi | 10.1016/j.ipl.2011.07.018 | |
| dc.subject.hal | Informatique [cs]/Calcul parallèle, distribué et partagé [cs.DC] | |
| dc.subject.hal | Informatique [cs]/Algorithme et structure de données [cs.DS] | |
| bordeaux.journal | Information Processing Letters | |
| bordeaux.page | 1027-1031 | |
| bordeaux.volume | 111 | |
| bordeaux.hal.laboratories | Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 | * |
| bordeaux.issue | 20 | |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-00643668 | |
| hal.version | 1 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-00643668v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Information%20Processing%20Letters&rft.date=2011-10-31&rft.volume=111&rft.issue=20&rft.spage=1027-1031&rft.epage=1027-1031&rft.eissn=0020-0190&rft.issn=0020-0190&rft.au=FLOCCHINI,%20Paola&ILCINKAS,%20David&PELC,%20Andrzej&SANTORO,%20Nicola&rft.genre=article |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||