.png){kind=icon}
返回
Branch and bound method for multiobjective pairing selection
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2010.02.014.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Most of the available methods for selection of input-output pairings for decentralized control require evaluation of all alternatives to find the optimal pairings. As the number of alternatives grows rapidly with process dimensions, pairing selection through an exhaustive search can be computationally forbidding for large-scale processes. Furthermore, the different criteria can be conflicting necessitating pairing selection in a multiobjective optimization framework. In this paper, an efficient branch and bound (BAB) method for multiobjective pairing selection is proposed. The proposed BAB method is illustrated through a biobjective pairing problem using selection criteria involving the relative gain array and the mu-interaction measure. The computational efficiency of the proposed method is demonstrated by using randomly generated matrices and the large-scale case study of cross-direction control. (C) 2010 Elsevier Ltd. All rights reserved.
Keyword:
Computer-aided control system design
Decentralized control
Global optimization
Large-scale systems
Multiobjective optimizations
Relative gain array
Structured singular value
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
.png){kind=icon}
查看更多内容