Cooperative Multi-Agent System for solving Packet World Problem in Grid

Multi-agent system (MAS) is considered as a branch of distributed systems which has many applications such as e-commerce, transportation system, Web application, and air traffic control. Packet world problem is MAS application used in this research to study the cooperation interaction between agents. This research aims to prove that using cooperative MAS algorithm will solve packet world problem in minimum number of steps, less time, and decrease network consumption. This will minimize processor and memory utilization. Packet world problem is a case study used in literature to study MAS interactions and characteristics. It is an environment consists of multiple agents and packets, whereas they were distributed on different grid machines. The main goal of this problem is cleaning the environment from packets. The proposed work includes cooperative MAS model which consists of two levels, where each level has a specific sub-goal to achieve. Agents at both levels cooperate to achieve the global goal. In the same time the proposed work includes Cooperative MAS algorithm which solve packet world problem efficiently. Different scenarios were tested and the proposed algorithm gave results as enhancement of 84% less in number of steps, 40% less in consumed time and 72% less in network consumption.