TY - GEN
T1 - On-line navigation in a room
AU - Bar-Eli, E.
AU - Berman, Piotr
AU - Fiat, A.
AU - Yan, Peiyuan
PY - 1992/9/1
Y1 - 1992/9/1
N2 - We consider the problem of navigating through an unknown environment in which the obstacles are disjoint oriented rectangles enclosed in an n × n square room. The task of a navigating algorithm is to reach the center of the room starting from one of the corners. While there always exists a path of length n, the best previously known navigating algorithm finds paths of length n2O(√in n). We give an efficient deterministic algorithm which finds a path of length O(n In n); this algorithm uses tactile information only. Moreover, we prove that any deterministic algorithm can be forced to traverse a distance of Ω(n In n), even if it uses visual information.
AB - We consider the problem of navigating through an unknown environment in which the obstacles are disjoint oriented rectangles enclosed in an n × n square room. The task of a navigating algorithm is to reach the center of the room starting from one of the corners. While there always exists a path of length n, the best previously known navigating algorithm finds paths of length n2O(√in n). We give an efficient deterministic algorithm which finds a path of length O(n In n); this algorithm uses tactile information only. Moreover, we prove that any deterministic algorithm can be forced to traverse a distance of Ω(n In n), even if it uses visual information.
UR - http://www.scopus.com/inward/record.url?scp=84923094397&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84923094397&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:84923094397
T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
SP - 237
EP - 249
BT - Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992
PB - Association for Computing Machinery
T2 - 3rd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA 1992
Y2 - 27 January 1992 through 29 January 1992
ER -