On-line Searching and Navigation

[1]  Rolf Klein,et al.  The polygon exploration problem: a new strategy and a new analysis technique , 1998 .

[2]  Susanne Albers,et al.  Exploring unknown environments , 1997, STOC '97.

[3]  Andrew Tomkins,et al.  A polylog(n)-competitive algorithm for metrical task systems , 1997, STOC '97.

[4]  Rolf Klein,et al.  A competitive strategy for learning a polygon , 1997, SODA '97.

[5]  Leonidas J. Guibas,et al.  The Robot Localization Problem , 1995, SIAM J. Comput..

[6]  Alejandro López-Ortiz,et al.  Generalized Streets Revisited , 1996, ESA.

[7]  Jeffery R. Westbrook,et al.  Robot navigation with range queries , 1996, STOC '96.

[8]  Amos Fiat,et al.  Randomized robot navigation algorithms , 1996, SODA '96.

[9]  Amitava Datta,et al.  Competitive Searching in Polygons - Beyond Generalised Streets , 1995, ISAAC.

[10]  Rolf Klein,et al.  Searching for the kernel of a polygon—a competitive strategy , 1995, SCG '95.

[11]  Gregory Dudek,et al.  Localizing a robot with minimum travel , 1995, SODA '95.

[12]  Jon M. Kleinberg,et al.  The localization problem for mobile robots , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[13]  Michael A. Bender,et al.  The power of team exploration: two robots can learn unlabeled directed graphs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[14]  Yoshihide Igarashi,et al.  An Efficient Strategy for Robot Navigation in Unknown Environment , 1994, Inf. Process. Lett..

[15]  Yoshihide Igarashi,et al.  Efficient Strategies for Robot Navigation in Unknown Environment , 1994, ICALP.

[16]  Amitava Datta,et al.  Competitive searching in a generalized street , 1994, SCG '94.

[17]  Jon M. Kleinberg,et al.  On-line search in a simple polygon , 1994, SODA '94.

[18]  Ming-Yang Kao,et al.  Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem , 1996, SODA '93.

[19]  Avrim Blum,et al.  An on-line algorithm for improving performance in navigation , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[20]  Ricardo A. Baeza-Yates,et al.  Searching in the Plane , 1993, Inf. Comput..

[21]  Bala Kalyanasundaram,et al.  Constructing Competitive Tours from Local Information , 1993, Theor. Comput. Sci..

[22]  H. Ramesh,et al.  On traversing layered graphs on-line , 1993, SODA '93.

[23]  Leonidas J. Guibas,et al.  The robot localization problem in two dimensions , 1992, SODA '92.

[24]  Amos Fiat,et al.  On-Line Navigation in a Room , 1992, SODA.

[25]  Xiaotie Deng,et al.  How to learn an unknown environment , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[26]  Yuval Rabani,et al.  Competitive algorithms for layered graph traversal , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[27]  Rolf Klein,et al.  Walking an unknown street with bounded detour , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[28]  Yuval Rabani,et al.  Lower bounds for randomized k-server and motion-planning algorithms , 1991, STOC '91.

[29]  Baruch Schieber,et al.  Navigating in unfamiliar geometric terrain , 1991, STOC '91.

[30]  Xiaotie Deng,et al.  Exploring an unknown graph , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[31]  C. N. Shen,et al.  Autonomous navigation to provide long-distance surface traverses for Mars Rover Sample Return Mission , 1989, Proceedings. IEEE International Symposium on Intelligent Control 1989.

[32]  Mihalis Yannakakis,et al.  Shortest Paths Without a Map , 1989, Theor. Comput. Sci..

[33]  V. Lumelsky,et al.  Dynamic path planning for a mobile automaton with limited information on the environment , 1986 .