Nash Game and Mixed H 2 /H  Control by H. de O. Florentino, R.M. Sales, 1997 and by D.J.N. Limebeer, B.D.O. Anderson, and Hendel, 1994 Presensted by Hui-Hung.

Slides:



Advertisements
Similar presentations
Price Of Anarchy: Routing
Advertisements

Game Theory Assignment For all of these games, P1 chooses between the columns, and P2 chooses between the rows.
DIFFERENTIAL AMPLIFIERS. DIFFERENTIAL AMPLIFIER 1.VERY HIGH INPUT IMPEDENCE 2.VERY HIGH BANDWIDTH 3.DIFFERENTIAL INPUT 4.DC DIFFERENTIAL INPUT ACCEPTED.
Approximation Algorithms Chapter 14: Rounding Applied to Set Cover.
Bilinear Games: Polynomial Time Algorithms for Rank Based Subclasses Ruta Mehta Indian Institute of Technology, Bombay Joint work with Jugal Garg and Albert.
Mixed Strategies CMPT 882 Computational Game Theory Simon Fraser University Spring 2010 Instructor: Oliver Schulte.
Introduction to Algorithms
MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Zero-Sum Games (follow-up)
1 Modeling and Optimization of VLSI Interconnect Lecture 9: Multi-net optimization Avinoam Kolodny Konstantin Moiseev.
How Bad is Selfish Routing? By Tim Roughgarden Eva Tardos Presented by Alex Kogan.
1 © 2010 Pearson Education, Inc. All rights reserved © 2010 Pearson Education, Inc. All rights reserved Chapter 8 Systems of Equations and Inequalities.
1 Nonlinear Control Design for LDIs via Convex Hull Quadratic Lyapunov Functions Tingshu Hu University of Massachusetts, Lowell.
EC941 - Game Theory Prof. Francesco Squintani Lecture 8 1.
The Most Important Concept in Optimization (minimization)  A point is said to be an optimal solution of a unconstrained minimization if there exists no.
1 Network Coding: Theory and Practice Apirath Limmanee Jacobs University.
Differential Game Theory Notes by Alberto Bressan.
INTEGRATED DESIGN OF WASTEWATER TREATMENT PROCESSES USING MODEL PREDICTIVE CONTROL Mario Francisco, Pastora Vega University of Salamanca – Spain European.
Competitive Routing in Multi-User Communication Networks Presentation By: Yuval Lifshitz In Seminar: Computational Issues in Game Theory (2002/3) By: Prof.
Constrained Maximization
Nov 2003Group Meeting #2 Distributed Optimization of Power Allocation in Interference Channel Raul Etkin, Abhay Parekh, and David Tse Spectrum Sharing.
An Introduction to Game Theory Part III: Strictly Competitive Games Bernhard Nebel.
We use Numerical continuation Bifurcation theory with symmetries to analyze a class of optimization problems of the form max F(q,  )=max (G(q)+  D(q)).
Multivariable Control Systems
1 Worst-Case Equilibria Elias Koutsoupias and Christos Papadimitriou Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science.
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 68 Chapter 9 The Theory of Games.
Inefficiency of equilibria, and potential games Computational game theory Spring 2008 Michal Feldman.
1 A Cooperative Game Framework for QoS Guided Job Allocation Schemes in Grids Riky Subrata, Member, IEEE, Albert Y. Zomaya, Fellow, IEEE, and Bjorn Landfeldt,
Linear Programming Digital Lesson. Copyright © by Houghton Mifflin Company, Inc. All rights reserved. 2 Linear programming is a strategy for finding the.
Linear Programming Operations Research – Engineering and Math Management Sciences – Business Goals for this section  Modeling situations in a linear environment.
Game Theory.
A Projection Framework for Near- Potential Polynomial Games Nikolai Matni Control and Dynamical Systems, California.
AUTOMATIC CONTROL THEORY II Slovak University of Technology Faculty of Material Science and Technology in Trnava.
A Framework for Distributed Model Predictive Control
Game Theory Warin Chotekorakul MD 1/2004. Introduction A game is a contest involving to or more players, each of whom wants to win. Game theory is the.
LOGO A Path –Following Method for solving BMI Problems in Control Author: Arash Hassibi Jonathan How Stephen Boyd Presented by: Vu Van PHong American Control.
NETWORK CODING. Routing is concerned with establishing end to end paths between sources and sinks of information. In existing networks each node in a.
3.4 Linear Programming p Optimization - Finding the minimum or maximum value of some quantity. Linear programming is a form of optimization where.
Graphing Linear Inequalities in Two Variables Chapter 4 – Section 1.
PRICE-BASED SPECTRUM MANAGEMENT IN COGNITIVE RADIO NETWORKS Fan Wang, Marwan Krunz, and Shuguang Cui Department of Electrical & Computer Engineering, University.
Applications of Parametric Quadratic Optimization Oleksandr Romanko Joint work with Alireza Ghaffari Hadigheh and Tamás Terlaky November 1, 2004.
Linear Program Set Cover. Given a universe U of n elements, a collection of subsets of U, S = {S 1,…, S k }, and a cost function c: S → Q +. Find a minimum.
Designing Games for Distributed Optimization Na Li and Jason R. Marden IEEE Journal of Selected Topics in Signal Processing, Vol. 7, No. 2, pp ,
Motivation For analytical design of control systems,
1. 2 You should know by now… u The security level of a strategy for a player is the minimum payoff regardless of what strategy his opponent uses. u A.
5.1.Static Games of Incomplete Information
Market Design and Analysis Lecture 2 Lecturer: Ning Chen ( 陈宁 )
Example 31: Solve the following game by equal gains method: Y I II I II I X II II
Singular Systems Differential Algebraic Equations Introduction Systems & Control Theory Chemical Engineering & DAE Index for DAE Optimal Control Directions.
Nash Bargaining Solution and Alternating Offer Games MIT Game Theory.
2.5 The Fundamental Theorem of Game Theory For any 2-person zero-sum game there exists a pair (x*,y*) in S  T such that min {x*V. j : j=1,...,n} =
Day 9 GAME THEORY. 3 Solution Methods for Non-Zero Sum Games Dominant Strategy Iterated Dominant Strategy Nash Equilibrium NON- ZERO SUM GAMES HOW TO.
Approximation Algorithms based on linear programming.
T.W.Scholten, C. de Persis, P. Tesi
A useful reduction (SAT -> game)
The Duality Theorem Primal P: Maximize
T.W. Scholten, C. de Persis, P. Tesi
A useful reduction (SAT -> game)
Chapter 10 Optimal Control Homework 10 Consider again the control system as given before, described by Assuming the linear control law Determine the constants.
Chapter 6 Game Theory (Module 4) 1.
Game Theory.
Solutions Sample Games 1
3.2 Linear Programming 3 Credits AS
3-3 Optimization with Linear Programming
Linear Programming.
Homework 9 Refer to the last example.
Warm Up Solve for x:
Lecture 20 Linear Program Duality
LINEARPROGRAMMING 4/26/2019 9:23 AM 4/26/2019 9:23 AM 1.
UNIT II: The Basic Theory
Presentation transcript:

