Walking streets faster
From MaRDI portal
Recommendations
Cites work
- AN ON-LINE ALGORITHM FOR NAVIGATING IN AN UNKNOWN ENVIRONMENT
- Efficient strategies for robot navigation in unknown environment
- Going home through an unknown street
- How to learn an unknown environment. I
- scientific article; zbMATH DE number 1003229 (Why is no real title available?)
- scientific article; zbMATH DE number 3196686 (Why is no real title available?)
- Searching in the plane
- Shortest paths without a map
- Walking an unknown street with bounded detour
Cited in
(12)- Walking an unknown street with bounded detour
- Walking in streets with minimal sensing
- Line-of-sight rendezvous
- scientific article; zbMATH DE number 1617273 (Why is no real title available?)
- Walking in Streets with Minimal Sensing
- scientific article; zbMATH DE number 2185606 (Why is no real title available?)
- scientific article; zbMATH DE number 176578 (Why is no real title available?)
- Online algorithms for searching and exploration in the plane
- Position-independent near optimal searching and on-line recognition in star polygons
- Competitive searching in polygons—Beyond generalised streets
- Multiple shooting approach for finding approximately shortest paths for autonomous robots in unknown environments in 2D
- On-line path planning in an unknown polygonal environment
This page was built for publication: Walking streets faster
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5054825)