Dokumentenserver der Freien Universität Berlin

Objekt-Metadaten

An efficient competitive strategy for learning a polygon
Hoffmann, Frank ;  Icking, Christian ;  Klein, Rolf ;  Kriegel, Klaus ;  Universität <Berlin, Freie Universität> / Fachbereich Mathematik und Informatik

Main titleAn efficient competitive strategy for learning a polygon
AuthorHoffmann, Frank
AuthorIcking, Christian
AuthorKlein, Rolf
AuthorKriegel, Klaus
InstitutionUniversität <Berlin, Freie Universität> / Fachbereich Mathematik und Informatik
No. of Pages30 S.
Series Freie Universität Berlin, Fachbereich Mathematik : Ser. B, Informatik ; 96,01
Classification (DDC)004 Data processing and Computer science
AbstractWe provide a competitive strategy for a mobile robot with vision, that has to explore an unknown simple polygon starting from and returning to a given point x0 on the boundary. Our strategy creates a tour that does not exceed in length 133 times the length of the shortest watchman route from x0. It has been claimed before by other authors that a competitive strategy with factor 2016 exists for this problem; but no proof has appeared except for the easy rectilinear case.
Documents
pdf-Datei
If your browser can't open the file, please download the file first and then open it
 
FU DepartmentDepartment of Mathematics and Computer Science
Other affiliation(s)Institut für Informatik
Year of publication1996
Type of documentMaps
LanguageEnglish
Terms of use/Rights Nutzungsbedingungen
Created at2009-03-19 : 01:38:57
Last changed2014-01-23 : 04:21:17
 
Static URLhttp://edocs.fu-berlin.de/docs/receive/FUDOCS_document_000000001293
Statistics
 

LOADING...