Mostrar el registro sencillo del ítem

Optimal Exploration of Terrains with Obstacles

hal.structure.identifierDépartement d'Informatique et d'Ingénierie [DII]
dc.contributor.authorCZYZOWICZ, Jurek
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
hal.structure.identifierAlgorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
dc.contributor.authorILCINKAS, David
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorLABOUREL, Arnaud
hal.structure.identifierDépartement d'Informatique et d'Ingénierie [DII]
dc.contributor.authorPELC, Andrzej
dc.date.accessioned2024-04-15T09:49:58Z
dc.date.available2024-04-15T09:49:58Z
dc.date.created2009-12-18
dc.date.issued2009-12-18
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/198294
dc.descriptionRapport de recherche du LaBRI : RR-1468-09
dc.description.abstractEnA mobile robot represented by a point moving in the plane has to explore an unknown terrain with obstacles. Both the terrain and the obstacles are modeled as arbitrary polygons. We consider two scenarios: the unlimited vision, when the robot situated at a point p of the terrain explores (sees) all points q of the terrain for which the segment pq belongs to the terrain, and the limited vision, when we require additionally that the distance between p and q be at most 1. All points of the terrain (except obstacles) have to be explored and the performance of an exploration algorithm is measured by the length of the trajectory of the robot. For unlimited vision we show an exploration algorithm with complexity O(P + D√k), where P is the total perimeter of the terrain (including perimeters of obstacles), D is the diameter of the convex hull of the terrain, and k is the number of obstacles. We do not assume knowledge of these parameters. We also prove a matching lower bound showing that the above complexity is optimal, even if the terrain is known to the robot. For limited vision we show exploration algorithms with complexity O(P + A + √Ak), where A is the area of the terrain (excluding obstacles). Our algorithms work either for arbitrary terrains, if one of the parameters A or k is known, or for c-fat terrains, where c is any constant (unknown to the robot) and no additional knowledge is assumed. (A terrain T with obstacles is c-fat if R/r ≤ c, where R is the radius of the smallest disc containing T and r is the radius of the largest disc contained in T .) We also prove a matching lower bound Ω(P + A + √Ak) on the complexity of exploration for limited vision, even if the terrain is known to the robot.
dc.language.isoen
dc.subjectmobile robot
dc.subjectexploration
dc.subjectpolygon
dc.subjectobstacle
dc.title.enOptimal Exploration of Terrains with Obstacles
dc.typeAutre document
dc.subject.halInformatique [cs]/Algorithme et structure de données [cs.DS]
dc.identifier.arxiv1001.0639
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
hal.identifierhal-00442209
hal.version1
hal.popularnon
hal.audienceNon spécifiée
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00442209v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2009-12-18&rft.au=CZYZOWICZ,%20Jurek&ILCINKAS,%20David&LABOUREL,%20Arnaud&PELC,%20Andrzej&rft.genre=unknown


Archivos en el ítem

ArchivosTamañoFormatoVer

No hay archivos asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem