Multistage negotiation for distributed constraint satisfaction

IEEE Transactions on Systems, Man and Cybernetics

Volumn 21, Issue 6, 1991, Pages 1462-1477

  Conry, Susan E ^a   Meyer, Robert A ^a   Kuwabara, Kazuhiro ^b   Lesser, Victor R ^c  

^a CLARKSON UNIVERSITY   (United States)

^b NTT CORPORATION   (Japan)

^c UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS, DIGITAL - DISTRIBUTED;

AGENT COOPERATION; DISTRIBUTED ARTIFICIAL INTELLIGENCE; DISTRIBUTED CONSTRAINT SATISFACTION; MULTISTAGE NEGOTIATION; TASK COORDINATION;

ARTIFICIAL INTELLIGENCE;

EID: 0026258186     PISSN: 00189472     EISSN: 21682909     Source Type: Journal    
DOI: 10.1109/21.135689     Document Type: Article

References (23)

1. P. A. Bernstein and N. Goodman “Concurrency control in distributed database systems,” Computing Surveys, vol. 13, no. 2, pp. 185–221, June 1981.
2. S. E. Conry, R. A. Meyer, and J. E. Searleman “A shared knowledge base for independent problem solving agents,” Proc. Expert Syst/ in Gov/t Symp/, IEEE Comput. Soc., McLean, VA, Oct. 1985.
3. S. E. Conry, R. A. Meyer and V. R. Lesser, “Multistage negotiation in distributed planning,” COINS Tech. Rep. 86–67, Comput. and Inform. Sci. Dept., Univ. Mass., Amherst, 1986.
4. Also in Readings in Distributed Artificial Intelligence, A. H. Bond and L. Gasser, Eds. San Mateo, CA: Morgan Kaufmann, 1988.
5. S. E. Conry, R. A. Meyer and R. P. Pope, “Reasoning about nonlocal impact of local decisions in distributed planning,” Workshop on Distributed Artificial Intelligence, 1988.
6. S. E. Conry, K. Kuwabara, V. R. Lesser, and R. A. Meyer, “Multistage negotiation for distributed constraint satisfaction,” Tech. Rep., Dept. Elec. Comput. Eng., Clarkson Univ., Potsdam, NY, 1990.
7. R. Davis, and R. G. Smith “Negotiation as a metaphor for distributed problem solving,” Artificial Intell., vol. 20, no. 1, pp. 63–109, Jan. 1983.
8. E. W. Dijkstra and C. S. Scholten “Termination detection for diffusing computations,” Inform. Processing Lett., vol. 11, no. 1, pp. 1-4 Aug. 1980.
9. N. Francez “Distributed termination,” ACM Trans. Programming Languages and Syst., vol. 2, no. 1, pp. 42–55, Jan. 1980.
10. R. G. Gallager “A minimum delay routing algorithm using distributed computation,” IEEE Trans. Communications, vol. COM-25, no. 1, pp. 73–85, Jan. 1977.
11. J. F. Kurose and R. Simha, “A microeconomic approach to optimal file allocation,” COINS Tech. Rep. TR–85—43, Dept. Comput. Inform. Sci., Univ. Mass., Amherst.
12. K. Kuwabara and V. R. Lesser, “Extended protocol for multistage negotiation,” 9th Workshop on Distributed Artificial Intelligence, 1989.
13. V. R. Lesser and D. D. Corkill “Functionally accurate, cooperative distributed systems,” IEEE Trans. Syst., Man, Cybern., pp. 81–96, Jan. 1981.
14. D. J. Macintosh and S. E. Conry, “SIMULACT: A generic tool for simulating distributed systems,” Tools for the Simulation Profession, vol. 18, Apr. 1987.
15. A.K. Mackworth, “Constraint satisfaction” in Encyclopedia of Artificial Intelligence, S. C. Shapiro, Ed. New York: Wiley, 1987.
16. R. P. Pope, R. A. Meyer, and S. E. Conry, “Role recognition in distributed planning,” submitted for publication.
17. R. G. Smith, “The contract net protocol: High level communication and control in a distributed problem solver,” IEEE Trans. Syst., Man, Cybern., vol. SMC-10, Dec. 1980.
18. R. G. Smith and R. Davis, “Frameworks for Cooperation in Distributed Problem Solving,” IEEE Transactions on Systems, Man, and Cybernetics, vol. SMC-11, pp. 61–70, Jan. 1981.
19. J. A. Stankovic “An application of bayesian decision theory to decentralized control of job scheduling,” IEEE Trans. Computers, vol. C-34, pp. 117–130, Feb. 1985.
20. K. Sycara, S. Roth, N. Sadeh, and M. Fox, “Decentralized factory scheduling: Coordinating resource allocation using constrained directed search,” in Proc. Tenth Workshop on Artificial Intell., Bandera, TX, 1990.
21. A. S. Tanenbaum, Computer Networks Englewood Cliffs, NJ: Prentice-Hall, 1981.
22. S. Vinter, K. Ramamritham, and D. Stemple, “Recoverable communicating actions in Gutemberg,” Proc. Int. Conf Distributed Computing Syst., May 1986.
23. M. Yokoo, T. Ishida, and K. Kuwabara, “Distributed constraint satisfaction for DAI problems,” in Proc. Tenth Workshop on Artificial Intell., Bandera, TX, 1990.