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
Online dispersion algorithms for swarms of robots
Full text PdfPdf (325 KB)
Source Annual Symposium on Computational Geometry archive
Proceedings of the nineteenth annual symposium on Computational geometry table of contents
San Diego, California, USA
SESSION: Video and multimedia session table of contents
Pages: 382 - 383  
Year of Publication: 2003
ISBN:1-58113-663-3
Authors
Tien-Ruey Hsiang  Stony Brook University, Stony Brook, NY
Esther M. Arkin  Stony Brook University, Stony Brook, NY
Michael A. Bender  Stony Brook University, Stony Brook, NY
Sandor Fekete  Braunschweig University, Germany
Joseph S. B. Mitchell  Stony Brook University, Stony Brook, NY
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 28,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/777792.777854
What is a DOI?

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
D. Gage. Sensor abstractions to support many-robot systems. In Proc. of SPIE Mobile Robots VII, Boston, Vol. 1831, pages 235--246, 1992.
 
2
T.-R. Hsiang, E. M. Arkin, M. Bender, S. P. Fekete, and J. S. B. Mitchell. Algorithms for rapidly dispersing robot swarms in unknown environments. 5th International Workshop on Algorithmic Foundations of Robotics, 2002.
 
3
David Payton , Mike Daily , Regina Estowski , Mike Howard , Craig Lee, Pheromone Robotics, Autonomous Robots, v.11 n.3, p.319-324, November 2001  [doi>10.1023/A:1012411712038 ]

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Geometrical problems and computations

Additional Classification:
  F. Theory of Computation
  F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
      F.2.2 Nonnumerical Algorithms and Problems
          Subjects: Sequencing and scheduling

  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
        I.2.11 Distributed Artificial Intelligence
            Subjects: Intelligent agents; Multiagent systems
      I.2.9 Robotics
          Subjects: Autonomous vehicles


General Terms:
Algorithms, Experimentation


Keywords:
NP-hardness, approximation algorithms, swarm robotics

Collaborative Colleagues:
Tien-Ruey Hsiang: colleagues
Esther M. Arkin: colleagues
Michael A. Bender: colleagues
Sandor Fekete: colleagues
Joseph S. B. Mitchell: colleagues

Peer to Peer - Readers of this Article have also read:

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

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player