ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
Exploring unknown environments with obstacles
Full text PdfPdf (253 KB)
Source Symposium on Discrete Algorithms archive
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms table of contents
Baltimore, Maryland, United States
Pages: 842 - 843  
Year of Publication: 1999
ISBN:0-89871-434-6
Authors
Susanne Albers  Max-Planck-Institut für Informatik, Im Stadtwaid, D-66123 Saarbrücken, Germany
Klaus Kursawe  Max-Planck-Institut für Informatik, Im Stadtwaid, D-66123 Saarbrücken, Germany
Sven Schuierer  Institut für Informatik, Am Flughfen 17, Geb. 051, D-79110 Freiburg, Germany
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM : Society for Industrial and Applied Mathematics
Publisher
Society for Industrial and Applied Mathematics  Philadelphia, PA, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 25,   Citation Count: 3
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
Margrit Betke , Ronald L. Rivest , Mona Singh, Piecemeal learning of an unknown environment, Proceedings of the sixth annual conference on Computational learning theory, p.277-286, July 26-28, 1993, Santa Cruz, California, United States  [doi>10.1145/168304.168352]
2
Xiaotie Deng , Tiko Kameda , Christos Papadimitriou, How to learn an unknown environment. I: the rectilinear case, Journal of the ACM (JACM), v.45 n.2, p.215-245, March 1998  [doi>10.1145/274787.274788]

CITED BY  3
Esther M. Arkin , Michael A. Bender , Dongdong Ge, Improved approximation algorithms for the freeze-tag problem, Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures, June 07-09, 2003, San Diego, California, USA
Sándor P. Fekete , Rolf Klein , Andreas Nüchter, Online searching with an autonomous robot, Computational Geometry: Theory and Applications, v.34 n.2, p.102-115, May 2006
Ettore Ferranti , Niki Trigoni , Mark Levene, Rapid exploration of unknown areas through dynamic deployment of mobile and stationary sensor nodes, Autonomous Agents and Multi-Agent Systems, v.19 n.2, p.210-243, October 2009

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS

Additional Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.2 Modes of Computation
          Subjects: Online computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Geometrical problems and computations; Computations on discrete structures

  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE


General Terms:
Algorithms, Design, Performance, Theory

Collaborative Colleagues:
Susanne Albers: colleagues
Klaus Kursawe: colleagues
Sven Schuierer: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player