Designing Agent Societies

Slides:



Advertisements
Similar presentations
1 Retransmission Repeat: Simple Retransmission Permutation Can Resolve Overlapping Channel Collisions Li (Erran) Li Bell Labs, Alcatel-Lucent Joint work.
Advertisements

The Enterprise Skills Story
Planning.
Practical Planning: Scheduling and Hierarchical Task Networks Chapter CS 63 Adapted from slides by Tim Finin and Marie desJardins.
REVIEW : Planning To make your thinking more concrete, use a real problem to ground your discussion. –Develop a plan for a person who is getting out of.
Language for planning problems
1 Planning Chapter CMSC 471 Adapted from slides by Tim Finin and Marie desJardins. Some material adopted from notes by Andreas Geyer-Schulz,
What is Design?. Engineering design is the communication of a set of rational decisions obtained with creative problem solving for accomplishing certain.
Risk Modeling The Tropos Approach PhD Lunch Meeting 07/07/2005 Yudistira Asnar –
Planning Module THREE: Planning, Production Systems,Expert Systems, Uncertainty Dr M M Awais.
Planning Module THREE: Planning, Production Systems,Expert Systems, Uncertainty Dr M M Awais.
SHOP2: An HTN Planning System Nau, D.S., Au, T.C., Ilghami, O., Kuter, U., Murdock, J.W., Wu, D. and Yaman, F. (2003) "SHOP2: An HTN Planning System",
CLASSICAL PLANNING What is planning ?  Planning is an AI approach to control  It is deliberation about actions  Key ideas  We have a model of the.
1 CMSC 471 Fall 2002 Class #6 – Wednesday, September 18.
Learning Objectives Use the properties of equality to solve multistep equations of one unknown Apply the process of solving multistep equations to solve.
Best-First Search: Agendas
1 Chapter 16 Planning Methods. 2 Chapter 16 Contents (1) l STRIPS l STRIPS Implementation l Partial Order Planning l The Principle of Least Commitment.
Planning under Uncertainty
CPSC 322, Lecture 19Slide 1 Propositional Logic Intro, Syntax Computer Science cpsc322, Lecture 19 (Textbook Chpt ) February, 23, 2009.
Planning II GraphPlan and Russell and Norvig: ch.12 CMSC421 – Fall 2006 based on material from Jim Blythe, JC Latombe, Marie desJardins and Daphne Koller.
Artificial Intelligence Chapter 11: Planning
1 Planning. R. Dearden 2007/8 Exam Format  4 questions You must do all questions There is choice within some of the questions  Learning Outcomes: 1.Explain.
Chapter 2 Succeeding as a Systems Analyst
Penalties for Distributed Local Search Muhammed B. Basharu.
TRADING AGENT Developers: Vadim Ratner Dan Baum Supervisor: Ishay Menache.
7M822 UML Interaction Diagrams 25 November 2010.
1 Planning Chapters 11 and 12 Thanks: Professor Dan Weld, University of Washington.
Classical Planning Chapter 10.
Arithmetic Sequences and Series. A sequence is arithmetic if each term – the previous term = d where d is a constant e.g. For the sequence d = 2 nd term.
Software Development using artificial markets of constructively egoistic agents Karl Lieberherr 1SD-F09.
Homework 1 ( Written Portion )  Max : 75  Min : 38  Avg : 57.6  Median : 58 (77%)
Overview Introduction Registration 21 st Century skills Computer Basics and the Internet Word Processing Multimedia(Powerpoint )
Applying Tropos to Socio-Technical System Design and Runtime Configuration Fabiano Dalpiaz, Raian Ali, Yudistira Asnar, Volha Bryl, Paolo Giorgini Dipartimento.
Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.
Presentation to NFE working group 30 August 2013.
Planning, page 1 CSI 4106, Winter 2005 Planning Points Elements of a planning problem Planning as resolution Conditional plans Actions as preconditions.
Software Development using artificial markets of constructively egoistic agents Karl Lieberherr 1SD-F09.
ALGORITHM CHAPTER 8. Chapter Outlines and Objectives  Define an algorithm and relate it to problem solving.  Define three construct and describe their.
The Evolution of ICT-Based Learning Environments: Which Perspectives for School of the Future? Reporter: Lee Chun-Yi Advisor: Chen Ming-Puu Bottino, R.
Copyright ©2004 Virtusa Corporation | CONFIDENTIAL Business Modeling with UML Virtusa Training Group (2005) Trainer: Ojitha Kumanayaka Duration: 1 hours.
Technology & Engineering
1 What is Game Theory About? r Analysis of situations where conflict of interests is present r Goal is to prescribe how conflicts can be resolved 2 2 r.
AI Lecture 17 Planning Noémie Elhadad (substituting for Prof. McKeown)
Automating DAML-S Web Services Composition Using SHOP2 Based on an article by Dan Wu, Bijan Parsia, Evren Sirin, James Hendler and Dana Nau in Proceedings.
Next Generation Science Standards “Taking the Steps to Implement NGSS” March 29, 2013 TEEAM Conference.
Introduction to State Space Search
1 CMSC 471 Fall 2002 Class #24 – Wednesday, November 20.
Planning I: Total Order Planners Sections
Discuss the analytical skills, including systems thinking, needed for a systems analyst to be successful Describe the technical skills required of a systems.
Search as a problem solving technique. Consider an AI program that is capable of formulating a desired goal based on the analysis of the current world.
EIGHTH GRADE MATH FINAL REVIEW Evaluate each expression for the given values of the variables. 1. 6x + 9 for x = 3 2. x + 14 for x = x + 3y.
Engineering design is the process of devising a system, component, or process to meet desired needs. It is a decision-making process (often iterative),
How to be an effective manager? By Philemon Mugisha.
CLASSICAL PLANNING. Outline  The challenges in planning with standard search algorithm  Representing Plans – the PDDL language  Planning as state -
SECURE TROPOS Michalis Pavlidis 8 May Seminar Agenda  Secure Tropos  History and Foundation  Tropos  Basics  Secure Tropos  Concepts / Modelling.
Model Checking Early Requirements Specifications in Tropos Presented by Chin-Yi Tsai.
2.3 Solving Multi-Step Equations
Planning as Satisfiability
Section 3.4 – Combinations of Functions
4-6 Formulizing Relations and Functions
Problem Reduction -AND-OR Graph -AO* Search CSE 402 K3R23/K3R20.
SAT-Based Area Recovery in Technology Mapping
Tools, Materials and Organisation
CIS 488/588 Bruce R. Maxim UM-Dearborn
Engineering design is the process of devising a system, component, or process to meet desired needs. It is a decision-making process in which the basic.
Class #20 – Wednesday, November 5
Market-based Dynamic Task Allocation in Mobile Surveillance Systems
This Lecture Substitution model
4 minutes Warm-Up Solve..
Presentation transcript:

