1 / 24

Dynamic Social Knowledge: A Comparative Evaluation

Dynamic Social Knowledge: A Comparative Evaluation. This paper presents a comparative evaluation, focused on the number of exchanged massages in the cooperation process, between: Contract Net Protocol Coalition Based on Dependence Dynamic Social Knowledge.

dianne
Télécharger la présentation

Dynamic Social Knowledge: A Comparative Evaluation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Dynamic Social Knowledge: A Comparative Evaluation This paper presents a comparative evaluation, focused on the number of exchanged massages in the cooperation process, between: • Contract Net Protocol • Coalition Based on Dependence • Dynamic Social Knowledge Ma. Victoria Eyharabide

  2. Dynamic Social Knowledge: A Comparative Evaluation The formalization of each of the considered strategies takes into account: • The number of subtasks. • The number of agents. • The number of interaction cycles involved in the cooperation process. For each situation, there is a given goal g that defines a cooperative task J and this task can be split into l subtasks {j1, j2, ..., jl}. The cooperation involves n agents {a1,a2,...,an} Ma. Victoria Eyharabide

  3. Contract Net Protocol The agents involved into the cooperation process belong to a contract net and the execution of a task is decided through contracts established between agents. Roles: • Manager • Contractor Any agent can take on either role dynamically. Ma. Victoria Eyharabide

  4. Contract Net ProtocolThe Cooperation Process The cooperation process consists of four steps: • Goal broadcast • Announcement • Bidding • Awarding A conflict is solved by opening successive contracts to perform the task, each one containing simpler subtasks having lower satisfaction degrees for the task execution. Ma. Victoria Eyharabide

  5. a1 Goal broadcast t a2 Announcement t . . . a3 Bidding . . . t an Awarding . . . t Contract Net ProtocolFormalizing the CNP Best Situation For each of the l subtasks, the first received bid has a satisfactory grade and the contract is immediately awarded to its associated contractor. Ma. Victoria Eyharabide

  6. Contract Net ProtocolFormalizing the CNP Best Situation The number of exchanged messages can be represented by the following expression: MCNP, best = goal broadcast + announcement + bidding + awarding = (n - 1) + (n - 1)L + L + L = (n - 1) (L + 1) + 2L The behaviour depends on: • The number of agents • The number of subtasks Ma. Victoria Eyharabide

  7. a1 Goal broadcast t a2 Announcement t . . . a3 Bidding . . . t an Awarding . . . t Contract Net ProtocolFormalizing the CNP Worst Situation For eachsubtask ji, it is necessary to open wi modified contracts searching for alternatives until a contractor is found to be awarded. Ma. Victoria Eyharabide

  8. Contract Net ProtocolFormalizing the CNP Worst Situation Let w be the mean value of w1, ..., wl MCNP, worst = goal broadcast + announcement + bidding + awarding = (n - 1) + (n - 1)Lw + (n - 1)Lw + L = (n - 1) (2Lw + 1) + L The value of MCNP, worst grows rapidly as the value of w increases. Ma. Victoria Eyharabide

  9. Coalition Based on Dependence The Coalition Based on Dependence uses the dependence relationship between agents to guide the formation of a coalition able to perform a collective task. A negotiation strategy is used to solve conflicts about goals, plans and task allocation. Such negotiation strategy is a process by which a joint decision is made by two or more parties. Ma. Victoria Eyharabide

  10. Coalition Based on Dependence The Cooperation Process The cooperation process can be described in four steps: • Goal broadcast • Presentation • Negotiation cycle • Agreement Ma. Victoria Eyharabide

  11. a1 Goal broadcast t a2 Presentation t . . . a3 Negotiation . . . t an Agreement . . . t Coalition Based on Dependence Formalizing the CBD Best Situation After the presentation, for each of the l subtasks, the agent chooses another agent to do a coalition, sends one proposal and this agent agrees with it. Ma. Victoria Eyharabide

  12. Coalition Based on Dependence Formalizing the CBD Best Situation MCBD, best = goal broadcast + presentation + negotiation + agreement = (n - 1) + n(n - 1) + 2L + L = (n2 - 1) + 3L Because of the communication overhead represented by the presentation step, where the number of messages grows with the square of the number agents, the value of MCBD, best is always greater than the corresponding value of MCNP, best Ma. Victoria Eyharabide

  13. a1 Goal broadcast t a2 Presentation t ... a3 Negotiation ... t an Agreement ... t Coalition Based on Dependence Formalizing the CBD Worst Situation For each subtask ji, wi proposals are exchanged in the search for alternatives or possible concessions in order to achieve an agreement. Ma. Victoria Eyharabide

  14. Coalition Based on Dependence Formalizing the CBD Worst Situation MCBD, worst = goal broadcast + presentation + negotiation + agreement = (n - 1) + n(n - 1) + 2nLw + L = (n2 - 1) + L(2nw + 1) For the same values of w,MCBD, worst lies always over MCNP, worst . Ma. Victoria Eyharabide

  15. Dynamic Social Knowledge • Split the task into subtasks. • Use contract announcements in order to find adequate contractors to handle these subtasks. • if(no subset of the contracts satisfying the goal can be awarded) • The information about the bids is stored in a knowledge base. • Using this knowledge base, a rule-based system infers the best way for driving the cooperation process. Ma. Victoria Eyharabide

  16. Dynamic Social Knowledge • Contract Frame:is a data structure designed to store all the information involved in the cooperation process. It is composed by: • One goal. • A group of agents. • A degree of satisfaction for the goal. • A deadline. • A set of possible contracts. • Dynamic Social Knowledge Base:is a knowledge base built dynamically. It relates the information stored into the contract frame to the information available from the received bids. Ma. Victoria Eyharabide

  17. Dynamic Social Knowledge The Cooperation Process For each cooperative task: • A contract frame is opened. • A contract process is opened for each member of the contract set. • The involved agents will accept or refuse the subtask. • If (the agent sent a proposal accepting) The proposal has a grade expressing how well the agent could perform the subtask. Ma. Victoria Eyharabide

  18. Dynamic Social Knowledge The Cooperation Process • The agent keeps accepting proposals until one of the following situations occurs: • Situation 1: A subset of contracts, able to satisfy the goal, has received satisfactory bids, so these contracts are awarded. • Situation 2: The agent has received proposals to all the contract processes but no subset, able to satisfy the goal, has received satisfactory bids. • The received proposals are used to build a DSK base. • Situation 3: The deadline has expired. • The received proposals are used to build a DSK base. Ma. Victoria Eyharabide

  19. Dynamic Social Knowledge The Cooperation Process In situations 2 and 3, according to: • The knowledge in the DSK base • Local agent knowledge • A set of specially designed rules bases The execution of a rule-based system may indicate: 1 .- A winner group that together can perform the subtasks needed. 2 .- The degree of satisfaction of the contract frame should be reduced, in such a way that a group of winners can be found. 3 .- A new contract set should be chosen and a new round of interaction should be open. 4 .- The cooperation process should be closed without awarding. Ma. Victoria Eyharabide

  20. a1 Goal broadcast t a2 Announcement t . . . a3 Bidding . . . t an Awarding . . . t Dynamic Social Knowledge Formalizing the DSK Best Situation The best situation happens when there is a subset CS of the contract set able to achieve the goal, and for all the ci in Cs, there is some bid able to be awarded with the respective contract. Ma. Victoria Eyharabide

  21. Dynamic Social Knowledge Formalizing the DSK Best Situation The amount of exchanged messages can be given by the following expression, where LDSK = aL: MDSK, best = goal broadcast + announcement + bidding + awarding = (n - 1) + (n - 1) LDSK + LDSK + LDSK = (n - 1) (aL + 1) + 2aL Here the subtasks are not directly assigned to a contract like in CNP, they are first processed by a ruled-based system in order to generate the contract set. When J contains duplicate subtasks, the DSK strategy assigns only one contract to all duplicate subtasks, resulting in a < 1 and consequently MDSK, best < MCNP, best Ma. Victoria Eyharabide

  22. a1 Goal broadcast t a2 Announcement t . . . a3 Bidding . . . t an Awarding . . . t Dynamic Social Knowledge Formalizing the DSK Worst Situation The worst case happens when none of the contracts allow the agents to achieve the goal, the DSK base is built and w negotiation rounds are necessary to conclude. Ma. Victoria Eyharabide

  23. Dynamic Social Knowledge Formalizing the DSK Worst Situation MDSK, worst = goal broadcast + announcement + bidding + awarding = (n - 1) + (n - 1) LDSK + (n - 1) LDSK + 2w + LDSK = (n - 1) (2aL + 1) + 2w + aL The number of repeated contracts, w, can be: Ma. Victoria Eyharabide

  24. Conclusions • The Dynamic Social Knowledge exposes a good balance between: • The amount of social knowledge used to drive the cooperation strategy. • The amount of interaction cycles involved in the cooperation process. • The use of rule-based inference allows alternative ways to perform a given task to be searched in parallel, instead of sequentially, which is crucial to reduce: • The amount of exchanged messages. • The cooperation convergence time. Ma. Victoria Eyharabide

More Related