Walking in streets with minimal sensing

DOI10.1007/S10878-014-9791-4MaRDI QIDQ2355994zbMATH OpenOpenAlexFDO

Authors Azadeh Tabatabaei, Mohammad Ghodsi

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

zbMATH Keywords

competitive ratiocomputational geometryminimal sensingonline algorithmsrobotics

Mathematics Subject Classification ID

Data structures (68P05) Artificial intelligence for robotics (68T40) Combinatorial optimization (90C27)

Recommendations

• Walking in Streets with Minimal Sensing
• Walking streets faster
• scientific article; zbMATH DE number 176578
• Optimal on-line algorithms for walking with minimum number of turns in unknown streets
• Generalized streets revisited

Cites work

• An Optimal Competitive Strategy for Walking in Streets
• Computing optimal beams in two and three dimensions
• scientific article; zbMATH DE number 1003229 (Why is no real title available?)
• LR-visibility in polygons
• Optimal on-line algorithms for walking with minimum number of turns in unknown streets
• Reliable ad hoc routing based on mobility prediction
• Searching in the plane
• The Canadian Traveller Problem and its competitive analysis
• Visibility Algorithms in the Plane
• Walking an unknown street with bounded detour
• Walking in Streets with Minimal Sensing

Cited in

(4)

• Walking in Streets with Minimal Sensing
• Sensor beams, obstacles, and possible paths
• Navigation Without Perception of Coordinates and Distances
• Simple Robots in Polygonal Environments: A Hierarchy

This page was built for publication: Walking in streets with minimal sensing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355994)