Skip to main content

A Simple Approach to Multi-Predator Multi-Prey Pursuit Domain

  • Conference paper
Unifying Themes in Complex Systems

Abstract

We present a different approach to a class of pursuit games: the Multi-Predator Multi-Prey domain. In the typical game, a group of predators tries to capture a group of prey, and all the agents have perfect knowledge of prey and predator positions. In our problem definition the prey-agent and the predator-agent have only local information provided by its vision range, each predator independently tries to capture a prey in a one-predator-one-prey-pair way. The predator-prey-pair capture is not known in advance and both predators and prey are moving in the environment. We show that simple greedy local predator rules are enough to capture all prey.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Balch, Tucker and Arkin, Ronald C. December 1998, Behavior-Based Formation Control for Multirobot Teams. IEEE Transactions on Robotics and Automation, Vol. 14, No. 6.

    Article  Google Scholar 

  2. M. Brenda, B. Jagannathan, and R. Dodhiawala, July 1986, On optimal cooperation of knowledge sources. Technical Report BCS-G2010, Boeing AI Center, Boeing Computer Services, Seattle, Wa.

    Google Scholar 

  3. Hackwood, S. and Beni, G. 1991, Self-Organizing sensors by deterministic annealing, IEEE IROS, 1177–1183.

    Google Scholar 

  4. Korf Richard E., February 1992, A Simple Solution to Pursuit Games, Proceedings of the 11th International Workshop on Distributed Artificial Intelligence, Glen Arbor, Michigan.

    Google Scholar 

  5. Parker, Lynne E. 2002, Distributed Algorithms for Multi-Robot Observation of Multiple Moving Targets, Autonomous Robots, 12, 3, 2002

    Google Scholar 

  6. Stephens, L. and M. Merx, Sept. 1989, Agent organization as an effector of DAI system performance, Proceedings of the Ninth Workshop on Distributed Artificial Intelligence, Eastsound, Washington, pp. 263–292.

    Google Scholar 

  7. Stephens, L. and M. Merx, October 1990, The effect on agent control strategy on the performance of a DAI pursuit problem, Proceedings of the 10th International Workshop on Distributed Artificial Intelligence, Bandera, Texas.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alcazar, J.A. (2011). A Simple Approach to Multi-Predator Multi-Prey Pursuit Domain. In: Minai, A.A., Braha, D., Bar-Yam, Y. (eds) Unifying Themes in Complex Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17635-7_1

Download citation

Publish with us

Policies and ethics