Nash Game and Mixed H 2 /H  Control by H. de O. Florentino, R.M. Sales, 1997 and by D.J.N. Limebeer, B.D.O. Anderson, and Hendel, 1994 Presensted by Hui-Hung Lin

Introduction Object in control system –Make some output behave in desired way by manipulating control input Want to determine what is (maximum) system gain Tow performance indexes –H 2 norms : well-motivated for performance –H  norms : measure of robust stability Consider both H 2 and H  norm in design controllers

Why Game Theory? Possible approaches –Minimize H 2 performance index under some H  constraints (P1) –Fix a priori H 2 performance level to optimize H  norms (P2) Motivation of Game Theory –Some performance level is lost if want a better disturbance rejection and vice-versa Idea of Game Theory –Two-player nonzero sum game –One for H 2 and the other for H 

de O. Florentino and Sale’s result Theorem (P1) For a given  >0, define the problem The following holds: 1. Above problem is convex 2. Being W* its optimal solution associated as  *, the gain is feasible solution for 3. If  , reduced to H 2 control problem z2z2 T K w ux zz Theorem (P2) For a given  >0, define the problem The following holds: 1.Above problem is convex 2.Being W* its optimal solution associated as  *, the gain is feasible solution for 3. If  , reduced to H  control problem (J.C. Geromel, P.L.D. Peres, S.R. Souza, 1992)

Two-player Nonzero Sum Game Apply Game Theory –Let  and  such that –Pay-off function for player are – Feasibility region (Theorem P1, P2) –Strategies set for the game,  –Nash equilibrium (  *,  *) , s.t. Existence of equilibrium point implies the existence of a controller K* such that Infinite NASH equilibrium points   ** ** ** ** mm ** ** mm (  * opt,  * opt ) J 1 minimum J 2 minimum

Limebeer, Anderson and Hendel’s result Goal –Find u * (t,x) s.t –u * (t,x) regulate x(t) to minimize the output energy when worst- case disturbance w * (t,x) is applied Minimize H 2 performance index over the set of feasible H  controllers (P1) w0w0 T K ux z w1w1 w 0 : white noise ; w 1 : signal of bounded power

Two-player Nonzero Sum Game One to reflect H  constraint, the other reflect H 2 optimality requirement Pay-off functions for players Nash equilibrium strategies u * (t,x), w * (t,x) satisfy –Iff exists P 1 (t)  0 and P 2 (t)  0 on [0,T] –u * (t,x) and w * (t,x) are specified by

Connection between H 2, H  and mixed H 2 /H  control problem Redefine pay-off function Solution is given by S 1 (t) and S 2 (t) satisfy H 2 (LQ) : set  = 0, and  H  : set  =  Mixed H 2 /H  : set  = 0 Infinite-horizon case (system is time- invariant): pair of cross-couple Riccati equations with (A,C) detectable or (A,B2) stabilizable for stability

Conclusion Mixed H2/H  control problem can be formulated as a two- player nonzero sum game De O. Florentino and Sales’s results can be sovled by convex optimization methods, but need croterion to choose optimal solution Results from Limebeer etc. need to solve a pair of cross-coupled (differential) Riccatti equations Overview paper by B. Vroemen and B. de Jager 1997