How to learn an unknown environment
- 9 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 298-303
- https://doi.org/10.1109/sfcs.1991.185382
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Exploring an unknown graphPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- External watchman routesThe Visual Computer, 1994
- Shortest watchman routes in simple polygonsDiscrete & Computational Geometry, 1991
- Navigating in unfamiliar geometric terrainPublished by Association for Computing Machinery (ACM) ,1991
- Lower bounds for randomized k-server and motion-planning algorithmsPublished by Association for Computing Machinery (ACM) ,1991
- Optimum watchman routesInformation Processing Letters, 1988
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985