Walking in streets with minimal sensing
From MaRDI portal
Publication:2355994
DOI10.1007/s10878-014-9791-4zbMath1319.90057OpenAlexW1976851719MaRDI QIDQ2355994
Mohammad Ghodsi, Azadeh Tabatabaei
Publication date: 28 July 2015
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-014-9791-4
Combinatorial optimization (90C27) Data structures (68P05) Artificial intelligence for robotics (68T40)
Cites Work
- Unnamed Item
- LR-visibility in polygons
- Searching in the plane
- Reliable ad hoc routing based on mobility prediction
- The Canadian Traveller Problem and its competitive analysis
- Walking an unknown street with bounded detour
- Optimal on-line algorithms for walking with minimum number of turns in unknown streets
- Computing optimal beams in two and three dimensions
- Walking in Streets with Minimal Sensing
- An Optimal Competitive Strategy for Walking in Streets
- Visibility Algorithms in the Plane