Skip to main content

Abstract

In this paper, we consider multiagent planning with joint actions––that refer to the same action being performed concurrently by a group of agents. There are few works that study specification of joint actions by extending PDDL. Since there are no multiagent planners that can handle joint actions, we propose a multiagent planning algorithm, which is capable of handling joint actions. In a multiagent setting, each agent has a different capability. The proposed algorithm obtains the number of agents involved in a joint action based on the capability of the individual agents. We have implemented our algorithm and compared its efficiency with some state-of-the-art classical planners. The results show that when the problem size increases, our algorithm can solve such problems whereas it cannot be solved by the classical planners.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

References

  1. Parker, L.E.: Distributed intelligence: overview of the field and its application to multi-robot systems. J. Phys. Agents 2(1), 5–14 (2008)

    Google Scholar 

  2. Marcello C., Pecora F., Andreasson, H., Uras, T., Koenig, S.: Integrated motion planning and coordination for industrial vehicles. In: Proceedings of International Conference on Automated Planning and Scheduling (ICAPS) (2014)

    Google Scholar 

  3. Sara B., Fox, M., Long, D.: Planning the behaviour of low-cost quadcopters for surveillance missions. In: Proceedings of International Conference on Automated Planning and Scheduling (ICAPS) (2014)

    Google Scholar 

  4. Wu, F., Zilberstein, S., Chen, X.: Online planning for multi-agent systems with bounded communication. Artif. Intell. 175, 487–511 (2011)

    Google Scholar 

  5. Brenner, M., Nebel, B.: Continual planning and acting in dynamic multi-agent environments. In: Proceedings of Autonomous Agent Multi-agent System, pp. 297–331 (2009)

    Google Scholar 

  6. Bowling, M., Jensen, R., Veloso, M.: A formalization of equilibria for multi agent planning, In: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), pp. 1460–1462 (2003)

    Google Scholar 

  7. Brafman, R.I., Domshlak, C.: From one to many: planning for loosely coupled multi-agent systems, In: Proceedings of International Conference on Automated Planning and Scheduling (ICAPS), pp. 28–35 (2008)

    Google Scholar 

  8. Ephrati, E., Rrosenschein, J.S.: Divide and conquer in multi-agent planning. In: Proceedings of the Twelfth National Conference on Artificial Intelligence, pp. 375–380 (1994)

    Google Scholar 

  9. Torreño, A., Onaindia E., ÓscarSapena: FMAP: distributed cooperative multi-agent planning. Appl. Intell. 41, 606–626 (2014)

    Google Scholar 

  10. Larbi, R.B., Konieczny, S., Marquis, P.: Extending classical planning to the multi-agent case: a game-theoretic approach. In: ECSQARU. Lecture Notes in Computer Science, vol. 4724, pp. 731–742. Springer (2007)

    Google Scholar 

  11. Boutilier, C., Brafman, R.I.: Planning with concurrent interacting actions. J. Artif. Intell. Res. (JAIR), 14, 105–136 (2001)

    Google Scholar 

  12. Fox, M., Long, D.: PDDL2.1: an extension to PDDL for expressing temporal planning domains. J. Artif. Intell. Res. (JAIR) 20, 61–124 (2003)

    Google Scholar 

  13. Brafman, R.I., Zoran, U.: Distributed heuristic forward search for multi-agent system. In: Proceedings of 2nd Distributed and Multi-agent Planning Workshop (ICAPS DMAP), pp. 1–7 (2014)

    Google Scholar 

  14. Hoffmann, J., Nebel, B.: The FF planning system: fast plan generation through heuristic search. J.Artif. Intell. Res. (JAIR) 14, 253–302 (2001)

    Google Scholar 

  15. Kautz, H., Selman, B.: BLACKBOX: a new approach to the application of theorem proving to problem solving. In: AIPS98 Workshop on Planning as Combinatorial Search (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Satyendra Singh Chouhan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer India

About this paper

Cite this paper

Chouhan, S.S., Niyogi, R. (2016). A Multiagent Planning Algorithm with Joint Actions. In: Das, S., Pal, T., Kar, S., Satapathy, S., Mandal, J. (eds) Proceedings of the 4th International Conference on Frontiers in Intelligent Computing: Theory and Applications (FICTA) 2015. Advances in Intelligent Systems and Computing, vol 404. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2695-6_59

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2695-6_59

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2693-2

  • Online ISBN: 978-81-322-2695-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics