• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

Visibility-based pursuit-evasion with limited field of view. (2006)

Cached

  • Download as a PDF

Download Links

  • [www.aaai.org]
  • [www-2.cs.cmu.edu]
  • [www.ai.sri.com]
  • [www-2.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [robots.stanford.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www-2.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [pdf.aminer.org]
  • [ijr.sagepub.com]
  • [ai.stanford.edu]
  • [www.ai.sri.com]
  • [robotics.stanford.edu]
  • [www.ai.sri.com]
  • [robotics.stanford.edu]
  • [www.ai.sri.com]
  • [www.ai.sri.com]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Brian P Gerkey , Sebastian Thrun , Geoff Gordon , Brian P Gerkey , Sebastian , Geoff Thrus , Gordon
Venue:The International Journal of Robotics Research,
Citations:93 - 1 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Gerkey06visibility-basedpursuit-evasion,
    author = {Brian P Gerkey and Sebastian Thrun and Geoff Gordon and Brian P Gerkey and Sebastian and Geoff Thrus and Gordon},
    title = {Visibility-based pursuit-evasion with limited field of view.},
    journal = {The International Journal of Robotics Research,},
    year = {2006}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

Abstract We study a form of the pursuit-evasion problem, in which one or more searchers must move through a given environment so as to guarantee detection of any and all evaders, which can move arbitrarily fast. Our goal is to develop techniques for coordinating teams of robots to execute this task in application domains such as clearing a building, for reasons of security or safety. To this end, we introduce a new class of searcher, the φ-searcher, which can be readily instantiated as a physical mobile robot. We present a detailed analysis of the pursuit-evasion problem using φ-searchers. We show that computing the minimum number of φ-searchers required to search a given environment is NP-hard, and present the first complete search algorithm for a single φ-searcher. We show how this algorithm can be extended to handle multiple searchers, and give examples of computed trajectories.

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University