Minimax team decision problems
(2007) 2007 American Control Conference, ACC In Proceedings of the American Control Conference p.766-771- Abstract
We consider the problem of distributed decision making in a quadratic game between a team of players and nature. Each player has limited information that could be different from the other players in the team. We show that if there is a solution to the minimax team problem, then the linear policies are optimal, and we show how to find the linear optimal solution by solving a linear matrix inequality. The result is used to solve the distributed H∞ control problem. It shows that information exchange with neighbours on the graph only, is enough to obtain a linear optimal policy.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/f37d71f7-0e33-4e83-a4a1-69009986ccba
- author
- Gattami, Ather
LU
and Bernhardsson, Bo
LU
- organization
- publishing date
- 2007-12-01
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- Proceedings of the 2007 American Control Conference, ACC
- series title
- Proceedings of the American Control Conference
- article number
- 4282858
- pages
- 6 pages
- conference name
- 2007 American Control Conference, ACC
- conference location
- New York, NY, United States
- conference dates
- 2007-07-09 - 2007-07-13
- external identifiers
-
- scopus:46449119505
- ISSN
- 0743-1619
- ISBN
- 1424409888
- 9781424409884
- DOI
- 10.1109/ACC.2007.4282858
- language
- English
- LU publication?
- yes
- id
- f37d71f7-0e33-4e83-a4a1-69009986ccba
- date added to LUP
- 2020-07-07 12:38:51
- date last changed
- 2022-02-01 07:16:45
@inproceedings{f37d71f7-0e33-4e83-a4a1-69009986ccba, abstract = {{<p>We consider the problem of distributed decision making in a quadratic game between a team of players and nature. Each player has limited information that could be different from the other players in the team. We show that if there is a solution to the minimax team problem, then the linear policies are optimal, and we show how to find the linear optimal solution by solving a linear matrix inequality. The result is used to solve the distributed H<sub>∞</sub> control problem. It shows that information exchange with neighbours on the graph only, is enough to obtain a linear optimal policy.</p>}}, author = {{Gattami, Ather and Bernhardsson, Bo}}, booktitle = {{Proceedings of the 2007 American Control Conference, ACC}}, isbn = {{1424409888}}, issn = {{0743-1619}}, language = {{eng}}, month = {{12}}, pages = {{766--771}}, series = {{Proceedings of the American Control Conference}}, title = {{Minimax team decision problems}}, url = {{http://dx.doi.org/10.1109/ACC.2007.4282858}}, doi = {{10.1109/ACC.2007.4282858}}, year = {{2007}}, }