Finding a Feasible Solution for a Class of Distributed Problems with a Single Sum Constraint Using Agents
- 33 Downloads
In this paper, we describe a Multi-Agent System which is capable of finding a feasible solution of a class of distributed problems, in which the subproblems share a single a sum constraint. Emphasis is given to correctness issues and termination detection.
Unable to display preview. Download preview PDF.
- 1.Chandy, K. M., & Misra, J. (1988). Parallel Program Design. Reading: Addison-Wesley.Google Scholar
- 2.Davies, W., & Edwards, P. (1994). Agent-K: an integration of AOP and KQML. In Labrou, Y., & Finin, T., eds., Proceedings of the CIKM '94 Intelligent Information Agents Workshop.Google Scholar
- 3.Neches, R., Fikes, R., Finin, T., Gruber, T., Patel, R., Senator, T., & Swartout, W. R. (1991). Enabling technology for knowledge sharing. AI Magazine, 12(3): 36–56.Google Scholar
- 4.Shoham, Y. (1993). Agent-oriented programming. Artificial Intelligence, 60: 51–92.Google Scholar
- 5.Tel, G. (1999). Distributed control algorithms for AI. In Weiss, G., ed., Multiagent Systems: A Modern Approach to Distributed Artificial Intelligence, Chapter 13, MIT Press.Google Scholar
- 6.Wooldridge, M. J., & Jennings, N. R. (1994). Formalizing the cooperative problem solving process. In Proceedings of the 13th International Workshop on Distributed Artificial Intelligence (IWDAI-94), pages 403–417.Google Scholar