Advertisement

An algorithm for plan verification in multiple agent systems

  • Chengqi Zhang
  • Yuefeng Li
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1441)

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.

Keywords

Planning Verification Multiple agent systems 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    R. I. Brafman and M. Tennenholtz, Modeling agents as qualitative decision makers, Artificial Intelligence, 1997, 94: 217–268.MATHMathSciNetCrossRefGoogle Scholar
  2. 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.CrossRefGoogle Scholar
  3. 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. 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. 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. 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. 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. 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. 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. 10.
    V. R. Lesser and D. D. Corkill, The distributed vehicle monitoring test bed, AI Mag., 1983, 4: 65–109.Google Scholar
  11. 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. 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. 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. 14.
    M. Pollack, The uses of plans, Artificial Intelligence, 1992, 57(1): 43–68.MathSciNetCrossRefGoogle Scholar
  15. 15.
    J. S. Rosenschein, Synchronization of multi-agent plans, in Proceedings of AAAI, 1982, 115–119.Google Scholar
  16. 16.
    J. S. Rosenschein and M. R. Genesereth, Deals among rational agents, in Proceedings of IJCAI, 1985, 91–95.Google Scholar
  17. 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. 18.
    D. S. Weld, An introduction to least commitment planning, AI Magazine, 1994, 15(4): 27–61.Google Scholar
  19. 19.
    C. Zhang, Cooperation under uncertainty in distributed expert systems, Artificial Intelligence, 1992, 56(1): 21–69.MathSciNetCrossRefGoogle Scholar
  20. 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.CrossRefGoogle Scholar
  21. 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.MATHCrossRefGoogle Scholar
  22. 22.
    G. Zlotkin and J. S. Rosenschein, Incomplete information and deception in multi-agent negotiation, in Proceedings of IJCAI, 1991, 225–231.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Chengqi Zhang
    • 1
  • Yuefeng Li
    • 1
  1. 1.School of Mathematical and Computer SciencesUniversity of New EnglandArmidaleAustralia

Personalised recommendations