Heterogeneous Unknown Multiagent Systems of Different Relative Degrees: A Distributed Optimal Coordination Design

IF 4 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Systems Journal Pub Date : 2024-07-01 DOI:10.1109/JSYST.2024.3417255
Hossein Noorighanavati Zadeh;Reza Naseri;Mohammad Bagher Menhaj;Amir Abolfazl Suratgar
{"title":"Heterogeneous Unknown Multiagent Systems of Different Relative Degrees: A Distributed Optimal Coordination Design","authors":"Hossein Noorighanavati Zadeh;Reza Naseri;Mohammad Bagher Menhaj;Amir Abolfazl Suratgar","doi":"10.1109/JSYST.2024.3417255","DOIUrl":null,"url":null,"abstract":"This study delves into the distributed optimal coordination (DOC) problem, where a network comprises agents with different relative degrees. Each agent is equipped with a private cost function. The goal is to steer these agents towards minimizing the global cost function, which aggregates their individual costs. Existing literature often leans on known agent dynamics, which may not faithfully represent real-world scenarios. To bridge this gap, we delve into the DOC problem within a network of linear time-invariant (LTI) agents, where the system matrices remain entirely unknown. Our proposed solution introduces a novel distributed two-layer control policy: the top layer endeavors to find the minimizer and generates tailored reference signals for each agent, while the bottom layer equips each agent with an adaptive controller to track these references. Key assumptions include strongly convex private cost functions with local Lipschitz gradients. Under these conditions, our control policy guarantees asymptotic consensus on the global minimizer within the network. Moreover, the control policy operates fully distributedly, relying solely on private and neighbor information for execution. Theoretical insights are substantiated through simulations, encompassing both numerical and practical examples involving speed control of a multimotor network, thereby affirming the efficacy of our approach in practical settings.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 3","pages":"1570-1580"},"PeriodicalIF":4.0000,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Systems Journal","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10579057/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

This study delves into the distributed optimal coordination (DOC) problem, where a network comprises agents with different relative degrees. Each agent is equipped with a private cost function. The goal is to steer these agents towards minimizing the global cost function, which aggregates their individual costs. Existing literature often leans on known agent dynamics, which may not faithfully represent real-world scenarios. To bridge this gap, we delve into the DOC problem within a network of linear time-invariant (LTI) agents, where the system matrices remain entirely unknown. Our proposed solution introduces a novel distributed two-layer control policy: the top layer endeavors to find the minimizer and generates tailored reference signals for each agent, while the bottom layer equips each agent with an adaptive controller to track these references. Key assumptions include strongly convex private cost functions with local Lipschitz gradients. Under these conditions, our control policy guarantees asymptotic consensus on the global minimizer within the network. Moreover, the control policy operates fully distributedly, relying solely on private and neighbor information for execution. Theoretical insights are substantiated through simulations, encompassing both numerical and practical examples involving speed control of a multimotor network, thereby affirming the efficacy of our approach in practical settings.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
不同相对度的异构未知多代理系统:分布式优化协调设计
本研究深入探讨了分布式最优协调(DOC)问题,在该问题中,网络由具有不同相对度的代理组成。每个代理都有一个私人成本函数。目标是引导这些代理最小化全局成本函数,全局成本函数汇总了他们各自的成本。现有文献通常依赖于已知的代理动态,但这可能无法忠实地反映真实世界的场景。为了缩小这一差距,我们深入研究了线性时变(LTI)代理网络中的 DOC 问题,在该网络中,系统矩阵仍是完全未知的。我们提出的解决方案引入了一种新颖的分布式双层控制策略:顶层努力寻找最小值,并为每个代理生成量身定制的参考信号,而底层则为每个代理配备自适应控制器,以跟踪这些参考信号。关键假设包括具有局部 Lipschitz 梯度的强凸私人成本函数。在这些条件下,我们的控制策略能保证在网络内就全局最小化达成渐近共识。此外,该控制策略完全分布式运行,仅依靠私人信息和邻居信息来执行。我们通过模拟,包括涉及多运动网络速度控制的数值和实际例子,证实了我们的理论见解,从而肯定了我们的方法在实际环境中的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Systems Journal
IEEE Systems Journal 工程技术-电信学
CiteScore
9.80
自引率
6.80%
发文量
572
审稿时长
4.9 months
期刊介绍: This publication provides a systems-level, focused forum for application-oriented manuscripts that address complex systems and system-of-systems of national and global significance. It intends to encourage and facilitate cooperation and interaction among IEEE Societies with systems-level and systems engineering interest, and to attract non-IEEE contributors and readers from around the globe. Our IEEE Systems Council job is to address issues in new ways that are not solvable in the domains of the existing IEEE or other societies or global organizations. These problems do not fit within traditional hierarchical boundaries. For example, disaster response such as that triggered by Hurricane Katrina, tsunamis, or current volcanic eruptions is not solvable by pure engineering solutions. We need to think about changing and enlarging the paradigm to include systems issues.
期刊最新文献
Relationship between emotional state and masticatory system function in a group of healthy volunteers aged 18-21. Table of Contents Front Cover Editorial IEEE Systems Council Information
×
引用
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