首页|A Cooperation Planning Model Based on CNP for Multi-agent MES
A Cooperation Planning Model Based on CNP for Multi-agent MES
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
One of the tasks of the cooperation planning management in a multi-agent MES is to receive and evaluate the cooperative tasks from its partners; another is to find cooperative partners by inviting bids for the unsuitable tasks。 In this way a cooperation plan will be formed。 Also， there are two problems in application of CNP in multi-agent MES: (1) the manager only bids for single task， and evaluates each bid by its own knowledge or model。 However the result of whole cooperation planning doesn't only lie in bidding schemes of single task as the harmonization among tasks is also a determinant; (2) if there are several tasks owned by the manager， with the restricts of capacity， the manager has to assign some tasks to its partners。 Since the result can't be obtained beforehand， the system can't determine the shareable task set so as to optimize utilization of the available the capability。 In this paper， we describe the cooperating process among partners。 Aimed at the problems of CNP in the multi-agent MES， an extended CNP in which the task manager itself may be permitted to bid for tasks is presented。 As a result， optimization space for the cooperation planning is enlarged。 Finally， planning model is described， its genetic algorithm is given and the validity of the model is proved by a case。
NETL