Designing Agent Societies Volha Bryl PhD student ICT, DIT bryl@dit.unitn.it

Agent Society + collaboration (through delegation) - competitive goals … - competitive goals Agent … Goals Capabilities Society member’s objective: use others capabilities to achieve personal goals … …

Problem Find optimal assignments: satisfy all goals of all agents or reach an compromise?

Formalization (1) Two types: Actors and Goals Goals: an actor wants a goal to be satisfied Capabilities: an actor can satisfy a goal Communication: an actor can pass (or delegate) a goal to another actor

Formalization (2) Goals can be decomposed into subgoals Only one possible decomposition Goal is satisfied iff all its subgoals are satisfied Decomposition can be performed by any actor Decomposition is actor-independent

Formalization (3) Three basic actions: an actor satisfies a goal an actor passes (or delegates) a goal to another actor an actor decomposes a goal into subgoals Solution is a list of actions that should be executed to satisfy all initial goals of all actors (or to reach an equilibrium)

Idea PLANNING Let’s look at which is in AI “the problem of finding a sequence of primitive actions to achieve some goal”

Planning problem we need to formalize actions an action has precondition and effect precondition and effect can be represented as conjunction or disjunction (for precondition only) of predicates or their negations

Planning problem. Predicates Actor’s capabilities can_satisfy (a – actor, g – goal) can_depend_on (a1 – actor, a2 – actor) Actor’s initial desires wants (a – actor, g – goal) Possible decomposition of goals can_be_decomposed (g – goal, g1 – goal, g2 – goal, …)

