Multi-Agent Systems: Overview and Research Directions

Slides:



Advertisements
Similar presentations
BEHAVIORAL RESEARCH IN MANAGERIAL ACCOUNTING RANJANI KRISHNAN HARVARD BUSINESS SCHOOL & MICHIGAN STATE UNIVERSITY 2008.
Advertisements

ARCHITECTURES FOR ARTIFICIAL INTELLIGENCE SYSTEMS
Collaboration Mechanisms in SOA based MANETs. Introduction Collaboration implies the cooperation between the nodes to support the proper functioning of.
Nash’s Theorem Theorem (Nash, 1951): Every finite game (finite number of players, finite number of pure strategies) has at least one mixed-strategy Nash.
Computer-aided mechanism design Ye Fang, Swarat Chaudhuri, Moshe Vardi 1.
Some questions o What are the appropriate control philosophies for Complex Manufacturing systems? Why????Holonic Manufacturing system o Is Object -Oriented.
CROWN “Thales” project Optimal ContRol of self-Organized Wireless Networks WP1 Understanding and influencing uncoordinated interactions of autonomic wireless.
Multi-Agent Systems: Overview and Research Directions CMSC 477/677 Spring 2005 Prof. Marie desJardins.
Game-Theoretic Approaches to Multi-Agent Systems Bernhard Nebel.
Distributed Rational Decision Making Sections By Tibor Moldovan.
Towards A Multi-Agent System for Network Decision Analysis Jan Dijkstra.
Aeronautics & Astronautics Autonomous Flight Systems Laboratory All slides and material copyright of University of Washington Autonomous Flight Systems.
Outline Definition Issues and elements of MAS Applications
CMSC 477/677 Agent Architectures and Multi-Agent Systems UMBC Prof. Marie desJardins Spring 2005.
A Framework for Distributed Model Predictive Control
Team Formation between Heterogeneous Actors Arlette van Wissen Virginia Dignum Kobi Gal Bart Kamphorst.
L 9 : Collaborations Why? Terminology Coherence Coordination Reference s :
Standard and Extended Form Games A Lesson in Multiagent System Based on Jose Vidal’s book Fundamentals of Multiagent Systems Henry Hexmoor, SIUC.
ARTIFICIAL INTELLIGENCE [INTELLIGENT AGENTS PARADIGM] Professor Janis Grundspenkis Riga Technical University Faculty of Computer Science and Information.
CMSC 491M/691M Agent Architectures and Multi-Agent Systems UMBC Prof. Marie desJardins Spring 2003.
CMSC 691M Agent Architectures & Multi- Agent Systems UMBC Prof. Marie desJardins Spring 2002.
University of Windsor School of Computer Science Topics in Artificial Intelligence Fall 2008 Sept 11, 2008.
Multi-Agent Systems: Overview and Research Directions CMSC 477/677 March 15, 2005 Prof. Marie desJardins.
Algorithmic, Game-theoretic and Logical Foundations
Introduction of Intelligent Agents
Distributed Models for Decision Support Jose Cuena & Sascha Ossowski Pesented by: Gal Moshitch & Rica Gonen.
How to Analyse Social Network? : Part 2 Game Theory Thank you for all referred contexts and figures.
CMSC 100 Multi-Agent Game Day Professor Marie desJardins Tuesday, November 20, 2012 Tue 11/20/12 1 Multi-Agent Game Day.
Multi-Agent Systems: Overview and Research Directions CMSC 671 – Class #26 December 1, 2005 Prof. Marie desJardins.
Learning for Physically Diverse Robot Teams Robot Teams - Chapter 7 CS8803 Autonomous Multi-Robot Systems 10/3/02.
Multi-Agent Systems: Overview and Research Directions CMSC 471 March 11, 2014 Prof. Marie desJardins.
CMSC 477/677 Agent Architectures and Multi-Agent Systems UMBC Prof. Marie desJardins Spring 2007.
Intelligent Agents Chapter 2. How do you design an intelligent agent? Definition: An intelligent agent perceives its environment via sensors and acts.
Dynamics of Competition Between Incumbent and Emerging Network Technologies Youngmi Jin (Penn) Soumya Sen (Penn) Prof. Roch Guerin (Penn) Prof. Kartik.
Intelligent Agents: Technology and Applications Unit Five: Collaboration and Task Allocation IST 597B Spring 2003 John Yen.
Computing Shapley values, manipulating value division schemes, and checking core membership in multi-issue domains Vincent Conitzer, Tuomas Sandholm Computer.
Foundations of Group Behavior Week 6 lecture 11,12.
Game Theory By Ben Cutting & Rohit Venkat.
Microeconomics 1000 Lecture 13 Oligopoly.
Management support systems II
Intermediate Microeconomics
Organizational Structure and Controls
Algorithms and Problem Solving
Multi-Agent Systems: Overview and Research Directions
Chapter 14 Managing Teams.
Exchange Chapter 31 Niklas Jakobsson Click to add notes.
Autonomous Agents and Self Organization
What is Management? Management: The planning, organizing, leading, and controlling of human and other resources to achieve organizational goals effectively.
Chapter 11: Artificial Intelligence
Chapter 11: Artificial Intelligence
Chapter 10 Understanding Work Teams
TÆMS-based Execution Architectures
An Investigation of Market Dynamics and Wealth Distributions
Chapter 8: Foundations of Planning
Organizational Structure and Controls
Intelligent Agents Chapter 2.
Chapter 1 The Systems Development Environment
Organization Structure and Management Systems
© James D. Skrentny from notes by C. Dyer, et. al.
Chapter 14 Managing Teams.
Public Policy Process An Introduction.
CIS 488/588 Bruce R. Maxim UM-Dearborn
Learning 6.2 Game Theory.
The use of Neural Networks to schedule flow-shop with dynamic job arrival ‘A Multi-Neural Network Learning for lot Sizing and Sequencing on a Flow-Shop’
Chapter 1: Introduction to Systems Analysis and Design
Market-based Dynamic Task Allocation in Mobile Surveillance Systems
UNIT II: The Basic Theory
Introduction to Artificial Intelligence Instructor: Dr. Eduardo Urbina
Chapter 34 Welfare Key Concept: Arrow’s impossibility theorem, social welfare functions Limited support of how market preserves fairness.
Presentation transcript:

