Competitive Exploration of Rectilinear Polygons

DSpace Repository

Competitive Exploration of Rectilinear Polygons

Show full item record

Files for download

Facebook

Simple item record

Publication Article, peer reviewed scientific
Title Competitive Exploration of Rectilinear Polygons
Author(s) Hammar, Mikael ; Nilsson, Bengt J ; Persson, Mia
Date 2006
English abstract
Exploring a polygon with robots, when the robots do not have knowledge of the surroundings can be viewed as an online problem. Typical for online problems is that decisions must be made based on past events without complete information about the future. In our case the robots do not have complete information about the environment. Competitive analysis can be used to measure the performance of methods solving online problems. The competitive ratio of such a method is the ratio between the method's performance and the performance of the best method having full knowledge of the future. We are interested in obtaining good bounds on the competitive ratio of exploring polygons and prove constant competitive strategies and lower bounds for exploring a simple rectilinear polygon in the $L_1$ metric.
DOI http://dx.doi.org/10.1016/j.tcs.2005.11.032 (link to publisher's fulltext)
Publisher Elsevier
Host/Issue Theoretical Computer Science;3
Volume 354
ISSN 0304-3975
Pages 367-378
Language eng (iso)
Subject(s) Sciences
Research Subject Categories::MATHEMATICS::Applied mathematics::Theoretical computer science
Research Subject Categories::TECHNOLOGY::Information technology::Computer science::Computer science
Note Selected paper presented at the 14th Symposium on Fundamentals of Computation Theory that has been held in Malmö, Sweden, August 13–15, 2003.
Handle http://hdl.handle.net/2043/11304 (link to this page)

This item appears in the following Collection(s)

Show full item record

Search


Browse

My Account

Statistics