IEEE Transactions on Control of Network Systems最新文献

筛选
英文 中文
IEEE Control Systems Society Information 电气和电子工程师学会控制系统协会信息
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-09-19 DOI: 10.1109/TCNS.2024.3441429
{"title":"IEEE Control Systems Society Information","authors":"","doi":"10.1109/TCNS.2024.3441429","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3441429","url":null,"abstract":"","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"11 3","pages":"C2-C2"},"PeriodicalIF":4.0,"publicationDate":"2024-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10684315","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142276517","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multirobot Stochastic Patrolling via Graph Partitioning 通过图谱划分实现多机器人随机巡逻
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-09-18 DOI: 10.1109/TCNS.2024.3463502
Weizhen Wang;Xiaoming Duan;Jianping He
{"title":"Multirobot Stochastic Patrolling via Graph Partitioning","authors":"Weizhen Wang;Xiaoming Duan;Jianping He","doi":"10.1109/TCNS.2024.3463502","DOIUrl":"10.1109/TCNS.2024.3463502","url":null,"abstract":"In this article, we study a multirobot stochastic patrolling problem by employing graph partitioning techniques, where each robot adopts a Markov-chain-based strategy over its assigned subgraph, so that the overall patrolling performance is optimized. To quantify the patrolling performance of the robot team, we first introduce a novel performance measure based on the mean first hitting time. We then formulate optimization problems for unweighted complete graphs and transcribe it to the well-known maximum <inline-formula><tex-math>$k$</tex-math></inline-formula>-cut problem. To reduce the computational complexity, we identify a special solution structure of the optimization problem, and we develop an efficient heuristic descent-based algorithm by taking advantage of this special property of the optimal solution. We show that our algorithm converges in a finite number of steps and finds a suboptimal solution that preserves the special solution structure and satisfies a suboptimality bound. We validate our findings through numerical experiments and show the clear advantages of our partition-based strategy.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"300-312"},"PeriodicalIF":4.0,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142255001","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Distributed Control Within a Trapezoid Virtual Tube Containing Obstacles for Robotic Swarms Subject to Speed Constraints 受速度限制的机器人群在含有障碍物的梯形虚拟管内的分布式控制
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-09-18 DOI: 10.1109/TCNS.2024.3463472
Yan Gao;Chenggang Bai;Quan Quan
{"title":"Distributed Control Within a Trapezoid Virtual Tube Containing Obstacles for Robotic Swarms Subject to Speed Constraints","authors":"Yan Gao;Chenggang Bai;Quan Quan","doi":"10.1109/TCNS.2024.3463472","DOIUrl":"10.1109/TCNS.2024.3463472","url":null,"abstract":"In our previous work, we design a trapezoid virtual tube to guide robotic swarms through narrow openings. This article extends the application of the trapezoid virtual tube to the situations where there are static obstacles inside and robots have strict speed constraints. We first propose a distributed swarm controller for the trapezoid virtual tube without obstacles and present the relationship between the trapezoid virtual tube and speed constraints. Then, a switching logic for obstacle avoidance is proposed by dividing the trapezoid virtual tube containing static obstacles into several subtrapezoid virtual tubes without obstacles. Formal analyses and proofs are presented to demonstrate that all robots can pass through the trapezoid virtual tube safely. Besides, we validate the effectiveness of our method through numerical simulations and real experiments.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"287-299"},"PeriodicalIF":4.0,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142254962","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Nonlinear Multiagent Systems Consensus via Delayed Nonfragile Sampled-Data Control 通过延迟非脆弱采样数据控制达成非线性多代理系统共识
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-09-18 DOI: 10.1109/TCNS.2024.3463507
Zhengliang Zhai;Huaicheng Yan;Shiming Chen;Yufang Chang;Kaibo Shi
{"title":"Nonlinear Multiagent Systems Consensus via Delayed Nonfragile Sampled-Data Control","authors":"Zhengliang Zhai;Huaicheng Yan;Shiming Chen;Yufang Chang;Kaibo Shi","doi":"10.1109/TCNS.2024.3463507","DOIUrl":"10.1109/TCNS.2024.3463507","url":null,"abstract":"This article investigates the consensus issue of nonlinear multiagent systems by utilizing the delayed nonfragile sampled-data control mechanism. First of all, in consideration of the aperiodic sampling and the transmission time, a novel type extended looped functional is constructed. In the extended looped functional, some integral state vectors are first utilized to achieve the goal of enlarging the sampling interval upper bound. And, to guarantee the flexibility of the controller, the sampling fluctuation is taken into account in the design procedure. Then, on the basis of free-matrix-based inequalities, several sufficient consensus criteria with less conservativeness are obtained, which are presented as linear matrix inequalities. Eventually, an example of autonomous aerial vehicles is exhibited to prove the validity and advantages of the proposed consensus criteria.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"275-286"},"PeriodicalIF":4.0,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142254961","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Clock Synchronization With Unknown and Unmodeled Disturbances Over Distributed Networks 分布式网络上未知和未建模干扰的时钟同步
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-09-18 DOI: 10.1109/TCNS.2024.3463399
Ke Fang;Jianqi Chen;Junfeng Wu
{"title":"Clock Synchronization With Unknown and Unmodeled Disturbances Over Distributed Networks","authors":"Ke Fang;Jianqi Chen;Junfeng Wu","doi":"10.1109/TCNS.2024.3463399","DOIUrl":"10.1109/TCNS.2024.3463399","url":null,"abstract":"The clock synchronization problem has garnered significant attention in the field of multiagent systems due to its aim of establishing a common and reliable framework for facilitating cooperation among different agents. In contrast to previous studies, our primary focus lies in addressing the following question: When we lack prior knowledge about disturbances, what synchronization performance can we achieve compared to a hindsight-based approach? To tackle this challenge, we introduce the concept of <italic>regret</i> as a metric to model and quantify our problem, independent of any assumptions regarding disturbances. We define regret as the measure of deviation from an ideal synchronization outcome. Furthermore, we prove that the problem inherently possesses a lower bound of regret, which remains unaffected by disturbances. By appropriately setting the regret requirement, we can transform the problem into an <inline-formula><tex-math>$mathcal {H}_infty$</tex-math></inline-formula> optimal control problem equivalently, which allows us to determine the corresponding synchronization strategy. Through simulations, we validate the effectiveness of our method, demonstrating its superiority over existing approaches.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"262-274"},"PeriodicalIF":4.0,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142254963","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Distributed Proximal Alternating Direction Multiplier Method for Multiblock Nonsmooth Composite Optimization 多块非光滑复合优化的分布式近端交替方向乘法器方法
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-09-17 DOI: 10.1109/TCNS.2024.3462519
Yuan Zhou;Luyao Guo;Xinli Shi;Jinde Cao
{"title":"A Distributed Proximal Alternating Direction Multiplier Method for Multiblock Nonsmooth Composite Optimization","authors":"Yuan Zhou;Luyao Guo;Xinli Shi;Jinde Cao","doi":"10.1109/TCNS.2024.3462519","DOIUrl":"10.1109/TCNS.2024.3462519","url":null,"abstract":"In this article, we address a composite optimization problem in a distributed network. Each agent in the network possesses a private local convex function consisting of a differentiable term, a nonsmooth term, and a nonsmooth term combined with a linear operator. The objective is to minimize the sum of all local functions while achieving consensus among the local states through information exchange with neighboring agents. To tackle this problem, we propose a novel distributed proximal alternating direction multiplier method (ADMM). By introducing the proximal operator of the nonsmooth term, linearizing the smooth term, and incorporating an additional proximal term, the ADMM subproblem can be solved more efficiently. One key advantage of the proposed algorithm is that it allows each agent to select parameters without being constrained by the network topology. In some instances, the algorithm can be transformed into some classical optimization algorithms. The algorithm is further extended to an asynchronous version by introducing randomized block coordinate. We further analyze the convergence of the proposed asynchronous algorithm and establish the sublinear convergence rate under synchronous conditions. Finally, several numerical experiments are conducted to verify the effectiveness of the proposed algorithm.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"202-215"},"PeriodicalIF":4.0,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142254964","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Learning Nonlinear Couplings in Network of Agents From a Single Sample Trajectory 从单个样本轨迹学习代理网络中的非线性耦合
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-09-17 DOI: 10.1109/TCNS.2024.3462850
Arash Amini;Qiyu Sun;Nader Motee
{"title":"Learning Nonlinear Couplings in Network of Agents From a Single Sample Trajectory","authors":"Arash Amini;Qiyu Sun;Nader Motee","doi":"10.1109/TCNS.2024.3462850","DOIUrl":"10.1109/TCNS.2024.3462850","url":null,"abstract":"In this article, we study a class of stochastic nonlinear dynamical networks governed by coupling functions, showing that under certain assumptions, these networks can produce geometrically ergodic trajectories. Our findings suggest that a wide range of coupling functions can be effectively learned from just one sample trajectory in the network. This approach is practical, as it often aligns with the preference in many applications to conduct a single, extended experiment rather than repeating the same experiment under different initial conditions. Drawing on concentration inequalities for geometrically ergodic Markov chains, we present several results regarding the empirical estimator's convergence to the actual coupling function, substantiated by extensive simulations.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"74-84"},"PeriodicalIF":4.0,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142255003","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Refined Algorithms for Adaptive Optimal Output Regulation and Adaptive Optimal Cooperative Output Regulation Problems 自适应最优输出调节和自适应最优合作输出调节问题的改进算法
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-09-17 DOI: 10.1109/TCNS.2024.3462549
Liquan Lin;Jie Huang
{"title":"Refined Algorithms for Adaptive Optimal Output Regulation and Adaptive Optimal Cooperative Output Regulation Problems","authors":"Liquan Lin;Jie Huang","doi":"10.1109/TCNS.2024.3462549","DOIUrl":"10.1109/TCNS.2024.3462549","url":null,"abstract":"Given a linear unknown system with <inline-formula><tex-math>$m$</tex-math></inline-formula> inputs, <inline-formula><tex-math>$p$</tex-math></inline-formula> outputs, <inline-formula><tex-math>$n$</tex-math></inline-formula>-dimensional state vector, and <inline-formula><tex-math>$q$</tex-math></inline-formula>-dimensional exosystem, the problem of the adaptive optimal output regulation of this system boils down to iteratively solving a set of linear equations and each of these equations contains <inline-formula><tex-math>$frac{n (n+1)}{2} + (m+q)n$</tex-math></inline-formula> unknown variables. A problem with a moderate size may entail forming and then solving a few hundreds of such linear equations. Thus, the computational cost of solving such a problem can be formidable. In this article, we first improve the existing algorithm by decoupling each of these linear equations into two lower dimensional linear equations. The first one contains <inline-formula><tex-math>$nq$</tex-math></inline-formula> unknown variables, and the second one contains <inline-formula><tex-math>$frac{n (n+1)}{2} + mn$</tex-math></inline-formula> unknown variables. Thus, this improved algorithm reduces a linear equation with <inline-formula><tex-math>$frac{n (n+1)}{2} + (m+q)n$</tex-math></inline-formula> unknown variables to a linear equation with <inline-formula><tex-math>$nq$</tex-math></inline-formula> unknown variables and a linear equation with <inline-formula><tex-math>$frac{n (n+1)}{2} + mn$</tex-math></inline-formula> unknown variables. As a result, not only the computational cost of the problem is drastically reduced but also the solvability conditions for these equations are significantly weakened. Moreover, we also apply this improved algorithm to the adaptive cooperative optimal output regulation of linear multiagent unknown systems and reduce the computational cost of the problem more saliently.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"241-250"},"PeriodicalIF":4.0,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142254967","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Robust Formation Control of Robot Manipulators With Interagent Constraints Over Undirected Signed Networks 无向符号网络上具有代理间约束的机器人机械手鲁棒编队控制
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-09-17 DOI: 10.1109/TCNS.2024.3462554
Pelin Şekercioğlu;Bayu Jayawardhana;Ioannis Sarras;Antonio Loría;Julien Marzat
{"title":"Robust Formation Control of Robot Manipulators With Interagent Constraints Over Undirected Signed Networks","authors":"Pelin Şekercioğlu;Bayu Jayawardhana;Ioannis Sarras;Antonio Loría;Julien Marzat","doi":"10.1109/TCNS.2024.3462554","DOIUrl":"10.1109/TCNS.2024.3462554","url":null,"abstract":"In this article, we address the problem of distributed control of a network of cooperative and competitive robot manipulators in end-effector coordinates. We propose a distributed bipartite formation controller that guarantees collision avoidance of the end-effectors. In the considered setting, two groups are formed and reach intergroup bipartite consensus or disagreement. On the other hand, the end-effectors achieve intragroup formation. To ensure that the end-effectors do not collide, we design gradient-based control laws using barrier-Lyapunov functions. In addition, the proposed controller ensures that the closed-loop system is robust to external disturbances. The latter are assumed to be generated by an exosystem, so they are effectively rejected by an internal-model-based compensator. More precisely, we establish the asymptotic stability of the bipartite formation manifold. Finally, we illustrate our theoretical results via numerical simulations.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"251-261"},"PeriodicalIF":4.0,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142254965","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On Privacy Preservation of Distributed Energy Resource Optimization in Power Distribution Networks 论配电网络中分布式能源资源优化的隐私保护
IF 4 3区 计算机科学
IEEE Transactions on Control of Network Systems Pub Date : 2024-09-17 DOI: 10.1109/TCNS.2024.3462536
Xiang Huo;Mingxi Liu
{"title":"On Privacy Preservation of Distributed Energy Resource Optimization in Power Distribution Networks","authors":"Xiang Huo;Mingxi Liu","doi":"10.1109/TCNS.2024.3462536","DOIUrl":"10.1109/TCNS.2024.3462536","url":null,"abstract":"The exploding deployment of distributed energy resources (DERs) brings unprecedented challenges to the optimization of large-scale power distribution networks—numerous grid-tied devices pose severe control scalability crises. Besides, the exposure of private DER data, such as energy generation and consumption profiles, is leading to prevalent customer privacy breaches. Despite the importance, research on privacy-preserving DER control in a fully scalable manner is still lacking. To fill this gap, a hierarchical DER aggregation and control framework is first developed to achieve scalability over a large DER population size. Second, a novel privacy-preserving optimization algorithm is proposed for the developed DER aggregation and control framework based on the secret sharing technique. Finally, privacy preservation guarantees of the developed algorithm are provided against honest-but-curious adversaries and external eavesdroppers. Simulations on a 13-bus test feeder demonstrate the effectiveness of the proposed approach in preserving private DER data within power distribution networks.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"228-240"},"PeriodicalIF":4.0,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142255049","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信