Multi-Agent Systems: Overview and Research Directions CMSC 671 December 1, 2010 Prof. Marie desJardins

MAS Research Directions Outline What’s an Agent? Multi-Agent Systems Cooperative multi-agent systems Competitive multi-agent systems MAS Research Directions Organizational structures Communication limitations Learning in multi-agent systems

What’s an Agent?

What’s an agent? Weiss, p. 29 [after Wooldridge and Jennings]: “An agent is a computer system that is situated in some environment, and that is capable of autonomous action in this environment in order to meet its design objectives.” Russell and Norvig, p. 7: “An agent is just something that perceives and acts.” Rosenschein and Zlotkin, p. 4: “The more complex the considerations that [a] machine takes into account, the more justified we are in considering our computer an ‘agent,’ who acts as our surrogate in an automated encounter.”

What’s an agent? II Ferber, p. 9: “An agent is a physical or virtual entity Which is capable of acting in an environment, Which can communicate directly with other agents, Which is driven by a set of tendencies…, Which possesses resources of its own, Which is capable of perceiving its environment…, Which has only a partial representation of this environment…, Which possesses skills and can offer services, Which may be able to reproduce itself, Whose behavior tends towards satisfying its objectives, taking account of the resources and skills available to it and depending on its perception, its representations and the communications it receives.”

OK, so what’s an environment? Isn’t any system that has inputs and outputs situated in an environment of sorts?

What’s autonomy, anyway? Jennings and Wooldridge, p. 4: “[In contrast with objects, we] think of agents as encapsulating behavior, in addition to state. An object does not encapsulate behavior: it has no control over the execution of methods – if an object x invokes a method m on an object y, then y has no control over whether m is executed or not – it just is. In this sense, object y is not autonomous, as it has no control over its own actions…. Because of this distinction, we do not think of agents as invoking methods (actions) on agents – rather, we tend to think of them requesting actions to be performed. The decision about whether to act upon the request lies with the recipient.” Is an if-then-else statement sufficient to create autonomy?

