Skip to main content

Representing Multi-agent Planning in CLP

  • Conference paper
Logic Programming and Nonmonotonic Reasoning (LPNMR 2009)

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

Abstract

We explore the use of Constraint Logic Programming (CLP) as a platform for experimenting with planning domains in presence of multiple interacting agents. We develop a novel constraint-based action language, \(\mathcal{B}^{\sf MAP}\), that enables the declarative description of large classes of multi-agent and multi-valued domains. \(\mathcal{B}^{\sf MAP}\) supports several complex features, including combined effects, concurrency constraint, interacting actions, and delayed effects.

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

References

  1. Baral, C.: Knowledge representation, reasoning and declarative problem solving. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  2. Barták, R., Toropila, D.: Reformulating Constraint Models for Classical Planning. In: Proc. of FLAIRS 2008, pp. 525–530. AAAI Press, Menlo Park (2008)

    Google Scholar 

  3. Boutilier, C., Brafman, R.: Partial order planning with concurrent interacting actions. J. of Artif. Intel. Research 14, 105–136 (2001)

    MATH  Google Scholar 

  4. Brenner, M.: Planning for Multiagent Environments: From individual perceptions to coordinated execution. In: Proc. of ICAPS 2005 Workshop on Multiagent Planning and Scheduling (2005)

    Google Scholar 

  5. Chintabathina, S., Gelfond, M., Watson, R.: Defeasible laws, parallel actions, and reasoning about resources. In: Proc. of CommonSense 2007. AAAI Press, Menlo Park (2007)

    Google Scholar 

  6. Dovier, A., Formisano, A., Pontelli, E.: Multivalued Action Languages with Constraints in CLP(FD). In: Dahl, V., Niemelä, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 255–270. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  7. Dovier, A., Formisano, A., Pontelli, E.: Multi-Agent Planning in CLP. In: Proc. of CILC 2009 (2009)

    Google Scholar 

  8. Eiter, T., et al.: Answer Set Planning Under Action Costs. J. of Artif. Intel. Research 19, 25–71 (2003)

    MathSciNet  MATH  Google Scholar 

  9. Gelfond, G., Watson, R.: Modeling Cooperative Multi-Agent Systems. In: Proc. of ASP 2007 (2007)

    Google Scholar 

  10. Gelfond, M., Lifschitz, V.: Action languages. Electr. Trans. on AI 2, 193–210 (1998)

    MathSciNet  Google Scholar 

  11. Gerevini, A., Long, D.: Plan Constraints and Preferences in PDDL3. Technical Report 2005-08-47, Dip. di Elettronica per l’Automazione, Univ. di Brescia (2005)

    Google Scholar 

  12. Giunchiglia, E., et al.: Nonmonotonic Causal Theories. Artif. Intell. 153 (2004)

    Google Scholar 

  13. Jaffar, J., Yap, R.H.C., Zhu, K.Q.: Coordination of Many Agents. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 98–112. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Jefferson, C., et al.: Modelling and solving English Peg solitaire. Comput. Oper. Res. 33(10), 2935–2959 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kakas, A., Torroni, P., Demetriou, N.: Agent Planning, Negotiation and Control of Operation. In: Proc. of ECAI 2004. IOS Press, Amsterdam (2004)

    Google Scholar 

  16. Knoblock, C.: Generating Parallel Execution Plans with a Partial-Order Planner. In: Proc. of AIPS 1994, pp. 98–103. AAAI Press, Menlo Park (1994)

    Google Scholar 

  17. Lopez, A., Bacchus, F.: Generalizing graphplan by formulating planning as a CSP. In: Proc. of IJCAI 2003. Morgan Kaufmann, San Francisco (2003)

    Google Scholar 

  18. Reiter, R.: Knowledge in Action: Logical Foundations for Describing and Implementing Dynamical Systems. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  19. Sadri, F., Toni, F.: Abductive Logic Programming for Communication and Negotiation Amongst Agents. ALP Newsletter (2003)

    Google Scholar 

  20. Sauro, L., Gerbrandy, J., van der Hoek, W., Wooldridge, M.: Reasoning about Action and Cooperation. In: Proc. of AAMAS 2006. ACM, New York (2006)

    Google Scholar 

  21. Son, T.C., Sakama, C.: Reasoning and Planning with Cooperative Actions for Multiagents Using Answer Set Programming. In: Proc. of DALT 2009. LNCS (LNAI). Springer, Heidelberg (2009)

    Google Scholar 

  22. Thielscher, M.: Programming of Reasoning and Planning Agents with FLUX. In: Proc. of KR 2002. Morgan Kaufmann, San Francisco (2002)

    Google Scholar 

  23. Vidal, V., Geffner, H.: Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming. Artif. Intell. 170 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dovier, A., Formisano, A., Pontelli, E. (2009). Representing Multi-agent Planning in CLP. In: Erdem, E., Lin, F., Schaub, T. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2009. Lecture Notes in Computer Science(), vol 5753. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04238-6_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04238-6_37

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04237-9

  • Online ISBN: 978-3-642-04238-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics