Skip to main content
Article thumbnail
Location of Repository

ACC 2007, Submitted Cooperative Pursuit with Sensing Limitations

By Shaunak D. Bopardikar, Francesco Bullo and João Hespanha

Abstract

Abstract — We address a discrete-time pursuit-evasion problem involving multiple pursuers and a single evader in an unbounded, planar environment in which each player has limited-range sensing. The evader appears at a random location in a bounded region and moves only when sensed. We propose a sweep-pursuit-capture strategy for a group of at least three pursuers and determine a lower bound on the probability of capture for the evader. This bound is a function of the pursuer formation and independent of the initial evader’s spatial distribution and the evader strategy. We also provide an upper bound on the time for our pursuit strategy to succeed. These results show that on the basis of maximizing the probability of evader capture per pursuer, the pursuers should search the bounded region as a single group (conjoin) rather than to divide the region into smaller parts and search simultaneously in smaller groups (allocate). I

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.1404
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://motion.me.ucsb.edu/pdf/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.