Algorithms of distributed task allocation for cooperative agents

This paper considers the problem of distributed dynamic task allocation by a set of cooperative agents. The paper describes a rather specific situation. However, its methods have wide application and, thus, it can be useful to solve general problems of computer science. One of its main ideas is to combine optimization questions with the symmetries of initial objects. There are different types of tasks that are dynamically arriving to a system. Each of the agents can satisfy only a subset of the tasks. The main goal of the agents is to maximize the overall performance of the system and to fulfill the tasks as soon as possible. The agents are modeled using a stochastic closed queueing network. The problem is divided into two subproblems: to determine a distributed policy of optimal task distribution and to find the optimal effort levels of the agents subject to certain constraints. For the first subproblem, a distributed polynomial allocation algorithm for determining an instantaneous probabilistic optimal policy for task allocation is presented. The policy is independent of the state of the system and thus does not require information exchange among the agents during the performance of the tasks. For the second subproblem, an analytical solution to find the optimal effort levels for the agents is given.

[1]  Eithan Ephrati,et al.  The Clarke Tax as a Consensus Mechanism Among Automated Agents , 1991, AAAI.

[2]  Jonathan R. Agre,et al.  A queueing network approach to the module allocation problem in distributed systems , 1981, SIGMETRICS '81.

[3]  Carl M. Harris,et al.  Fundamentals of queueing theory , 1975 .

[4]  Sarit Kraus,et al.  Multiagent Negotiation under Time Constraints , 1995, Artif. Intell..

[5]  Michael P. Georgeff,et al.  Communication and interaction in multi-agent planning , 1983, AAAI 1983.

[6]  Walter H. Kohler,et al.  Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System , 1979, IEEE Transactions on Computers.

[7]  Gianfranco Balbo,et al.  Computational algorithms for closed queueing networks , 1980 .

[8]  Mandyam M. Srinivasan,et al.  Characteristics of Optimal Workload Allocation for Closed Queueing Networks , 1991, Perform. Evaluation.

[9]  Masahiro Tsuchiya,et al.  A Task Allocation Model for Distributed Computing Systems , 1982, IEEE Transactions on Computers.

[10]  Gil Tidhar,et al.  Planned Team Activity , 1992, MAAMAW.

[11]  Donald F. Towsley,et al.  Bounding the Mean Response Time of the Minimum Expected Delay Routing Policy: An Algorithmic Approach , 1995, IEEE Trans. Computers.

[12]  Winfried K. Grassmann,et al.  A numerically stable algorithm for two server queue models , 1991, Queueing Syst. Theory Appl..

[13]  Sarit Kraus,et al.  Collaborative Plans for Complex Group Action , 1996, Artif. Intell..

[14]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[15]  Edmund H. Durfee,et al.  Coordination of distributed problem solvers , 1988 .

[16]  Donald F. Towsley,et al.  Queuing Network Models with State-Dependent Routing , 1980, JACM.

[17]  James B. Sinclair,et al.  Efficient Computation of Optimal Assignments for Distributed Tasks , 1987, J. Parallel Distributed Comput..

[18]  Randall Davis,et al.  Negotiation as a Metaphor for Distributed Problem Solving , 1988, Artificial Intelligence.

[19]  Z. Liu,et al.  Optimality of the round-robin routing policy , 1992, Journal of Applied Probability.

[20]  Floyd B. Hanson,et al.  PDAC: A Data Parallel Algorithm for the Performance Analysis of Closed Queueing Networks , 1993, Parallel Comput..

[21]  V. S. Tanaev,et al.  Scheduling Theory: Multi-Stage Systems , 1994 .

[22]  Alain Billionnet,et al.  An efficient algorithm for a task allocation problem , 1992, JACM.

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

[24]  Randall Steeb,et al.  Strategies of Cooperation in Distributed Problem Solving , 1983, IJCAI.

[25]  David K. Smith,et al.  Queueing Networks — Exact Computational Algorithms: A United Theory Based on Decomposition and Aggregation , 1991 .

[26]  Ernest Koenigsberg,et al.  Invariance Properties Of Queueing Networks And Their Application To Computer/Communications Systems , 1981 .

[27]  Christopher Stuart.  Synchronization of Multiagent Plans Using a Temporal Logic Theorem Prover , 1985 .

[28]  Bernardo A. Huberman,et al.  The ecology of computation , 1988, Digest of Papers. COMPCON Spring 89. Thirty-Fourth IEEE Computer Society International Conference: Intellectual Leverage.

[29]  Victor R. Lesser,et al.  A One-shot Dynamic Coordination Algorithm for Distributed Sensor Networks , 1993, AAAI.

[30]  Jan Karel Lenstra,et al.  Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

[31]  Edmund H. Durfee,et al.  Distributed Problem Solving and Multi-Agent Systems: Comparisons and Examples* , 1994 .

[32]  Eduardo Alonso Fernández,et al.  Rules of encounter: designing conventions for automated negotiation among computers , 1995 .

[33]  Edmund H. Durfee,et al.  Using Partial Global Plans to Coordinate Distributed Problem Solvers , 1987, IJCAI.

[34]  Tuomas Sandholm,et al.  An Implementation of the Contract Net Protocol Based on Marginal Cost Calculations , 1993, AAAI.

[35]  Wayne L. Winston.  OPTIMALITY OF THE SHORTEST LINE DISCIPLINE , 1977 .

[36]  Wayne L. Winston.  Optimality of the shortest line discipline , 1977, Journal of Applied Probability.

[37]  Nicolas D. Georganas,et al.  Queueing networks - exact computational algorithms: a unified theory based on decomposition and aggregation , 1989, Computer systems.

[38]  A. H. Bond.  An Analysis of Problems and Research in DAI , 1988 .

[39]  J.P.C. Blanc.  A note on waiting times in systems with queues in parallel , 1987 .

[40]  Edward G. Coffman,et al.  Computer and job-shop scheduling theory , 1976 .

[41]  Nicholas R. Jennings,et al.  Controlling Cooperative Problem Solving in Industrial Multi-Agent Systems Using Joint Intentions , 1995, Artif. Intell..

[42]  J. Kingman.  Two Similar Queues in Parallel , 1961 .

[43]  Jeffrey P. Buzen,et al.  Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.

[44]  Ian F. Akyildiz,et al.  Application of Norton's theorem on queueing networks with finite capacities , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[45]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[46]  Kishor S. Trivedi,et al.  Optimal Selection of CPU Speed, Device Capacities, and File Assignments , 1980, JACM.

[47]  Sarit Kraus,et al.  Task Allocation Via Coalition Formation Among Autonomous Agents , 1995, IJCAI.

[48]  B. W. Conolly,et al.  THE AUTOSTRADA QUEUEING PROBLEM , 1984 .

[49]  D Towsley,et al.  Symmetry property of the throughput in closed tandem queueing networks with finite buffers , 1991, Oper. Res. Lett..