Skip to main content

Multi-agent Pursuit-Evasion Algorithm Based on Contract Net Interaction Protocol

  • Conference paper
Book cover Advances in Natural Computation (ICNC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3612))

Included in the following conference series:

Abstract

The motivation is the deployment of large numbers of inexpensive robots in hostile environments to pursue evasive targets. Based on the interaction protocols of contract net and subscribe-publish, a distributive pursuit-evasion algorithm is proposed for multi-agents to pursue multiple evasive agents. The pursuit agents engaged in teams adopt a tail-chase strategy while the rest pursuit agents use a hug-a-tree policy. The evading agents move towards directions with fewer pursuit agents in their neighborhood. All agents communicate according to the subscribe-publish protocol and the pursuit agents coordinate their acts through the contract net protocol. The result of simulation under JADE platform shows that the pursuit agents can dynamically form several teams to catch respective evaders efficiently without centralized leadership or hierarchical coordination. Distributive in nature, it allows a large-scale agent fleet to perform complex tasks in a coordinated way.

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 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

References

  1. Goldsmith, S.Y., Robinett III, R.: Collective Search by Mobile Robots using Alpha-Beta Coordination (1998), Internet http://www.aisl.sandia.gov/papers

  2. Chudnovsky, D.V., Chudnovsky, G.V.: Search Theory: Some Recent Developments. Marcel Dekker, New York (1989)

    MATH  Google Scholar 

  3. Ko, J., Mahajan, A., Sengupta, R.: A Network-Centric UAV Organization for Search and Pursuit Operations. In: Aerospace Conference Proceedings, vol. 6, pp. 2697–2713. IEEE, New York (2002)

    Chapter  Google Scholar 

  4. Liu, J., Jin, X., Zhang, S., Wu, J.: Multi-Agent Systems: Models and Experimentation. Tsinghua University Press, Beijing (2003)

    Google Scholar 

  5. Hespanha, J., Prandini, M., Sastry, S.: Probabilistic Pursuit-evasion Games: a One-step Nash Approach. In: Proceedings of the 39th IEEE Conference on Decision and Control, vol. 3, pp. 2272–2277. IEEE, New York (2000)

    Google Scholar 

  6. Vidal, R., Shakernia, O., Kim, H.J., Shim, D.H., Sastry, S.: Probabilistic Pursuit-evasion Games: Theory, Implementation, and Experimental Evaluation. IEEE Transactions on Robotics and Automation 18(5), 662–669 (2002)

    Article  Google Scholar 

  7. Internet, http://www.fipa.org/specs/fipa00029/SC00029H.html

  8. Bellifemine, F., Caire, G., Trucco, T., Rimassa, G.: JADE Programmer’s Guide (2004), Internet, http://jade.cselt.it

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, YC., Qi, H., Wang, SS. (2005). Multi-agent Pursuit-Evasion Algorithm Based on Contract Net Interaction Protocol. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_59

Download citation

  • DOI: https://doi.org/10.1007/11539902_59

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28320-1

  • Online ISBN: 978-3-540-31863-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics