How to learn an unknown environment. I: the rectilinear case
暂无分享,去创建一个
Xiaotie Deng | Christos H. Papadimitriou | Tiko Kameda | T. Kameda | C. Papadimitriou | Xiaotie Deng
[1] Simeon C. Ntafos,et al. Optimum watchman routes , 1986, SCG '86.
[2] P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .
[3] Yuval Rabani,et al. Lower Bounds for Randomized k-Server and Motion-Planning Algorithms , 1994, SIAM J. Comput..
[4] Yuval Rabani,et al. Lower bounds for randomized k-server and motion-planning algorithms , 1991, STOC '91.
[5] Xiaotie Deng,et al. Exploring an unknown graph , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[6] T. C. Shermer,et al. Recent results in art galleries (geometry) , 1992, Proc. IEEE.
[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[8] Wei-Pand Chin,et al. Shortest watchman routes in simple polygons , 1990, Discret. Comput. Geom..
[9] Baruch Schieber,et al. Navigating in Unfamiliar Geometric Terrain , 1997, SIAM J. Comput..
[10] Joseph G. Peters,et al. Smallest paths in simple rectilinear polygons , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[11] Xiaotie Deng,et al. How to learn an unknown environment , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[12] Maja J. Matarić,et al. A Distributed Model for Mobile Robot Environment-Learning and Navigation , 1990 .
[13] T. Shermer. Recent Results in Art Galleries , 1992 .
[14] Mihalis Yannakakis,et al. Shortest Paths Without a Map , 1989, Theor. Comput. Sci..
[15] J. O'Rourke. Art gallery theorems and algorithms , 1987 .
[16] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.