Coordinated Collaboration of Multiagent Systems Based on Genetic Algorithms

This paper is concerned with coordinated collaboration of multiagent systems in which there exist multiple agents which have their own set of skills to perform some tasks, multiple external resources which can be either used exclusively by an agent or shared by the specified number of agents at a time, and a set of tasks which consist of a collection of subtasks each of which can be carried out by an agent. Even though a subtask can be carried out by several agents, its processing cost may be different depending on which agent performs it. To process tasks, some coordination work is required such as allocating their constituent subtasks among competent agents and scheduling the allocated subtasks to determine their processing order at each agent. This paper proposes a genetic algorithm-based method to coordinate the agents to process tasks in the considered multiagent environments. It also presents some experiment results for the proposed method and discusses the pros and cons of the proposed method.

[1]  Daniel D. Corkill,et al.  Hierarchical Planning in a Distributed Environment , 1979, IJCAI.

[2]  Marie desJardins,et al.  Controlling Communication in Distributed Planning Using Irrelevance Reasoning , 1998, AAAI/IAAI.

[3]  Edmund H. Durfee,et al.  A Survey of Research in Distributed, Continual Planning , 1999, AI Mag..

[4]  Alain Cardon,et al.  Genetic algorithms using multi-objectives in a multi-agent system , 2000, Robotics Auton. Syst..

[5]  Marcel Schoppers,et al.  Universal Plans for Reactive Robots in Unpredictable Environments , 1987, IJCAI.

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

[7]  Philippe Laborie,et al.  Algorithms for propagating resource constraints in AI planning and scheduling: Existing approaches and new results , 2003, Artif. Intell..

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

[9]  L. Darrell Whitley,et al.  A Comparison of Genetic Algorithms for the Static Job Shop Scheduling Problem , 2000, PPSN.

[10]  Craig A. Knoblock Planning, Executing, Sensing, and Replanning for Information Gathering , 1995, IJCAI.

[11]  Melanie Mitchell,et al.  An introduction to genetic algorithms , 1996 .

[12]  Jacek Blazewicz,et al.  Scheduling in Computer and Manufacturing Systems , 1990 .

[13]  Hsiao-Lan Fang,et al.  Genetic algorithms in timetabling and scheduling , 1995 .

[14]  Isao Ono,et al.  An Efficient Genetic Algorithm for Job Shop Scheduling Problems , 1995, International Conference on Genetic Algorithms.

[15]  Gerhard Weiss,et al.  Multiagent systems: a modern approach to distributed artificial intelligence , 1999 .

[16]  David E. Wilkins,et al.  A Multiagent Planning Architecture , 1998, AIPS.

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

[18]  Jacques Ferber,et al.  Multi-agent systems - an introduction to distributed artificial intelligence , 1999 .

[19]  Johann L. Hurink,et al.  Tabu search for the job-shop scheduling problem with multi-purpose machines , 1994 .