tailieunhanh - Multiagent-Systems 2010 Part 11

Tham khảo tài liệu 'multiagent-systems 2010 part 11', kỹ thuật - công nghệ, cơ khí - chế tạo máy phục vụ nhu cầu học tập, nghiên cứu và làm việc hiệu quả | Agent Oriented Engineering and Methodologies with Application to Production Economical and Social Systems 293 The main problem addressed here is to find such a structure of a set I to maximize a m function Fj defined by 1 . Another way to say we want to find such a structure I u K. i 1 1 n where V i j e 1 m Ki n Kj 0 and FI f max. To resolve completely this task and to find a maximal value of a function FI it is necessary to search the whole space of all possible structures of a set I. The complex searching of all possible structures of a set I can be executed in a variety ways but a complexity of those approaches is the same for every method because every variant have to be examined and for arbitrary n the problem is known to be NP-hard thus it is necessary to turn to heuristic methods to search which are computationally efficient but which might guarantee only sub-optimal solutions from any point of view for example tabu search branch and bound genetic algorithms etc. Generally a quality of those methods strongly depends on how long the process has repeated and a quality of an initial choice. On the other hand each agent presents one independent object with own goals and intelligence and consequently the agent s execution or choice will aim to the best results for the agent therefore naturally each agent might poll such coalitions in which its benefit is the best from its point of view. Furthermore next property of such formulated problem that is easy to verify is that the mentioned problem might be resolved by a recursive approach sequentially for cases with 1 to n agents where each new agent will try to join any formulated coalition afterwards a result of the criterion function FI will be compared with the best one so far. This approach can guarantee the complex searching of the whole space and the final solution certainly will be the globally optimal one. But as we have mentioned above agents choices might influence the searching process a lot because on a .