Skip to main content
Article thumbnail
Location of Repository

A cover-based approach to multi-agent moving target pursuit

By Alejandro Isaza, Jieshan Lu, Vadim Bulitko and Russell Greiner

Abstract

We explore the task of designing an efficient multi-agent system that is capable of capturing a single moving target, assuming that every agent knows the location of all agents on a fixed known graph. Many existing approaches are suboptimal as they do not coordinate multiple pursuers and are slow as they re-plan each time the target moves, which makes them fare poorly in real-time pursuit scenarios such as video games. We address these shortcomings by developing the concept of cover set, which leads to a measure that takes advantage of information about the position and speed of each agent. We first define cover set and then present an algorithm that uses cover to coordinate multiple pursuers. We compare the effectiveness of this algorithm against several classic and state-of-the-art pursuit algorithms, along several performance measures. We also compute the optimal pursuit policy for several small grids, and use the associated optimal scores as yardsticks for our analysis

Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.160.6075
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://ircl.cs.ualberta.ca/fil... (external link)
  • Suggested articles


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