Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

Click here to sign up for SAGE Journal Email Alerts today!

Sign In to gain access to subscriptions and/or personal tools.
The International Journal of Robotics Research
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to Saved Citations
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow Request Reprints
Right arrow Add to My Marked Citations
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via ISI Web of Science (2)
Right arrow Citing Articles via Google Scholar
Right arrow Citing Articles via Scopus
Google Scholar
Right arrow Articles by Gerkey, B. P.
Right arrow Articles by Gordon, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati  
What's this?

Visibility-based Pursuit-evasion with Limited Field of View

Brian P. Gerkey

Artificial Intelligence Center, SRI International gerkey{at}ai.sri.com

Sebastian Thrun

Artificial Intelligence Lab, Stanford University thrun{at}stanford.edu

Geoff Gordon

Center for Automated Learning and Discovery Carnegie Mellon University ggordon+{at}cs.cmu.edu

We study the visibility-based 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 {phi}-searcher, which can be readily instantiated as a physical mobile robot. We present a detailed analysis of the pursuit-evasion problem using {phi}-searchers. We present the first complete search algorithm for a single {phi}-searcher, show how this algorithm can be extended to handle multiple searchers, and give examples of computed trajectories.

Key Words: pursuit-evasion • computational geometry • exact cell decomposition path-planning

The International Journal of Robotics Research, Vol. 25, No. 4, 299-315 (2006)
DOI: 10.1177/0278364906065023
Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati    What's this?


This article has been cited by other articles:


Home page
 The International Journal of Robotics ResearchHome page
G. Hollinger, S. Singh, J. Djugash, and A. Kehagias
Efficient Multi-robot Search for a Moving Target
The International Journal of Robotics Research, February 1, 2009; 28(2): 201 - 219.
[Abstract] [PDF]

Home page
 The International Journal of Robotics ResearchHome page
A. Kolling and S. Carpin
Cooperative Observation of Multiple Moving Targets: an algorithm and its formalization
The International Journal of Robotics Research, September 1, 2007; 26(9): 935 - 953.
[Abstract] [PDF]