Navigating in unfamiliar geometric terrain
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Lower bounds for randomized k-server and motion-planning algorithms
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Competitive algorithms for layered graph traversal
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
How to learn an unknown environment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Walking an unknown street with bounded detour
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Piecemeal learning of an unknown environment
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Piecemeal graph exploration by a mobile robot (extended abstract)
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Robot navigation with range queries
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Exploring unknown environments
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The power of a pebble: exploring and mapping directed graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Randomized robot navigation algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On-line search in a simple polygon
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Exploring unknown undirected graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Optimal constrained graph exploration
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Exploring an Unknown Polygonal Environment with Bounded Visibility
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
An Online Algorithm for the Postman Problem with a Small Penalty
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
| Hi-index | 0.01 |
We consider the problem of navigating through an unknownenvironment in which the obstacles are disjoint oriented rectanglesenclosed in an n xn square room. The task of navigatingalgorithm is to reach the center of the room starting from one of thecorners. While there always exists a path of lengthn, the best previously knownnavigating algorithm finds paths of length n201nn. We give an efficient deterministicalgorithm which finds a path of lengthO(nln n); this algorithm uses tactileinformation only. Moreover, we prove that any deterministic algorithmcan be forced to traverse a distance of&OHgr;(n lnn), even if it uses visualinformation.