How to learn an unknown environment
暂无分享,去创建一个
Xiaotie Deng | Christos H. Papadimitriou | Tiko Kameda | T. Kameda | C. Papadimitriou | Xiaotie Deng
[1] Mihalis Yannakakis,et al. Shortest Paths Without a Map , 1989, Theor. Comput. Sci..
[2] Simeon C. Ntafos,et al. Optimum Watchman Routes , 1988, Inf. Process. Lett..
[3] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[4] Baruch Schieber,et al. Navigating in unfamiliar geometric terrain , 1991, STOC '91.
[5] Yuval Rabani,et al. Lower bounds for randomized k-server and motion-planning algorithms , 1991, STOC '91.
[6] Xiaotie Deng,et al. Exploring an unknown graph , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[7] Wei-Pand Chin,et al. Shortest watchman routes in simple polygons , 1990, Discret. Comput. Geom..
[8] T. Shermer. Recent Results in Art Galleries , 1992 .