Contract Net Protocol

About: Contract Net Protocol is a research topic. Over the lifetime, 606 publications have been published within this topic receiving 13729 citations.

The Command Decision Method of Multiple UUV Cooperative Task Assignment Based on Contract Net Protocol@@@The Command Decision Method of Multiple UUV Cooperative Task Assignment Based on Contract Net Protocol

Abstract: With the help of multiple UCAV cooperative task control model, the mathematical model of multiple UUV cooperative task control is made. Variables related to decision are broken into goals, guidelines and programs levels by Analytical Hierarchy Process (AHP), on this basis; the command decision of multiple UUV task assignment is achieved. The correctness of task allocation algorithm is verified by case analysis. Time calculation formulas for a task assignment are given. The changes of overall effectiveness in the process of task allocation are analyzed, the time changes of each sub task allocation time in one task assignment are analyzed, the time changes of the number of tasks and platforms respectively fixed in task allocation are also discussed.

Multi Agent System in Job Shop Scheduling using Contract Net Protocol

Abstract: In this paper, Job shop scheduling problem is solved through multi agent system. An agent based scheduling model is introduced to solve the job shop scheduling problem. Dynamic rescheduling problem is also an important issue in modern manufacturing system with the feature of combinatorial computation complexity. This model improve the job shop scheduling problem and provide the better flexibility to the production system. According to contract net protocol (CNP), agents co-operate with each other through contract net and the process of inviting public bidding makes for computing the production order and dynamic scheduling. The CNP offers negotiation mechanism and agents communication for the decision making in the manufacturing system. This paper proposed model for job shop scheduling as well as problem associated with has been discussed.

Negotiation Protocols for Distributed Nurse Rostering

Abstract: One intricate computational problem still researched today is the Nurse Rostering Problem. Most literature presents different solutions to the local problem, but in recent years the concept of problem decomposition was identified as one way to improve performance. The downside of this is that the quality of separate rosters is much lower than that of a central solution, where personnel can be scheduled in other wards. Some recent papers introduce negotiation as a way to handle crucial problems such as personnel shortages. This contribution presents a method to use negotiation in solving these problems, but at the same time improve the overall quality. A framework for such a system is presented and five different negotiation protocols are compared.

Retractable Contract Network for Distributed Scheduling

Abstract: This paper is about distributed scheduling where individual agents have potentially conflicting interests. It is motivated by BT’s workforce scheduling problem, where multiple service providers have to serve multiple service buyers. The service providers and buyers all attempt to maximize their own utility. The overall problem is a multi-objective optimization problem; for example, one has to maximize completion rates and service quality and minimize travelling distances. In this paper, BT’s problem is modelled as an open constraint optimization system. Standard contract net is a practical strategy in distributed scheduling where agents may have conflicting objectives. In this paper, we have introduced a retractable contract net protocol, which we call RECONNET, that supports hill-climbing in the space of solutions. It is built upon a job-release and compensation mechanism. RECONNET is a general protocol, which could be used to implement complex meta-heuristic algorithms such as Tabu Search and Guided Local Search. A system based on RECONNET has been implemented for BT’s workforce scheduling problem. The software, which we call ASMCR, allows the management to have full control over the company’s multiobjectives. The manager generates a Pareto set of solution by defining, for each buyer and seller, the weights given to each objective. ASMCR gives service buyers and sellers ownership of their problem and freedom to maximize their performance under the criteria defined by the management. ASMCR took 5 to 15 minutes to complete when tested on real-sized problems. It has potential to be developed into practical solutions to BT’s workforce scheduling problem.

A Novel Multi-agent Based Complex Process Control System and Its Application

Abstract: Complex process control systems need a hybrid control mode, which combines hierarchical structure with decentralized control units. Autonomy of agents and cooperation capability between agents in multi-agent system provide basis for realization of the hybrid control mode. A novel multi-agent based complex process control system is proposed. Semantic representation of a control-agent is presented utilizing agent-oriented programming. A novel temporal logic analysis of a control-agent is proposed using Petri nets. Collaboration relationships among control-agents are analyzed based on extended contract net protocol aiming at the lack of reference [1]. Taken pressure control of recycled gas with complicated disturbances as an application, five kinds of control-agents are derived from control-agent. Reachable marking tree and different transition of each derived control-agent are analyzed in detail. Actual running effect indicates multi-agent based hybrid control mode is rationality and flexible. Temporal logic analysis based on Petri nets ensures the reachability of the systems. Extended contract net protocol provides a reasonable realization for collaboration relationships.