Recommendations
Cites work
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 1305480 (Why is no real title available?)
- AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES
- CORRIGENDUM TO "AN INCREMENTAL ALGORITHM FOR CONSTRUCTING SHORTEST WATCHMAN ROUTES"
- 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
Cited in
(6)- Optimal strategies for maintaining a chain of relays between an explorer and a base camp
- Online searching with turn cost
- Polygon exploration with time-discrete vision
- Online searching with an autonomous robot
- Wireless evacuation on \(m\) rays with \(k\) searchers
- Competitive Searching for a Line on a Line Arrangement.
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)