复杂系统结构可控和可观察的最优不相交分解:一个优化框架

IF 6.7 2区 计算机科学 Q1 ENGINEERING, MULTIDISCIPLINARY
Sahar Maleki;Mehdi Rahmani;Hassan Zarabadipour
{"title":"复杂系统结构可控和可观察的最优不相交分解:一个优化框架","authors":"Sahar Maleki;Mehdi Rahmani;Hassan Zarabadipour","doi":"10.1109/TNSE.2025.3556365","DOIUrl":null,"url":null,"abstract":"Decomposition of a dynamic complex system into smaller subsystems can significantly reduce the complexity and simplify the analysis, particularly in networked control design. This paper proposes a structurally controllable and observable optimal disjoint <inline-formula><tex-math>$\\varepsilon$</tex-math></inline-formula>-decomposition for complex systems. The methodology for this decomposition is conducted through the perspective of graph theory in conjunction with an optimization framework. To achieve this kind of decomposition, an optimization problem is first presented for the disjoint <inline-formula><tex-math>$\\varepsilon$</tex-math></inline-formula>-decomposition. Then, the suggested optimization problem is extended to address optimal disjoint <inline-formula><tex-math>$\\varepsilon$</tex-math></inline-formula>-decomposition. Next, the resultant decomposition is developed to fulfill the structural controllability and observability of the subsystems. Afterward, the recommended optimization problem undergoes modifications to account for structural perturbations. Finally, the performance and effectiveness of the decomposition approach are evaluated. The simulation results demonstrate that it successfully decomposes a complex system under structural perturbation into controllable and observable weakly coupled subsystems. Additionally, this method outperforms existing methods in terms of both methodology and specifications.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 4","pages":"3051-3064"},"PeriodicalIF":6.7000,"publicationDate":"2025-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Structurally Controllable and Observable Optimal Disjoint Decomposition of Complex Systems: An Optimization Framework\",\"authors\":\"Sahar Maleki;Mehdi Rahmani;Hassan Zarabadipour\",\"doi\":\"10.1109/TNSE.2025.3556365\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Decomposition of a dynamic complex system into smaller subsystems can significantly reduce the complexity and simplify the analysis, particularly in networked control design. This paper proposes a structurally controllable and observable optimal disjoint <inline-formula><tex-math>$\\\\varepsilon$</tex-math></inline-formula>-decomposition for complex systems. The methodology for this decomposition is conducted through the perspective of graph theory in conjunction with an optimization framework. To achieve this kind of decomposition, an optimization problem is first presented for the disjoint <inline-formula><tex-math>$\\\\varepsilon$</tex-math></inline-formula>-decomposition. Then, the suggested optimization problem is extended to address optimal disjoint <inline-formula><tex-math>$\\\\varepsilon$</tex-math></inline-formula>-decomposition. Next, the resultant decomposition is developed to fulfill the structural controllability and observability of the subsystems. Afterward, the recommended optimization problem undergoes modifications to account for structural perturbations. Finally, the performance and effectiveness of the decomposition approach are evaluated. The simulation results demonstrate that it successfully decomposes a complex system under structural perturbation into controllable and observable weakly coupled subsystems. Additionally, this method outperforms existing methods in terms of both methodology and specifications.\",\"PeriodicalId\":54229,\"journal\":{\"name\":\"IEEE Transactions on Network Science and Engineering\",\"volume\":\"12 4\",\"pages\":\"3051-3064\"},\"PeriodicalIF\":6.7000,\"publicationDate\":\"2025-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Network Science and Engineering\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10945632/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10945632/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

将一个动态的复杂系统分解成更小的子系统可以显著地降低复杂性和简化分析,特别是在网络控制设计中。针对复杂系统,提出了一种结构可控、可观察的最优不相交分解方法。这种分解的方法是通过图论的角度与优化框架相结合进行的。为了实现这种分解,首先对不相交的varepsilon分解提出了一个优化问题。然后,将建议的优化问题推广到求解最优不相交分解。然后,对结果进行分解,以实现子系统的结构可控性和可观测性。然后,对推荐的优化问题进行修改,以考虑结构扰动。最后,对分解方法的性能和有效性进行了评价。仿真结果表明,该方法成功地将结构扰动下的复杂系统分解为可控和可观察的弱耦合子系统。此外,该方法在方法学和规范方面都优于现有方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Structurally Controllable and Observable Optimal Disjoint Decomposition of Complex Systems: An Optimization Framework
Decomposition of a dynamic complex system into smaller subsystems can significantly reduce the complexity and simplify the analysis, particularly in networked control design. This paper proposes a structurally controllable and observable optimal disjoint $\varepsilon$-decomposition for complex systems. The methodology for this decomposition is conducted through the perspective of graph theory in conjunction with an optimization framework. To achieve this kind of decomposition, an optimization problem is first presented for the disjoint $\varepsilon$-decomposition. Then, the suggested optimization problem is extended to address optimal disjoint $\varepsilon$-decomposition. Next, the resultant decomposition is developed to fulfill the structural controllability and observability of the subsystems. Afterward, the recommended optimization problem undergoes modifications to account for structural perturbations. Finally, the performance and effectiveness of the decomposition approach are evaluated. The simulation results demonstrate that it successfully decomposes a complex system under structural perturbation into controllable and observable weakly coupled subsystems. Additionally, this method outperforms existing methods in terms of both methodology and specifications.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Network Science and Engineering
IEEE Transactions on Network Science and Engineering Engineering-Control and Systems Engineering
CiteScore
12.60
自引率
9.10%
发文量
393
期刊介绍: The proposed journal, called the IEEE Transactions on Network Science and Engineering (TNSE), is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level. The types of networks covered include physical or engineered networks, information networks, biological networks, semantic networks, economic networks, social networks, and ecological networks. Aimed at discovering common principles that govern network structures, network functionalities and behaviors of networks, the journal seeks articles on understanding, prediction, and control of structures and behaviors of networks. Another trans-disciplinary focus of the IEEE Transactions on Network Science and Engineering is the interactions between and co-evolution of different genres of networks.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信