Cart (Loading....) | Create Account
Close category search window
 

Nash, Social and Centralized Solutions to Consensus Problems via Mean Field Control Theory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
4 Author(s)
Nourian, M. ; Dept. of Electr. & Comput. Eng., McGill Univ., Montreal, QC, Canada ; Caines, P.E. ; Malhame, R.P. ; Minyi Huang

The purpose of this paper is to synthesize initial mean consensus behavior of a set of agents from the fundamental optimization principles of i) stochastic dynamic games, and ii) optimal control. In the stochastic dynamic game model each agent seeks to minimize its individual quadratic discounted cost function involving the mean of the states of all other agents. In this formulation we derive the limiting infinite population mean field equation system and explicitly compute its unique solution. The resulting mean field (MF) control strategies drive each agent to track the overall population's initial state distribution mean, and by applying these decentralized strategies, any finite population system reaches mean consensus asymptotically as time goes to infinity. Furthermore, these control laws possess an εN-Nash equilibrium property where εN goes to zero as the population size N goes to infinity. Finally, the analysis is extended to the case of random mean field couplings. In the social cooperative formulation the basic objective is to minimize a social cost as the sum of the individual cost functions containing mean field coupling. In this formulation we show that for any individual agent the decentralized mean field social (MF Social) control strategy is the same as the mean field Nash (MF Nash) equilibrium strategy. Hence MF-Nash Controls UNashN=MF - Social Controls USocN. On the other hand, the solution to the centralized LQR optimal control formulation yields the Standard Consensus (SC) algorithm whenever the graph representing the corresponding topology of the network is Completely Connected (CC). Hence Cent. LQR Controls UCentN=SC-CC Controls USCN. Moreover, a system with centralized control laws reaches consensus on the initial state distribution mean as time and population size N go to infinity. Hence, asymptotically in time M- -Nash Controls UNashN=MF-Social Controls USocN = Cent. LQR Controls UCent = SC-CC Controls USC. Finally, the analysis is extended to the long time average (LTA) cost functions case.

Published in:

Automatic Control, IEEE Transactions on  (Volume:58 ,  Issue: 3 )

Date of Publication:

March 2013

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.