Piecemeal Learning of an Unknown Environment

We introduce a new learning problem: learning a graph by piecemeal search, in which the learner must return every so often to its starting point (for refueling, say). We present two linear-time piecemeal-search algorithms for learning city-block graphs: grid graphs with rectangular obstacles.

[1]  Jack Edmonds,et al.  Matching, Euler tours and the Chinese postman , 1973, Math. Program..

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

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

[4]  Ronald L. Rivest,et al.  Inference of finite automata using homing sequences , 1989, STOC '89.

[5]  Margrit Betke.  ALGORITHMS FOR EXPLORING AN UNKNOWN GRAPH , 1992 .

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

[7]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

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

[9]  Amos Fiat,et al.  Online Navigation in a Room , 1992, J. Algorithms.

[10]  Christos H. Papadimitriou,et al.  On the complexity of edge traversing , 1976, J. ACM.