Pinning Control of Dynamical Networks with Optimal Cost

S. Jafarizadeh
{"title":"Pinning Control of Dynamical Networks with Optimal Cost","authors":"S. Jafarizadeh","doi":"10.1109/LCN48667.2020.9314818","DOIUrl":null,"url":null,"abstract":"Complex networks of coupled dynamical systems, are effective models of numerous distributed systems. The desire to control such systems has led to the pinning control techniques where a subset of nodes in the network is controlled. A problem of interest is to optimize the pinning node selection and control gain design, while minimizing the associated total control cost. Here this optimal control optimization problem has been reformulated as a standard semidefinite programming problem. Solving the resultant problem, the analytical solution for the optimal feedback gain and pinning nodes are derived. An algorithm for determining the optimal feedback gain for a set of pinned nodes is developed. For a number of topologies, closed-forms of the optimal results are provided. Interestingly, increasing the number of pinned nodes in the network reduces the total pinning cost, i.e., the performance index. For a network of Lorenz systems, optimal results for all possible pinning node selections are provided.","PeriodicalId":245782,"journal":{"name":"2020 IEEE 45th Conference on Local Computer Networks (LCN)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 45th Conference on Local Computer Networks (LCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN48667.2020.9314818","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Complex networks of coupled dynamical systems, are effective models of numerous distributed systems. The desire to control such systems has led to the pinning control techniques where a subset of nodes in the network is controlled. A problem of interest is to optimize the pinning node selection and control gain design, while minimizing the associated total control cost. Here this optimal control optimization problem has been reformulated as a standard semidefinite programming problem. Solving the resultant problem, the analytical solution for the optimal feedback gain and pinning nodes are derived. An algorithm for determining the optimal feedback gain for a set of pinned nodes is developed. For a number of topologies, closed-forms of the optimal results are provided. Interestingly, increasing the number of pinned nodes in the network reduces the total pinning cost, i.e., the performance index. For a network of Lorenz systems, optimal results for all possible pinning node selections are provided.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
最优代价动态网络的钉住控制
耦合动力系统的复杂网络是众多分布式系统的有效模型。控制这种系统的愿望导致了固定控制技术,其中控制网络中的节点子集。一个有趣的问题是优化固定节点的选择和控制增益设计,同时最小化相关的总控制成本。在这里,最优控制优化问题被重新表述为标准的半定规划问题。通过求解所得问题,导出了最优反馈增益和最优钉住节点的解析解。提出了一种确定一组固定节点的最优反馈增益的算法。对于许多拓扑,提供了最优结果的封闭形式。有趣的是,增加网络中固定节点的数量会降低总固定成本,即性能指标。对于洛伦兹系统网络,提供了所有可能的固定节点选择的最优结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Leveraging MEC in a 5G System for Enhanced Back Situation Awareness L3SFA: Load Shifting Strategy for Spreading Factor Allocation in LoRaWAN Systems PLEDGE: An IoT-oriented Proof-of-Honesty based Blockchain Consensus Protocol Don’t Stop at the Top: Using Certificate Transparency Logs to Extend Domain Lists for Web Security Studies SETA: Scalable Encrypted Traffic Analytics in Multi-Gbps Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1