<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-08-15T12:03:54Z</responseDate>
  <request identifier="191" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:191</identifier>
        <datestamp>2024-03-06T11:06:13Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Searching with an Autonomous Robot</dc:title>
          <dc:creator>Fekete, Sándor</dc:creator>
          <dc:creator>Klein, Rolf</dc:creator>
          <dc:creator>Nüchter, Andreas</dc:creator>
          <dc:subject>Searching</dc:subject>
          <dc:subject>visibility problems</dc:subject>
          <dc:subject>watchman problems</dc:subject>
          <dc:subject>online searching</dc:subject>
          <dc:subject>competitive strategies</dc:subject>
          <dc:subject>autonomous mobile robots three-dimensional laser scanning</dc:subject>
          <dc:subject>Kurt3D</dc:subject>
          <dc:description>We discuss online strategies for visibility-based&#13;
searching for an object hidden behind a corner,&#13;
using Kurt3D, a real autonomous mobile robot. This task&#13;
is closely related to a number of well-studied problems.&#13;
Our robot uses a three-dimensional laser scanner in a&#13;
stop, scan, plan, go fashion for building a virtual&#13;
three-dimensional environment.&#13;
Besides planning trajectories and avoiding obstacles, Kurt3D is capable of identifying objects like a chair.&#13;
We derive a practically useful and asymptotically&#13;
optimal strategy that guarantees a competitive ratio of 2,&#13;
which differs remarkably from the well-studied scenario&#13;
without the need of stopping for surveying the environment. Our strategy is used by Kurt3D, documented in a separate video.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Sándor Fekete and Rolf Klein and Andreas Nüchter</dc:contributor>
          <dc:date>2005</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 5031, Algorithms for Optimization with Incomplete Information (2005)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.05031.27</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-1919</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05031.27</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
