Skip to main content

An AI Planning-Based Approach to the Multi-Agent Plan Recognition Problem

  • Conference paper
  • First Online:
Advances in Artificial Intelligence (Canadian AI 2018)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10832))

Included in the following conference series:

Abstract

Multi-Agent Plan Recognition (MAPR) is the problem of inferring the goals and plans of multiple agents given a set of observations. While previous MAPR approaches have largely focused on recognizing team structures and behaviors, given perfect and complete observations, in this paper, we address potentially unreliable observations and temporal actions. We propose a multi-step compilation technique that enables the use of AI planning for the computation of the probability distributions of plans and goals, given observations. We present results of an experimental evaluation on a novel set of benchmarks, using several temporal and diverse planners.

M. Shvo—The work was performed during an internship at IBM.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Schmidt, C.F., Sridharan, N., Goodson, J.L.: The plan recognition problem: an intersection of psychology and artificial intelligence. AIJ 11(1–2), 45–83 (1978)

    Google Scholar 

  2. Banerjee, B., Lyle, J., Kraemer, L.: Multi-agent plan recognition: formalization and algorithms. In: AAAI (2010)

    Google Scholar 

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

    MATH  Google Scholar 

  4. Ramírez, M., Geffner, H.: Probabilistic plan recognition using off-the-shelf classical planners. In: AAAI (2010)

    Google Scholar 

  5. Sohrabi, S., Riabov, A., Udrea, O.: Plan recognition as planning revisited. In: IJCAI (2016)

    Google Scholar 

  6. Shvo, M., Sohrabi, S., McIlraith, S.A.: An AI planning-based approach to the multi-agent plan recognition problem (extended version). Technical report CSRG-636, Department of Computer Science, University of Toronto, February 2018

    Google Scholar 

  7. Gerevini, A., Saetti, A., Serina, I.: LPG-TD: a fully automated planner for PDDL 2.2 domains. In: ICAPS (2004)

    Google Scholar 

  8. Nguyen, T.A., Do, M.B., Gerevini, A., Serina, I., Srivastava, B., Kambhampati, S.: Generating diverse plans to handle unknown and partially known user preferences. AIJ 190, 1–31 (2012)

    MathSciNet  Google Scholar 

Download references

Acknowledgments

The authors gratefully acknowledge funding from IBM and the Natural Sciences and Engineering Research Council of Canada (NSERC).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maayan Shvo .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Shvo, M., Sohrabi, S., McIlraith, S.A. (2018). An AI Planning-Based Approach to the Multi-Agent Plan Recognition Problem. In: Bagheri, E., Cheung, J. (eds) Advances in Artificial Intelligence. Canadian AI 2018. Lecture Notes in Computer Science(), vol 10832. Springer, Cham. https://doi.org/10.1007/978-3-319-89656-4_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-89656-4_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-89655-7

  • Online ISBN: 978-3-319-89656-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics