Taking DCOP to the real world: Efficient complete solutions for distributed multi-event scheduling

Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004

Volumn 1, Issue , 2004, Pages 310-317

  Maheswaran, Rajiv T ^a   Tambe, Milind ^a   Bowring, Emma ^a   Pearce, Jonathan P ^a   Varakantham, Pradeep ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION STRUCTURES; DISTRIBUTED CONSTRAINT OPTIMIZATION (DCOP); DISTRIBUTED MULTI-EVENT SCHEDULING (DIMES); RESEARCHERS;

ALGORITHMS; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; HEURISTIC METHODS; MULTI AGENT SYSTEMS; OPTIMIZATION; SCHEDULING; SENSORS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 4544376849     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. CALO: Cognitive Agent that Learns and Organizes, 2003. http://www.ai.sri.com/project/CALO, http://calo.sri.com.
2. R. Dechter. Encyclopedia of Artificial Intelligence, chapter Constraint Networks, pages 276-285. John Wiley and Sons, second edition, 1992.
3. M. S. Franzin, E. C. Freuder, F. Rossi, and R. Wallace. Multi-agent meeting scheduling with preferences: efficiency, privacy loss, and solution quality. In Proceedings of the AAAI Workshop on Preference in AI and CP, Edmonton, Canada, July 2002.
4. 2 messages. In Proc. 19th Int. Workshop on Graph-Theoretic Concepts in Comp. Sci., pages 350-363, 1993.
5. V. Lesser, C. Ortiz, and M. Tambe. Distributed Sensor Nets: A Multiagent Perspective. Kluwer, 2003.
6. J. Liu and K.P. Sycara. Multiagent coordination in tightly coupled task scheduling. In Proceedings of the First International Conference on Multiagent Systems, pages 181-188, December 1996.
7. P. J. Modi, H. Jung, M. Tambe, W. Shen, and S. Kulkarni. A dynamic distributed constraint satisfaction approach to resource allocation. In Proceedings of the Seventh International Conference on Principles and Practices of Constraint Programming, Paphos, Cyprus, 2001.
8. P. J. Modi, W. Shen, M. Tambe, and M. Yokoo. An asynchronous complete method for distributed constraint optimization. In Proceedings of the Second International Conference on Autonomous Agents and Multi-Agent Systems, Sydney, Australia 2003.
9. N. Sadeh and M. S. Fox. Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem. Artificial Intelligence, 86:1-41, 1996.
10. P. Seem, D. Pynadath, and M. Tambe. Towards adjustable autonomy for the real-world. Journal of Artificial Intelligence Research, 17:171-228, 2002.
11. S. Sen and E. Durfee. A formal study of distributed meeting scheduling: Preliminary results. In Proceedings of the Conference on Organizational Computing Systems, pages 55-68, November 1991.
12. M. C. Silaghi, D. Sam-Haroud, and B. Faltmgs. Abt with asynchronous reordering. In Second Asia-Pacific Conf. on Intelligent Agent Technology, Maebashi, Japan, 2001.
13. M. Yokoo, E. H. Durfee, T. Ishida, and K. Kuwabara. The distributed constraint satisfaction problem: formalization and algorithms. IEEE Transactions on Knowledge and Data Engineering, 10(5):673-685, 1998.
14. W. Zhang and L. Wittenburg. Distributed breakout revisited. In Proceedings of the National Conference on Artificial Intelligence, 2002.