Skip to main content

A Heuristic Agent in Multi-Agent Path Finding Under Destination Uncertainty

  • Conference paper
  • First Online:
  • 1164 Accesses

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

Abstract

Humans are capable of recognizing intentions by solely observing another agent’s actions. Hence, in a cooperative planning task, i.e., where all agents aim for all other agents to reach their respective goals, to some extend communication or a central planning instance are not necessary. In epistemic planning a recent research line investigates multi-agent planning problems (MAPF) with goal uncertainty. In this paper, we propose and analyze a round-based variation of this problem, where each agent moves or waits in each round. We show that simple heuristics from cognition can outperform in some cases an adapted formal approach on computation time and solve some new instances in some cases. Implications are discussed.

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

Buying options

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

Learn about institutional subscriptions

Notes

  1. 1.

    The implementation and a more in-depth explanation of the benchmark set and generated data can be found at: https://github.com/Grintel/Cognitive-MAPFDU.

References

  1. Baker, C., Tenenbaum, J.: Modeling human plan recognition using Bayesian theory of mind. In: Sukthankar, G., Geib, C., Bui, H.H., Pynadath, D.V., Goldman, R.P. (eds.) Plan, Activity, and Intent Recognition: Theory and Practice, vol. 7, pp. 177–204. Elsevier (2014). https://doi.org/10.1016/B978-0-12-398532-3.00007-5

  2. Bolander, T., Engesser, T., Mattmüller, R., Nebel, B.: Better eager than lazy? How agent types impact the successfulness of implicit coordination. In: Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference (KR-2018), pp. 445–453 (2018). https://aaai.org/ocs/index.php/KR/KR18/paper/view/18070

  3. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269–271 (1959). https://doi.org/10.1007/BF01386390

    Article  MathSciNet  MATH  Google Scholar 

  4. Gigerenzer, G., Todd, P.M.: Simple Heuristics that Make us Smart. Oxford University Press, Oxford (1999)

    Google Scholar 

  5. Hatzack, W., Nebel, B.: Solving the operational traffic control problem. In: Cesta, A. (ed.) Proceedings of the 6th European Conference on Planning (ECP-01), pp. 37–48. AAAI Press (2013). https://www.aaai.org/ocs/index.php/ECP/ECP01/paper/view/7284

  6. Hönig, W., et al.: Multi-agent path finding with kinematic constraints. In: Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS-2016), pp. 477–485 (2016). http://www.aaai.org/ocs/index.php/ICAPS/ICAPS16/paper/view/13183

  7. Ma, H., Li, J., Kumar, T.S., Koenig, S.: Lifelong multi-agent path finding for online pickup and delivery tasks. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems (AAMAS-2017), pp. 837–845 (2017). http://dl.acm.org/citation.cfm?id=3091243

  8. Nebel, B.: Some thoughts on forward induction in multi-agent-path finding under destination uncertainty. In: Description Logic, Theory Combination, and All That - Essays Dedicated to Franz Baader on the Occasion of His 60th Birthday, pp. 431–440. Springer, Heidelberg (2019). https://doi.org/10.1007/978-3-030-22102-7_20

  9. Nebel, B., Bolander, T., Engesser, T., Mattmüller, R.: Implicitly coordinated multi-agent path finding under destination uncertainty: success guarantees and computational complexity. J. Artif. Intell. Res. 64, 497–527 (2019). https://doi.org/10.1613/jair.1.11376

    Article  MathSciNet  MATH  Google Scholar 

  10. Premack, D., Woodruff, G.: Does the chimpanzee have a theory of mind? Behav. Brain Sci. 1(4), 515–526 (1978). https://doi.org/10.1017/S0140525X00076512

    Article  Google Scholar 

  11. Rabinowitz, N.C., Perbet, F., Song, H.F., Zhang, C., Eslami, S.M.A., Botvinick, M.: Machine theory of mind. In: Proceedings of the 35th International Conference on Machine Learning (ICML-2018). pp. 4215–4224 (2018). http://proceedings.mlr.press/v80/rabinowitz18a.html

  12. Wurman, P.R., D’Andrea, R., Mountz, M.: Coordinating hundreds of cooperative, autonomous vehicles in warehouses. AI Magazine 29(1), 9–20 (2008). http://www.aaai.org/ojs/index.php/aimagazine/article/view/2082

Download references

Acknowledgements

This paper was supported by DFG grants RA 1934/9-1, RA 1934/4-1, and RA 1934/3-1.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lukas Berger .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Berger, L., Nebel, B., Ragni, M. (2020). A Heuristic Agent in Multi-Agent Path Finding Under Destination Uncertainty. In: Schmid, U., Klügl, F., Wolter, D. (eds) KI 2020: Advances in Artificial Intelligence. KI 2020. Lecture Notes in Computer Science(), vol 12325. Springer, Cham. https://doi.org/10.1007/978-3-030-58285-2_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-58285-2_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-58284-5

  • Online ISBN: 978-3-030-58285-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics