Online searching with an autonomous robot
From MaRDI portal
Publication:2489019
DOI10.1016/j.comgeo.2005.08.005zbMath1092.68689MaRDI QIDQ2489019
Rolf Klein, Sándor P. Fekete, Andreas Nüchter
Publication date: 16 May 2006
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2005.08.005
Searching; Autonomous mobile robots; Competitive strategies; Kurt3D; Online searching; Three-dimensional laser scanning; Visibility problems; Watchman problems
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68T45: Machine vision and scene understanding
68T40: Artificial intelligence for robotics
Related Items
Optimal strategies for maintaining a chain of relays between an explorer and a base camp, Polygon exploration with time-discrete vision, Online searching with an autonomous robot, Online searching with turn cost
Cites Work
- Unnamed Item
- Unnamed Item
- Constructing competitive tours from local information
- Finding the shortest watchman route in a simple polygon
- Online searching with an autonomous robot
- Online searching with turn cost
- The Polygon Exploration Problem
- AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES
- CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"