.png){kind=icon}
返回
Bounded Nash type controls for uncertain linear systems
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2007.10.035.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper deals with multicriteria controls for systems coping with polytopic uncertainties. The proposed controls are inspired by a Nash strategy for exactly known systems, reformulated as a nonconvex coupling between Semi-Definite Programming problems. The extension to the uncertain case duplicates the Linear Matrix Inequalities for all vertices of the polytope. A new iterative algorithm using Semi-Definite Programming is provided to design bounded Nash type controls for uncertain systems. A numerical example is given to illustrate the design method. (c) 2008 Elsevier Ltd. All rights reserved.
Keyword:
Nash strategies
game theory
Algebraic Riccati equations
Linear matrix inequalities (LMI)
robustness
polytopic uncertainty
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
分享收藏
分享收藏Guaranteeing cost strategies for linear quadratic differential games under uncertain dynamics.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏分享收藏
查看更多内容