Abstract
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.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Awerbuch, Baruch, Margrit Betke, Ronald L. Rivest, & Mona Singh. (1994). How to do BFS without teleportation. In preparation.
Bar-Eli, E., Berman, P., Fiat, A., & Yan., P. (1992). On-line Navigation in a Room, Symposium on Discrete Algorithms, pp. 237–249.
Betke, Margrit. (1992). Algorithms for Exploring an Unknown Graph. MIT Laboratory for Computer Science. Technical Report MIT/LCS/TR-536.
Blum, Avrim, Prabhakar Raghavan, & Baruch Schieber. (1991). Navigating in Unfamiliar Geometric Terrain, Proceedings of Twenty-Third ACM Symposium on Theory of Computing, ACM, pp. 494–504.
Cormen, Thomas H., Charles E. Leiserson, & Ronald L. Rivest. (1990). Introduction to Algorithms, MIT Press/McGraw-Hill.
Deng, Xiaotie, Tiko Kameda, & Christos H. Papadimitriou. (1991). How to learn an unknown environment, Proceedings of the 32nd Symposium on Foundations of Computer Science, IEEE, pp. 298–303
Deng, Xiaotie & Christos H. Papadimitriou. (1990). Exploring an Unknown Graph, Proceedings of the 31st Symposium on Foundations of Computer Science, pp. 355–361.
Edmonds, Jack & Ellis L. Johnson. (1973). Matching, Euler Tours and the Chinese Postman, Mathematical Programming, 5, pp. 88–124.
Papadimitriou, Christos H. (1976). On the complexity of edge traversing, J. Assoc. Comp. Mach., 23, pp. 544–554.
Papadimitriou, Christos H. & M. Yanakakis. (1991). Shortest paths without a map, Theoretical Computer Science, 84, pp. 127–150.
Rao, Nagewara S.V., Srikumar Kareti, Weimin Shi, & S. Sitharama Iyengar. (1993). Robot Navigation in Unknown Terrains: Introductory Survey of Non-Heuristic Algorithms, Oak Ridge National Laboratory, ORNL/TM-12410.
Rivest, Ronald L. & Robert E. Schapire. (1989). Inference of Finite Automata using Homing Sequences, Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, ACM, Seattle, Washington, pp. 411–420.
Rights and permissions
About this article
Cite this article
Betke, M., Rivest, R.L. & Singh, M. Piecemeal Learning of an Unknown Environment. Machine Learning 18, 231–254 (1995). https://doi.org/10.1023/A:1022803514157
Issue Date:
DOI: https://doi.org/10.1023/A:1022803514157