Skip to main content
SpringerLink
Log in

A Resource Logic for Multi-Agent Plan Merging

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

In a multi-agent system, agents are carrying out certain tasks by executing plans. Consequently, the problem of finding a plan, given a certain goal, has been given a lot of attention in the literature. Instead of concentrating on this problem, the focus of this paper is on cooperation between agents which already have constructed plans for their goals. By cooperating, agents might reduce the number of actions they have to perform in order to fulfill their goals. The key idea is that in carrying out a plan an agent possibly produces side products that can be used as resources by other agents. As a result, an other agent can discard some of its planned actions. This process of exchanging products, called plan merging, results in distributed plans in which agents become dependent on each other, but are able to attain their goals more efficiently. In order to model this kind of cooperation, a new formalism is developed in which side products are modeled explicitly. The formalism is a resource logic based on the notions of resource, skill, goal, and service. Starting with some resources, an agent can perform a number of skills in order to produce other resources which suffice to achieve some given goals. Here, a skill is an elementary production process taking as inputs resources satisfying certain constraints. A service is a serial or parallel composition of skills acting as a program. An operational semantics is developed for these services as programs. Using this formalism, an algorithm for plan merging is developed, which is anytime and runs in polynomial time. Furthermore, a variant of this algorithm is proposed that handles the exchange of resources in a more flexible way. The ideas in the paper will be illustrated by an example from public transportation.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. B. Bonet and H. Geffner, Functional STRIPS: a more general language for planning and problem solving, in: Proceedings of the Logic-Based AI Workshop (1999).

  2. B.J. Clement and E.H. Durfee, Theory for coordinating concurrent hierarchical planning agents using summary information, in: Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99) (1999) pp. 495–502.

  3. B.J. Clement and E.H. Durfee, Top-down search for coordinating the hierarchical plans of multiple agents, in: Proceedings of the Third International Conference on Autonomous Agents (Agents-99) (1999) pp. 252–259.

  4. T. Cormen, C. Leiserson and R. Rivest, Introduction to Algorithms (MIT Press/McGraw-Hill, 1990).

  5. K.S. Decker and V.R. Lesser, Designing a family of coordination algorithms, in: Proceedings of the 13th International Workshop on Distributed Artificial Intelligence, Lake Quinalt, WA (1994) pp. 65–84.

  6. E.H. Durfee, Coordination of Distributed Problem Solvers (Kluwer Academic, Dordrecht, 1988).

    Google Scholar 

  7. E.H. Durfee and V. Lesser, Using partial global plans to coordinate distributed problem solvers, in: Proceedings of the Tenth International Joint Conference on Artificial Intelligence (IJCAI-87), Milan, Italy (1987) pp. 875–883.

  8. E. Ephrati and J.S. Rosenschein, Multi-agent planning as a dynamic search for social consensus, in: Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93), Chambéry, France (1993) pp. 423–429.

  9. E. Ephrati and J.S. Rosenschein, Multi-agent planning as the process of merging distributed sub-plans, in: Proceedings of the Twelfth International Workshop on Distributed Artificial Intelligence (1993) pp. 115–129.

  10. E. Ephrati and J.S. Rosenschein, Divide and conquer in multi-agent planning, in: Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI-94), Seattle, WA (1994) pp. 375–380.

  11. R.E. Fikes and N. Nilsson, STRIPS: a new approach to the application of theorem proving to problem solving, Artificial Intelligence 5(2) (1971) 189–208.

    Google Scholar 

  12. D. Foulser, M. Li and Q. Yang, Theory and algorithms for plan merging, Artificial Intelligence Journal 57(2–3) (1992) 143–182.

    Google Scholar 

  13. M. Georgeff, Communication and interaction in multi-agent planning, in: Proceedings of the Third National Conference on Artificial Intelligence (AAAI-83), Washington, DC (1983) pp. 125–129. See also [15].

  14. M. Georgeff, A theory of action for multi-agent planning, in: Proceedings of the Fourth National Conference on Artificial Intelligence (AAAI-84), Austin, TX (1984) pp. 121–125. Also published in: Readings in Distributed Artificial Intelligence, eds. A.H. Bond and L. Gasser (Morgan Kaufmann, San Mateo, CA, 1988) pp. 205–209.

  15. M. Georgeff, Communication and interaction in multi-agent planning, in: Readings in Artificial Intelligence, eds. A. Bond and L. Gasser (Morgan Kaufmann, San Mateo, CA, 1988) pp. 200–204.

    Google Scholar 

  16. J.-Y. Girard, Linear logic, Theoretical Computer Science 50 (1987) 1–102.

    Google Scholar 

  17. V. Marek and M. Truszczynski, Revision specifications by means of programs, in: Proceedings of European Workshop, JELIA'94, York, UK, September 1994 (Berlin, 1994) pp. 122–136.

  18. F. von Martial, Interactions among autonomous planning agents, in: Decentralized AI – Proceedings of the First European Workshop on Modelling Autonomous Agents in a Multi-Agent World (MAAMAW-89), eds. Y. Demazeau and J. Müller (North-Holland, 1990) pp. 105–119.

  19. F. von Martial, Coordinating Plans of Autonomous Agents, Lecture Notes in Artificial Intelligence, Vol. 610 (Springer, Berlin, 1992).

    Google Scholar 

  20. M. Masseron, Generating plans in linear logic, Theoretical Computer Science 113(2) (1993) 349–370.

    Google Scholar 

  21. D. McDermott, PDDL – the planning domain definition language, Technical Report TR-98-003, Yale Center for Computational Vision and Control (1998).

  22. B.-J. Moree, A. Bos, H. Tonino and C. Witteveen, Cooperation by iterated plan revision, in: Proceedings of the Fourth International Conference on Multi-Agent Systems (ICMAS-00) (2000).

  23. G. Plotkin, An operational semantics for CSP, in: Proceedings IFIP TC2 Working Conference: Formal Description of Programming Concepts – II, Amsterdam, ed. D. Bjørner (1983) pp. 199–223.

  24. J.S. Rosenschein, Synchronization of multi-agent plans, in: Proceedings of the Second National Conference on Artificial Intelligence (AAAI-82), Pittsburgh, PA (1982) pp. 115–119. Also published in: Readings in Distributed Artificial Intelligence, eds. A.H. Bond and L. Gasser (Morgan Kaufmann, San Mateo, CA, 1988) pp. 187–191.

  25. O. Shehory and S. Kraus, Methods for task allocation via agent coalition formation, Artificial Intelligence 101(1–2) (1998) 165–200.

    Google Scholar 

  26. C.J. Stuart, An implementation of a multi-agent plan synchronizer, in: Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI-85), Los Angeles, CA (1985) pp. 1031–1033. Also published in: Readings in Distributed Artificial Intelligence, eds. A.H. Bond and L. Gasser (Morgan Kaufmann, San Mateo, CA, 1988) pp. 216–219.

  27. M.M. de Weerdt, A. Bos, H. Tonino and C. Witteveen, Fusion of plans in a framework with constraints, in: Proceedings of the ISCS Conference on Intelligent Systems and Applications (ISA-00) (2000) pp. 393–399.

  28. Q. Yang, D.S. Nau and J. Hendler, Merging separately generated plans with restricted interactions, Computational Intelligence 8(4) (1992).

Download references

Author information

Authors and Affiliations

  1. Faculty of Information Technology and Systems, Delft University of Technology, P.O. Box 356, 2600 AJ, Delft, The Netherlands

    Mathijs de Weerdt, André Bos, Hans Tonino & Cees Witteveen

Authors
  1. Mathijs de Weerdt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. André Bos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hans Tonino
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Cees Witteveen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

de Weerdt, M., Bos, A., Tonino, H. et al. A Resource Logic for Multi-Agent Plan Merging. Annals of Mathematics and Artificial Intelligence 37, 93–130 (2003). https://doi.org/10.1023/A:1020236119243

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1020236119243

Search

Navigation