200 likes | 364 Views
Individual Plans from Team Plans using Petri Nets. Afiya Kassim-100307450 akassim@connect.carleton.ca Presentation based on paper: From Team Plan to Individual Plans: a Petri Net-based Approach, Bonnet-Torres and Tessier, in AAMAS’05, Netherlands, pg 797-804, 2005. Outline. Introduction
E N D
Individual Plans from Team Plans using Petri Nets • Afiya Kassim-100307450 • akassim@connect.carleton.ca • Presentation based on paper: From Team Plan to Individual Plans: a Petri Net-based Approach, Bonnet-Torres and Tessier, in AAMAS’05, Netherlands, pg 797-804, 2005. SYSC 5103-Software Agents Nov 22, 2005
Outline • Introduction • Notion of Agenticity • Team Plans • Abstracting the Team Plan • Example • Conclusion SYSC 5103-Software Agents Nov 22, 2005
Introduction • Motivation: Team planning is a difficult problem • Framework for representing a team plan • Projection of team plan on individual agents • This paper addresses the notion of activity planning using petri-nets SYSC 5103-Software Agents Nov 22, 2005
Agenticity Hierarchy Agents implemented to carry out the mission are organized hierarchically in a team Agenticity Hierarchy(depth of the agent in the hierarchy) SYSC 5103-Software Agents Nov 22, 2005
Degree of an Agent • Degree is the largest agenticity of the individual agents that belong to this agent • An elementary agent has a degree of zero SYSC 5103-Software Agents Nov 22, 2005
Goals • An elementary goal is one such that there is a specification of the course of actions to be performed by an agent(composite or individual), resulting in the achievement of the goal SYSC 5103-Software Agents Nov 22, 2005
Team Plan • A team plan is designed in terms of a detailed sequence of tasks, represented as a petri-net Source(Introduction of agents) and Sink(Removal of agents) SYSC 5103-Software Agents Nov 22, 2005
Analysing Team Plan Fork Join Rearrange SYSC 5103-Software Agents Nov 22, 2005
Analysing Team Plan Transfer Choice SYSC 5103-Software Agents Nov 22, 2005
Rules for Abstracting the Team Plan Reduction of Late Arrival • Preserves the level of agenticity • Token is modified to encompass the newly introducedagent SYSC 5103-Software Agents Nov 22, 2005
Rules Cont’d Reduction of Early Withdrawal • Preserves the level of agenticity • Token is modified SYSC 5103-Software Agents Nov 22, 2005
Rules Cont’d Fusion of Consecutive Activities • Transposition of thesubstitution rule for consecutive places in ordinary Petri nets • Preserves the level of agenticity • Token is not modified SYSC 5103-Software Agents Nov 22, 2005
Rules Cont’d Fusion of Choice Between Activities • Preserves the level of agenticity • Token is modified to bear the different possible • agenticity sub-hierarchies • Agent is tagged showing there are multiple possible • organising structures SYSC 5103-Software Agents Nov 22, 2005
Rules Cont’d Fusion of Parallel Activities • Derived from the implicit place suppression rule in • ordinary Petri nets • Decreases the level of agenticity • Token is modified SYSC 5103-Software Agents Nov 22, 2005
Rules Cont’d • Preserves the level of agenticity • Tokens are modified • Pt is split rule 1 and rule 2 is • then applied on the two separate • branches Reduction of Agent Transfer SYSC 5103-Software Agents Nov 22, 2005
Example Team Plan SYSC 5103-Software Agents Nov 22, 2005
Example Reduction of Team Plan SYSC 5103-Software Agents Nov 22, 2005
Projection of the Team Plan on agent d SYSC 5103-Software Agents Nov 22, 2005
Conclusion • No discussion on team plan creation • How tokens are created or modified? • Future work: Handling re-planning within the team in the event of a failure or an external action SYSC 5103-Software Agents Nov 22, 2005
References • O. Bonnet-Torres, C. Tessier. “From Team Plan to Individual Plans: a Petri Net-based Approach”, In AAMAS’05, Utrecht, Netherlands, 797-804, July 2005. SYSC 5103-Software Agents Nov 22, 2005