Skip to main content
Log in

Coordinating Self-interested Planning Agents

  • Published:
Autonomous Agents and Multi-Agent Systems Aims and scope Submit manuscript

Abstract

We consider planning problems where a number of non-cooperative agents have to work on a joint problem. Such problems consist in completing a set of interdependent, hierarchically ordered tasks. Each agent is assigned a subset of tasks to perform for which it has to construct a plan. Since the agents are non-cooperative, they insist on planning independently and do not want to revise their individual plans when the joint plan has to be assembled from the individual plans. We present a general formal framework to study some computational aspects of this non-cooperative coordination problem and we establish some complexity results to identify some of the factors that contribute to the complexity of this problem. Finally, we illustrate our approach with an application to coordination in multi-modal logistic planning.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. B. Bonet H. Geffner (2001) ArticleTitleHeuristic search planner 2.0. AI Magazine 22 IssueID3 77–80

    Google Scholar 

  2. Cox J.S., Durfee E.H. (2003). Discovering and exploiting synergy between hierarchical planning agents. In Second international joint conference on autonomous agents and multiagent systems (AAMAS ’03).

  3. Decker, K. S., & Lesser, V. R. (1994). Designing a family of coordination algorithms. In Proceedings of the thirteenth international workshop on distributed artificial intelligence (DAI-94) (pp. 65–84).

  4. E.H. Durfee V.R. Lesser (1991) ArticleTitlePartial global planning: A coordination framework for distributed hypothesis formation IEEE Transactions on Systems, Man, and Cybernetics. 21 IssueID5 1167–1183 Occurrence Handle10.1109/21.120067

    Article  Google Scholar 

  5. Ephrati, E., & Rosenschein, J. S. (1993). Multi-agent planning as the process of merging distributed sub-plans. In Proceedings of the twelfth international workshop on distributed artificial intelligence (DAI-93) (pp. 115–129).

  6. Erol, K., Hendler, J., & Nau, D. S. (1994). HTN planning: Complexity and expressivity. In Proceedings of the twelfth national conference on artificial intelligence (AAAI-94) (Vol. 2, pp. 1123–1128). Seattle, Washington: AAAI Press/MIT Press.

  7. B. Faltings M. Yokoo (2005) ArticleTitleIntroduction: Special issue on distributed constraint satisfaction Artificial Intelligence. 161 1–5 Occurrence Handle2118396

    MathSciNet  Google Scholar 

  8. D.E. Foulser M. Li Q. Yang (1992) ArticleTitleTheory and algorithms for plan merging Artificial Intelligence Journal. 57 IssueID2–3 143–182 Occurrence Handle93e:68115

    MathSciNet  Google Scholar 

  9. N. Friedman J.Y. Halpern (1999) ArticleTitleModeling belief in dynamic systems, part II: Revision and update Journal of Artificial Intelligence Research. 10 117–167 Occurrence Handle2000c:03015

    MathSciNet  Google Scholar 

  10. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. W.H.Freeman.

  11. B.P. Gerkey M.J. Mataric (2004) ArticleTitleA formal analysis and taxonomy of task allocation in multi-robot systems International Journal of Robotics Research. 23 IssueID9 939–954

    Google Scholar 

  12. N.R. Jennings (1993) ArticleTitleCommitments and conventions: The foundation of coordination in multi-agent systems The Knowledge Engineering Review. 8 IssueID3 223–250

    Google Scholar 

  13. J. Kvarnström P. Doherty (2000) ArticleTitleTalplanner: A temporal logic based forward chaining planner Annals of Mathematics and Artificial Intelligence. 30 IssueID1–4 119–169

    Google Scholar 

  14. V.R. Lesser K.S. Decker T. Wagner N. Carver A. Garvey B. Horling D. Neiman R. Podorozhny M. NagendraPrasad A. Raja R. Vincent P. Xuan X.Q. Zhang (2004) ArticleTitleEvolution of the GPGP/TAEMS domain-independent coordination framework Autonomous Agents and Multi-Agent Systems. 9 IssueID1 87–143 Occurrence Handle10.1023/B:AGNT.0000019690.28073.04

    Article  Google Scholar 

  15. D. Long M. Fox (1999) ArticleTitleEfficient implementation of the plan graph in STAN Journal of AI Research. 10 87–115

    Google Scholar 

  16. Moses, Y., & Tennenholtz, M. (1992). On computational aspects of artificial social systems. In Proceedings of DAI-92.

  17. Y. Shoham M. Tennenholtz (1995) ArticleTitleOn social laws for artificial agent societies: Off-line design Artificial Intelligence. 73 IssueID1–2 231–252

    Google Scholar 

  18. ter Mors, A. W., Valk, J., & Witteveen, C. (2004). Complexity of coordinating autonomous planning agents. Technical Report PDS-2004-002, Delft University of Technology.

  19. F. Martial Particlevon (1992) Coordinating plans of autonomous agents, Vol. 610 of Lecture Notes on Artificial intelligence Springer-Verlag Berlin

    Google Scholar 

  20. M. Yokoo E.H. Durfee T. Ishida K. Kuwabara (1998) ArticleTitleThe distributed constraint satisfaction problem: Formalization and algorithms IEEE Transactions on Knowledge and Data Engineering. 10 IssueID5 673–685 Occurrence Handle10.1109/69.729707

    Article  Google Scholar 

  21. Zlot, R. M., & Stentz, A. (2003). Market-based multirobot coordination using task abstraction. In International conference on field and service robotics.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Cees Witteveen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Buzing, P., Mors, A.t., Valk, J. et al. Coordinating Self-interested Planning Agents. Auton Agent Multi-Agent Syst 12, 199–218 (2006). https://doi.org/10.1007/s10458-005-6104-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10458-005-6104-4

Keywords

Navigation