How to Learn an Unknown Environment I: The Rectilinear Case

Journal of the ACM

Volumn 45, Issue 2, 1998, Pages 215-245

  Deng, Xiaotie ^a   Kameda, Tiko ^b   Papadimitriou, Christos ^c  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b SIMON FRASER UNIVERSITY   (Canada)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Algorithms; Competitive algorithms; Computational geometry; F.2.2 Analysis of Algorithms and Problem Complexity : Nonnumerical Algorithms and Problems; Gallery tour; L1 metric; On line algorithms; Polygon with obstacles; Shortest path; Theory

Indexed keywords

COLLISION AVOIDANCE; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; MOTION PLANNING; POLYNOMIALS; PROBLEM SOLVING; ROBOTICS;

COMPETITIVE ALGORITHMS; RECTILINEAR POLYGONS;

LEARNING ALGORITHMS;

EID: 0032026129     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/274787.274788     Document Type: Article

References (15)

1. BLUM, A., RAGHAVAN, P., AND SCHIEBER, B. 1997. Navigating in unfamiliar geometric terrain. SIAM J. Comput. 26, 110-137.
2. CHIN, W., AND NTAFOS, S. 1988. Optimum watchman routes. Inf. Proc. Lett. 28 39-44.
3. CHIN, W., AND NTAFOS, S. 1991. Shortest watchman routes in simple polygons. Discr. Comput. Geom. 9, 9-31.
4. DENG, X., KAMEDA, T., AND PAPADIMITRIOU, C.H. 1991. How to learn an unknown environment. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 298-303.
5. DENG, X., AND PAPADIMITRIOU, C.H. 1990. Exploring an unknown graph. In Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 355-361.
6. GAREY, M.R., AND JOHNSON, D.S. 1979. Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman and Company, San Francisco, Calif.
7. JOHNSON, D.S., AND PAPADIMITRIOU, C.H. 1985. Computational complexity. In The Traveling Salesman Problem. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, eds., pp. 37-85.
8. KARLIN, A.R., MANASSE, M.S., RUDOLPH, L., AND SLEATOR, D.D. 1988. Competitive snoopy caching. Algorithmica 3, 79-119.
9. KARLOFF, H., RABANI, Y., AND RAVID, Y. 1994. Lower bounds for randomized k-server and motion-planning algorithms. SIAM J. Comput. 23, 293-312.
10. MATARIC, M.J. 1990. A distributed model for mobile robot environment-learning and navigation. Tech. Rep. #1228. MIT AI Laboratory, Cambridge, Mass.
11. MCDONALD, K.M., AND PETERS, J.G. 1992. Smallest paths in simple rectilinear polygons. IEEE Trans. CAD/ICAS 11, 7 (July), 864-875.
12. O'ROURKE, J. 1987. Art Gallery Theorems and Algorithms. Oxford University Press, Oxford, England.
13. PAPADIMITRIOU, C., AND YANNAKAKIS, M. 1991. Shortest paths without a map. Theoret. Comput. Sci. 84, 127-150.
14. SHERMER, T. 1992. Recent results in art galleries. Proc. IEEE 80, 9 (Sept.), 1384-1399.
15. SLEATOR, D.D., AND TARJAN, R.E. 1985. Amortized efficiency of list update and paging rules. Commun. ACM 28, 2 (Feb.), 202-208.