Online searching with an autonomous robot
From MaRDI portal
Publication:2489019
DOI10.1016/j.comgeo.2005.08.005zbMath1092.68689OpenAlexW2127399848MaRDI QIDQ2489019
Sándor P. Fekete, Andreas Nüchter, Rolf Klein
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
SearchingAutonomous mobile robotsCompetitive strategiesKurt3DOnline searchingThree-dimensional laser scanningVisibility problemsWatchman problems
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Machine vision and scene understanding (68T45) Artificial intelligence for robotics (68T40)
Related Items (6)
Optimal strategies for maintaining a chain of relays between an explorer and a base camp ⋮ Online searching with an autonomous robot ⋮ Online searching with turn cost ⋮ Wireless evacuation on \(m\) rays with \(k\) searchers ⋮ Competitive Searching for a Line on a Line Arrangement. ⋮ Polygon exploration with time-discrete vision
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"
This page was built for publication: Online searching with an autonomous robot