Multiagent coordination in tightly coupled task scheduling

We consider an environment where agents’ tasks are tightly coupled and require real-time scheduling and execution. In order to complete their tasks, agents need to coordinate their actions both constantly and extensively. We present an approach that consists of a standard operating procedure and a look-ahead coordination. The standard operating procedure regulates task coupling and minimizes communication. The look-ahead coordination increases agents’ global visibility and providcs indicative information tbr decision adjustment. The goal of our approach is to prune decision myopia while maintaining system responsiveness in real-time, dynamic environments. Experimental results in job shop scheduling problems show that (1) the look-ahead coordination significantly enhances the performance of the standard operating procedure in solution quality. (2) the approach is capable of producing solutions of very high quality in a real-time environment.

[1]  G. Rand Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[2]  Randall Davis,et al.  Negotiation as a Metaphor for Distributed Problem Solving , 1988, Artif. Intell..

[3]  Victor R. Lesser,et al.  The Distributed Vehicle Monitoring Testbed: A Tool for Investigating Distributed Problem Solving Networks , 1983, AI Mag..

[4]  Alan H. Bond,et al.  Readings in Distributed Artificial Intelligence , 1988 .

[5]  Alan H. Bond,et al.  Distributed Artificial Intelligence , 1988 .

[6]  Katia P. Sycara,et al.  Resolving Goal Conflicts via Negotiation , 1988, AAAI.

[7]  Victor Lesser,et al.  Multistage negotiation in distributed planning , 1988 .

[8]  Norman M. Sadeh,et al.  Distributed constrained heuristic search , 1991, IEEE Trans. Syst. Man Cybern..

[9]  Michael N. Huhns,et al.  Multiagent truth maintenance , 1991, IEEE Trans. Syst. Man Cybern..

[10]  Edmund H. Durfee,et al.  Partial global planning: a coordination framework for distributed hypothesis formation , 1991, IEEE Trans. Syst. Man Cybern..

[11]  R. Dechter to Constraint Satisfaction , 1991 .

[12]  Makoto Yokoo,et al.  Distributed constraint satisfaction for formalizing distributed problem solving , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[13]  Thomas E. Morton,et al.  Heuristic scheduling systems : with applications to production systems and project management , 1993 .

[14]  Katia P. Sycara,et al.  Emergent Constraint Satisfaction Through Multi-Agent Coordinated Interaction , 1993, MAAMAW.

[15]  Katia P. Sycara,et al.  Exploiting Problem Structure for Distributed Constraint Optimization , 1995, ICMAS.

[16]  Victor R. Lesser,et al.  Issues in Automated Negotiation and Electronic Commerce: Extending the Contract Net Framework , 1997, ICMAS.

[17]  Jörg P. Müller,et al.  A Model for Cooperative Transportation Scheduling , 1995, ICMAS.

[18]  Victor R. Lesser,et al.  Designing a Family of Coordination Algorithms , 1997, ICMAS.