Planning problem. Actions 1) Satisfies (a – actor, g – goal) precondition (and can_satisfy (a, g) wants (a, g) ) effect (and done (g)* not (wants(a,g) ) * done (g – goal) is an additional predicate which means “goal g is satisfied, no one wants it anymore”

Planning problem. Actions 2) Decomposes* (a – actor, g – goal, g1 – goal, g2 – goal) precondition (and can_be_decomposed (g, g1, g2) wants (a, g) ) effect (and wants(a,g1) wants(a,g2) not (wants(a,g) ) * can be extended to more than two actions

Planning problem. Actions 3) Passes (a1 – actor, g – goal, a1 – actor) precondition (and can_depend_on (a1, a2) wants (a1, g) ) effect (and wants(a2, g) not (wants(a1, g) )

Planning problem. Intuition (1) wants are propagated through the graph and then eliminated – become done Decomposes (A, G, G1, G2) wants (A, G) wants (A, G1) wants (A, G2)

Planning problem. Intuition (2) wants are propagated through the graph and then eliminated – become done Passes (G, A, B) wants (A, G) wants (B, G) wants (A, G) Satisfies (A, G) done (G)

Example. Informal formulation I want to go to the conference We can help to get the reimbursement …to go there means: buy a ticket and get reimbursement Professor I can buy a ticket I can ask accounting office for help Accounting office

Example. PDDL formulation (define (problem example)    (:domain tropos-domain)     (:objects         Professor Accounting_office - t_actor         Go_to_conference Get_reimbursement Buy_ticket - t_goal      )     (:goal (and         (done Go_to_conference)     ) )     (:init         (can_do Accounting_office Get_reimbursement )         (can_do Professor Buy_ticket )         (can_depend_on Professor Accounting_office )         (wants Professor Go_to_conference )         (and_subgoal2 Go_to_conference Buy_ticket Get_reimbursement )      )

Example. Using the tool

Example. Using the tool

Example. Solution pass [professor, get-reimbursement, accounting-office] decomposes [professor, go-to-conference, buy-ticket, get-reimbursement] performs [professor, buy-ticket] performs [accounting-office, get-reimbursement]

Big example. Description I know English I need to write a letter to the UK embassy 1st Secretary I can use printer …to write a letter means: type, print and certify it with stamp and boss’s signature Boss 2nd Secretary I have an official stamp I can only sign letters… 3rd Secretary

Big example. Solution decomposes [boss, write-letter, send-letter, type-letter-in-english] decomposes [boss, send-letter, certify-letter, print-letter] pass [boss, type-letter-in-english, secretary-1] pass [boss, print-letter, secretary-1] performs [secretary-1, type-letter-in-english] decomposes [boss, certify-letter, stamp-letter, sign-letter] pass [boss, stamp-letter, secretary-1] performs [boss, sign-letter] pass [secretary-1, print-letter, secretary-2] performs [secretary-2, print-letter] pass [secretary-1, stamp-letter, secretary-2] pass [secretary-2, stamp-letter, secretary-3] performs [secretary-3, stamp-letter] combines [certify-letter, stamp-letter, sign-letter] combines [send-letter, certify-letter, print-letter] combines [write-letter, send-letter, type-letter-in-english]

Big example. Solution

Summing up… two views We have different views on the problem Cooperation in multi-agent communities (strategic games) Analyzing requirements These views might be though as different application areas of the proposed solution

Summing up… or what we do not have We need iterative solution building (iteration by imposing constraints on next solution) We need “partial” solution (compromise or equilibrium) and its evaluation We need the possibility of introducing new actors during the solution building