Online searching with an autonomous robot
DOI10.1016/J.COMGEO.2005.08.005zbMATH Open1092.68689OpenAlexW2127399848MaRDI QIDQ2489019FDOQ2489019
Authors: 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
Recommendations
SearchingAutonomous mobile robotsCompetitive strategiesKurt3DOnline searchingThree-dimensional laser scanningVisibility problemsWatchman problems
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Artificial intelligence for robotics (68T40) Machine vision and scene understanding (68T45)
Cites Work
- Title not available (Why is that?)
- The polygon exploration problem
- AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES
- Constructing competitive tours from local information
- Finding the shortest watchman route in a simple polygon
- Title not available (Why is that?)
- CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"
- Online searching with turn cost
- Online searching with an autonomous robot
Cited In (6)
- Online searching with turn cost
- Competitive Searching for a Line on a Line Arrangement.
- Optimal strategies for maintaining a chain of relays between an explorer and a base camp
- Online searching with an autonomous robot
- Polygon exploration with time-discrete vision
- Wireless evacuation on \(m\) rays with \(k\) searchers
This page was built for publication: Online searching with an autonomous robot
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489019)