So now what? If those definitions aren’t useful, is there a useful definition? Should we bother trying to create “agents” at all?

Multi-Agent Systems

Multi-agent systems Jennings et al.’s key properties: Situated Autonomous Flexible: Responsive to dynamic environment Pro-active / goal-directed Social interactions with other agents and humans Research questions: How do we design agents to interact effectively to solve a wide range of problems in many different environments?

Aspects of multi-agent systems Cooperative vs. competitive Homogeneous vs. heterogeneous Macro vs. micro Interaction protocols and languages Organizational structure Mechanism design / market economics Learning

Topics in multi-agent systems Cooperative MAS: Distributed problem solving: Less autonomy Distributed planning: Models for cooperation and teamwork Competitive or self-interested MAS: Distributed rationality: Voting, auctions Negotiation: Contract nets

Typical (cooperative) MAS domains Distributed sensor network establishment Distributed vehicle monitoring Distributed delivery

Distributed sensing Track vehicle movements using multiple sensors Distributed sensor network establishment: Locate sensors to provide the best coverage Centralized vs. distributed solutions Distributed vehicle monitoring: Control sensors and integrate results to track vehicles as they move from one sensor’s “region” to another’s

Distributed delivery Logistics problem: move goods from original locations to destination locations using multiple delivery resources (agents) Dynamic, partially accessible, nondeterministic environment (goals, situation, agent status) Centralized vs. distributed solution

Cooperative Multi-Agent Systems

Distributed problem solving/planning Cooperative agents, working together to solve complex problems with local information Partial Global Planning (PGP): A planning-centric distributed architecture SharedPlans: A formal model for joint activity Joint Intentions: Another formal model for joint activity STEAM: Distributed teamwork; influenced by joint intentions and SharedPlans

Distributed problem solving Problem solving in the classical AI sense, distributed among multiple agents That is, formulating a solution/answer to some complex question Agents may be heterogeneous or homogeneous DPS implies that agents must be cooperative (or, if self-interested, then rewarded for working together)

Requirements for cooperative activity (Grosz) -- “Bratman (1992) describes three properties that must be met to have ‘shared cooperative activity’: Mutual responsiveness Commitment to the joint activity Commitment to mutual support”

Joint intentions Theoretical framework for joint commitments and communication Intention: Commitment to perform an action while in a specified mental state Joint intention: Shared commitment to perform an action while in a specified group mental state Communication: Required/entailed to establish and maintain mutual beliefs and join intentions

SharedPlans SharedPlan for group action specifies beliefs about how to do an action and subactions Formal model captures intentions and commitments towards the performance of individual and group actions Components of a collaborative plan (p. 5): Mutual belief of a (partial) recipe Individual intentions-to perform the actions Individual intentions-that collaborators succeed in their subactions Individual or collaborative plans for subactions Very similar to joint intentions

STEAM: Now we’re getting somewhere! Implementation of joint intentions theory Built in Soar framework Applied to three “real” domains Many parallels with SharedPlans General approach: Build up a partial hierarchy of joint intentions Monitor team and individual performance Communicate when need is implied by changing mental state & joint intentions Key extension: Decision-theoretic model of communication selection

Competitive Multi-Agent Systems

Distributed rationality Techniques to encourage/coax/force self-interested agents to play fairly in the sandbox Voting: Everybody’s opinion counts (but how much?) Auctions: Everybody gets a chance to earn value (but how to do it fairly?) Contract nets: Work goes to the highest bidder Issues: Global utility Fairness Stability Cheating and lying

Pareto optimality S is a Pareto-optimal solution iff S’ (x Ux(S’) > Ux(S) → y Uy(S’) < Uy(S)) i.e., if X is better off in S’, then some Y must be worse off Social welfare, or global utility, is the sum of all agents’ utility If S maximizes social welfare, it is also Pareto-optimal (but not vice versa) Which solutions are Pareto-optimal? Y’s utility Which solutions maximize global utility (social welfare)? X’s utility

