dc.contributor.author
Hoffmann, Frank
dc.contributor.author
Icking, Christian
dc.contributor.author
Klein, Rolf
dc.contributor.author
Kriegel, Klaus
dc.date.accessioned
2018-06-08T08:03:28Z
dc.date.available
2009-03-19T13:38:57.777Z
dc.identifier.uri
https://refubium.fu-berlin.de/handle/fub188/19275
dc.identifier.uri
http://dx.doi.org/10.17169/refubium-22935
dc.description.abstract
We 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.
de
dc.relation.ispartofseries
urn:nbn:de:kobv:188-fudocsseries000000000021-2
dc.rights.uri
http://www.fu-berlin.de/sites/refubium/rechtliches/Nutzungsbedingungen
dc.subject.ddc
000 Informatik, Informationswissenschaft, allgemeine Werke::000 Informatik, Wissen, Systeme::004 Datenverarbeitung; Informatik
dc.title
An efficient competitive strategy for learning a polygon
refubium.affiliation
Mathematik und Informatik
de
refubium.affiliation.other
Institut für Informatik
refubium.mycore.fudocsId
FUDOCS_document_000000001293
refubium.resourceType.isindependentpub
no
refubium.series.name
Freie Universität Berlin, Fachbereich Mathematik und Informatik
refubium.series.reportNumber
96-1
refubium.mycore.derivateId
FUDOCS_derivate_000000000296
dcterms.accessRights.openaire
open access
