多agent系统联盟及任务分配的研究计算机应用技术专业论文.docxVIP

AB AB STRACT Multi-Agent systems becoming increasingly important．Autonomous Agents working in multi—Agent environment may need to cooperate by means of coalition in order to fulfill tasks which can’t be performed by any single Agent．Coalition formation problem is key topic in multi-Agent systems and has received considerable amount of attention in recent years． It is complicated combinatorial optimization problem to search for the optimal，task-oriented Agent coalition for single task．Evolutionary algorithms and swarm intelligent algorithms are widely used to solve the problem．However,the characteristics of the problem have been ignored by the presented research．Therefore，it is both necessary and possible to improve the quality of the algorithms．Another reality is that there are no any deterministic approximation algorithms being proposed tO apply to those occasions where real-time performance is important． Coalition value given by coalition characteristic function is used to measure the quality of a coalition in multi·Agent system．However,both the present capacity vector method and the resource vector method are unsuitable for defining coalition characteristic function． The existing task allocation mechanism based the Contract Network Protocol(CNP)in a multi-Agent system exist some disadvantages such the hiigh network traffic and the low security． And the relative improvements lack comprehensive considerations． The following is the main work and contribution ofthe author： (1)Prior knowledge derived from the characteristics has been used to improve the quality of search of evolutionary algorithms and swarm intelligent algorithms and the results of contrastive experiment show that this improvement is effective(section 2．1)．Furthermore，a greedy algorithm and fast approximation algorithm are presented to apply to some special occasions where real-time performance iS important(section 3．13．2)． (2)FIRE is new,decentralized，and integrated trust and reputation model for Ag