Stability If an agent can always maximize its utility with a particular strategy (regardless of other agents’ behavior) then that strategy is dominant A set of agent strategies is in Nash equilibrium if each agent’s strategy Si is locally optimal, given the other agents’ strategies No agent has an incentive to change strategies Hence this set of strategies is locally stable

Let's play! Prisoner’s Dilemma Cooperate Defect 3, 3 0, 5 5, 0 1, 1 B

Prisoner’s Dilemma: Analysis Pareto-optimal and social welfare maximizing solution: Both agents cooperate Dominant strategy and Nash equilibrium: Both agents defect Cooperate Defect 3, 3 0, 5 5, 0 1, 1 B A Why?

Voting How should we rank the possible outcomes, given individual agents’ preferences (votes)? Six desirable properties (which can’t all simultaneously be satisfied): Every combination of votes should lead to a ranking Every pair of outcomes should have a relative ranking The ranking should be asymmetric and transitive The ranking should be Pareto-optimal Irrelevant alternatives shouldn’t influence the outcome Share the wealth: No agent should always get their way 

Voting protocols Plurality voting: the outcome with the highest number of votes wins Irrelevant alternatives can change the outcome: The Ross Perot factor Borda voting: Agents’ rankings are used as weights, which are summed across all agents Agents can “spend” high rankings on losing choices, making their remaining votes less influential Binary voting: Agents rank sequential pairs of choices (“elimination voting”) Irrelevant alternatives can still change the outcome Very order-dependent

Auctions Many different types and protocols All of the common protocols yield Pareto-optimal outcomes But… Bidders can agree to artificially lower prices in order to cheat the auctioneer What about when the colluders cheat each other? (Now that’s really not playing nicely in the sandbox!)

Contract nets Simple form of negotiation Announce tasks, receive bids, award contracts Many variations: directed contracts, timeouts, bundling of contracts, sharing of contracts, … There are also more sophisticated dialogue-based negotiation models

MAS Research Directions

Agent organizations “Large-scale problem solving technologies” Multiple (human and/or artificial) agents Goal-directed (goals may be dynamic and/or conflicting) Affects and is affected by the environment Has knowledge, culture, memories, history, and capabilities (distinct from individual agents) Legal standing is distinct from single agent Q: How are MAS organizations different from human organizations?

Organizational structures Exploit structure of task decomposition Establish “channels of communication” among agents working on related subtasks Organizational structure: Defines (or describes) roles, responsibilities, and preferences Use to identify control and communication patterns: Who does what for whom: Where to send which task announcements/allocations Who needs to know what: Where to send which partial or complete results

Theoretical models: Speech act theory Practical models: Communication models Theoretical models: Speech act theory Practical models: Shared languages like KIF, KQML, DAML Service models like DAML-S Social convention protocols

Communication strategies Send only relevant results at the right time Conserve bandwidth, network congestion, computational overhead of processing data Push vs. pull Reliability of communication (arrival and latency of messages) Use organizational structures, task decomposition, and/or analysis of each agent’s task to determine relevance

Communication structures Connectivity (network topology) strongly influences the effectiveness of an organization Changes in connectivity over time can impact team performance: Move out of communication range  coordination failures Changes in network structure  reduced (or increased) bandwidth, increased (or reduced) latency

Learning in MAS Emerging field to investigate how teams of agents can learn individually and as groups Distributed reinforcement learning: Behave as an individual, receive team feedback, and learn to individually contribute to team performance Distributed reinforcement learning: Iteratively allocate “credit” for group performance to individual decisions Genetic algorithms: Evolve a society of agents (survival of the fittest) Strategy learning: In market environments, learn other agents’ strategies

Adaptive organizational dynamics Potential for change: Change parameters of organization over time That is, change the structures, add/delete/move agents, … Adaptation techniques: Genetic algorithms Neural networks Heuristic search / simulated annealing Design of new processes and procedures Adaptation of individual agents

Conclusions and directions “Agent” means many different things Different types of “multi-agent systems”: Cooperative vs. competitive Heterogeneous vs. homogeneous Micro vs. macro Lots of interesting/open research directions: Effective cooperation strategies “Fair” coordination strategies and protocols Learning in MAS Resource-limited MAS (communication, …)