Skip to main content
SpringerLink
Log in

An algorithm for plan verification in multiple agent systems

  • Conference paper
  • First Online:
Agents and Multi-Agent Systems Formalisms, Methodologies, and Applications (DAI 1997)

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

Included in the following conference series:

  • 113 Accesses

Abstract

In this paper, we propose an algorithm which can improve Katz and Rosenschein's plan verification algorithm. First, we represent the plan-like relations with adjacency lists and inverse adjacency lists to replace adjacency matrixes. Then, we present a method to avoid generating useless sub-graphs while generating the compressed set. Last, we compare two plan verification algorithms. We not only prove that our algorithm is correct, but also prove that our algorithm is better than Katz and Rosenschein's algorithm both on time complexity and space complexity.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. I. Brafman and M. Tennenholtz, Modeling agents as qualitative decision makers, Artificial Intelligence, 1997, 94: 217–268.

    Article  MATH  MathSciNet  Google Scholar 

  2. E. H. Durfee, V. R. Lesser and D. D. Corkill, Trends in cooperative distributed problem solving, IEEE Trans, Knowl. Data Eng., 1989, 1: 63–83.

    Article  Google Scholar 

  3. E. H. Durfee, V. R. Lesser and D. D. Corkill, Cooperation through communication in a distributed problem solving network. In M.N. Huhns (ed.) Distributed Artificial Intelligence (Los Altos, California, USA: Morgan Kaufmann, Inc.) 1987, Ch. 2, 29–58.

    Google Scholar 

  4. E. Ephrati, M. E. Pollack and J. S. Rosenschein, A tractable heuristic that maximizes global utility through local, in Proceedings of ICMAS, 1995, 94–101.

    Google Scholar 

  5. E. Ephrati and J. S. Rosenschein, The Clarke Tax as a consensus mechanism among automated agents, in Proceedings of AAAI, 1991, 173–178.

    Google Scholar 

  6. E. Ephrati and J. S. Rosenschein, Multi-agent planning as search for a consensus that maximizes social welfare, in Proceedings of 4th European Workshop on Modeling Autonomous Agents in a Multi-Agent World, 1992, Chapter 3.

    Google Scholar 

  7. M. J. Katz and J. S. Rosenschein, Plans for multiple agents, In L. Gasser and M. N. Huhns (eds.) Distributed Artificial Intelligence, Volume II (Pitman/Morgan Kaufmann, Inc., London), 1989, 197–228.

    Google Scholar 

  8. M. J. Katz and J. S. Rosenschein, Verifying plans for multiple agent, J. Experimental · Theoretical Artificial Intelligence, 1993, 5: 39–56.

    Google Scholar 

  9. N. A. Khan and R. Jain, Uncertainty management in a distributed knowledge based system, in: Proceedings of IJCAI, Los Angeles, CA, 1985, 318–320.

    Google Scholar 

  10. V. R. Lesser and D. D. Corkill, The distributed vehicle monitoring test bed, AI Mag., 1983, 4: 65–109.

    Google Scholar 

  11. Y. Li and D. Liu, Task decomposition model in distributed expert systems, in: Proceedings of 9th International Conference on Computer-Aided Production Engineering, 1993, 259–264.

    Google Scholar 

  12. Y. Li and D. Liu, The method of verifying plans for multiple agents, Chinese J. of Computers, 1996, 19(3): 202–207.

    Google Scholar 

  13. E. P. D. Pednault, Formulating multiagent, dynamic-world problems in the classical planning framework. In M.P. Georgeff and A.L. Lansky (eds.) Reasoning About Actions and Plans (Los Altos, California, USA: Morgan Kaufmann, Inc.), 1987, 47–82.

    Google Scholar 

  14. M. Pollack, The uses of plans, Artificial Intelligence, 1992, 57(1): 43–68.

    Article  MathSciNet  Google Scholar 

  15. J. S. Rosenschein, Synchronization of multi-agent plans, in Proceedings of AAAI, 1982, 115–119.

    Google Scholar 

  16. J. S. Rosenschein and M. R. Genesereth, Deals among rational agents, in Proceedings of IJCAI, 1985, 91–95.

    Google Scholar 

  17. R. G. Smith, The contract net protocol: High-level communication and control in a distributed problem solver, IEEE Transactions on Computers, 1982, C-29(12): 1104–1113.

    Google Scholar 

  18. D. S. Weld, An introduction to least commitment planning, AI Magazine, 1994, 15(4): 27–61.

    Google Scholar 

  19. C. Zhang, Cooperation under uncertainty in distributed expert systems, Artificial Intelligence, 1992, 56(1): 21–69.

    Article  MathSciNet  Google Scholar 

  20. C. Zhang and D. A. Bell, HECODES: a framework for heterogeneous cooperative distributed expert system, Int. J. Data Knowl. Eng., 1991, 6(3): 251–273.

    Article  Google Scholar 

  21. G. Zlotkin and J. S. Rosenschein, Cooperation and conflict resolution via negotiation among autonomous agents in noncooperative domains, IEEE Transaction on Systems, Man and Cybernetics, 1991, 21(6): 1317–1324.

    Article  MATH  Google Scholar 

  22. G. Zlotkin and J. S. Rosenschein, Incomplete information and deception in multi-agent negotiation, in Proceedings of IJCAI, 1991, 225–231.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematical and Computer Sciences, University of New England, 2351, Armidale, N.S.W., Australia

    Chengqi Zhang & Yuefeng Li

Authors
  1. Chengqi Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuefeng Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wayne Wobcke Maurice Pagnucco Chengqi Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, C., Li, Y. (1998). An algorithm for plan verification in multiple agent systems. In: Wobcke, W., Pagnucco, M., Zhang, C. (eds) Agents and Multi-Agent Systems Formalisms, Methodologies, and Applications. DAI 1997. Lecture Notes in Computer Science, vol 1441. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055026

Download citation

  • DOI: https://doi.org/10.1007/BFb0055026

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64769-0

  • Online ISBN: 978-3-540-68722-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation