{"title":"A Safe First-Order Method for Pricing-Based Resource Allocation in Safety-Critical Networks","authors":"Berkay Turan;Spencer Hutchinson;Mahnoosh Alizadeh","doi":"10.1109/TCNS.2024.3488516","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3488516","url":null,"abstract":"We introduce a novel algorithm for solving network utility maximization (NUM) problems that arise in resource allocation schemes over networks with known safety-critical constraints, where the constraints form an arbitrary convex and compact feasible set. Inspired by applications where customers' demand can only be affected through posted prices and real-time two-way communication with customers is not available, we require an algorithm to generate “safe prices.” This means that at no iteration should the realized demand in response to the posted prices violate the safety constraints of the network. Thus, in contrast to existing distributed first-order methods, our algorithm, called safe pricing for NUM (SPNUM), is guaranteed to produce feasible primal iterates at all iterations. At the heart of the algorithm lie two key steps that must go hand in hand to guarantee safety and convergence: first, applying a projected gradient method on a shrunk feasible set to get the desired demand, and second, estimating the price response function of the users and determining the price so that the induced demand is close to the desired demand. We ensure safety by adjusting the shrinkage to account for the error between the induced demand and the desired demand. In addition, by gradually reducing the amount of shrinkage and the step size of the gradient method, we prove that the primal iterates produced by the SPNUM achieve a sublinear static regret of <inline-formula><tex-math>${mathcal O}(log {(T)})$</tex-math></inline-formula> after <inline-formula><tex-math>$T$</tex-math></inline-formula> time steps.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"521-533"},"PeriodicalIF":4.0,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143675989","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}
{"title":"Hybrid Cooperative Output Regulation of Linear Multiagent Systems","authors":"Ying Zhang;Youfeng Su;He Cai","doi":"10.1109/TCNS.2024.3488555","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3488555","url":null,"abstract":"In this article, the hybrid cooperative output regulation problem for linear multiagent systems is formulated and investigated, where both the exosystem and the agent dynamics are hybrid linear systems with periodic jumps. To solve this problem, a distributed observer approach is proposed, which consists of two steps. First, a novel output-based hybrid distributed observer is designed which can achieve distributed information estimation for various practical hybrid exosystems. Second, by incorporating a decentralized hybrid output feedback control law with the proposed hybrid distributed observer, a hybrid distributed output feedback control law is synthesized to solve the hybrid cooperative output regulation problem. In comparison with the existing works targeting purely continuous-time multiagent systems, the simplified forms for both the hybrid distributed observer and the hybrid output feedback control law proposed in this article exhibit prominent advantages from various aspects, such as robustness against intermittent communication links and the sampled measurement of system output for feedback. The effectiveness of the theoretical results is validated by solving the output synchronization problem for a hybrid electrical system made up of multiple heterogeneous <italic>RC</i> circuits, where the capacitors are switched <sc>on</small> and <sc>off</small> periodically.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"558-570"},"PeriodicalIF":4.0,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143675981","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}
Jie Wu;Xiaofeng Wang;Yongzheng Sun;Xiaoli Luan;Guanghui Wen
{"title":"Predefined-Time Synchronization of Kuramoto-Oscillator Networks: Chattering-Free Control Protocols","authors":"Jie Wu;Xiaofeng Wang;Yongzheng Sun;Xiaoli Luan;Guanghui Wen","doi":"10.1109/TCNS.2024.3488561","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3488561","url":null,"abstract":"This article investigates the issues of predefined-time global phase agreement (PA) and frequency synchronization (FS) for both identical and nonidentical coupled Kuramoto oscillators by developing distributed chattering-free control protocols. Unlike traditional finite-/fixed-time convergence, the upper bounds of settling time for achieving the predefined-time PA and FS are explicit constants, which are tunable and set beforehand without depending on the network information, initial conditions, and controlling parameters. In particular, the proposed control protocols are differentiable, namely, chattering-free, which do not comprise the conventional discontinuous absolute value and/or signum functions anymore. Therefore, the undesirable chattering problem is effectively overcome. Then, in the light of the second Lyapunov method, the sufficient conditions are deduced for guaranteeing the predefined-time global PA and FS of Kuramoto-oscillator networks accordingly. Finally, the numerical results validate the effectiveness of the proposed chattering-free control schemes.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"534-545"},"PeriodicalIF":4.0,"publicationDate":"2024-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143675949","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}
Logan E. Beaver;Christopher Kroninger;Michael Dorothy;Andreas A. Malikopoulos
{"title":"A Constraint-Driven Approach to Line Flocking: The V Formation as an Energy-Saving Strategy","authors":"Logan E. Beaver;Christopher Kroninger;Michael Dorothy;Andreas A. Malikopoulos","doi":"10.1109/TCNS.2024.3487612","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3487612","url":null,"abstract":"In this article, we present a constraint-driven control algorithm that minimizes the energy consumption of individual agents and yields an emergent V formation. As the formation emerges from the decentralized interaction between agents, our approach is robust to the spontaneous addition or removal of agents to the system. We start from an analytical model for the trailing upwash behind a fixed-wing uncrewed aerial vehicle (UAV), and we derive the optimal air speed for trailing UAVs to maximize their travel endurance. Next, we prove that simply flying at the optimal airspeed will never lead to emergent flocking behavior and propose a new decentralized “aneroid” behavior that yields emergent V formations. We encode these behaviors in a constraint-driven control algorithm that minimizes the locomotive power of each UAV. Finally, we prove that UAVs initialized in an approximate V or echelon formation will converge under our proposed control law, and we demonstrate that this emergence occurs in real time in simulation and in physical experiments with a fleet of Crazyflie quadrotors despite the noise and disturbances inherent in physical systems.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"438-449"},"PeriodicalIF":4.0,"publicationDate":"2024-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143675988","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}
{"title":"Stealthy Attacks and Robust Detectors for Cyber-Physical Systems With Bounded Disturbances: A Zonotope Approach","authors":"Ziyi Guo;Jing Zhou;Tongwen Chen","doi":"10.1109/TCNS.2024.3487648","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3487648","url":null,"abstract":"This article investigates stealthy attacks on cyber-physical systems that are monitored by a parity-space-based detector and corrupted by bounded disturbances. Specifically, this work proposes a receding horizon attack strategy subject to strict and relaxed stealthiness constraints. Necessary and sufficient conditions for the existence of strictly stealthy attacks of arbitrary lengths are derived. On the defender's side, a robust detector is designed to detect malicious attacks utilizing zonotopes to handle bounded disturbances. A new recursive update method and a reduction operator are proposed to improve the accuracy and reduce the storage space of the detector. Unlike traditional parity-space-based detectors, it is proved that any attack that can completely bypass the robust detector must be bounded. Furthermore, two methods of determining the optimal gains of the proposed detector are provided. The effectiveness of the proposed methods is demonstrated through numerical examples.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"416-429"},"PeriodicalIF":4.0,"publicationDate":"2024-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676042","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}
{"title":"Sign Hessian-Weighted Gradient Algorithms for Distributed Time-Varying Convex Optimization","authors":"Bomin Huang;Chengqian Yang;Fei Chen;Weiyao Lan","doi":"10.1109/TCNS.2024.3487629","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3487629","url":null,"abstract":"In this article, we initiate our exploration with a time-varying optimization problem, featuring linear equality constraints. To address this complex problem, we introduce a novel continuous-time sign Hessian-weighted gradient algorithm. Remarkably, our proposed approach is capable of handling the time-varying nature of the problem, all without the need for the invertibility of the Hessian matrix associated with the cost function. We present two distinct distributed algorithms: the edge-based and node-based variations. To underscore the practical effectiveness of our methodology, we provide some numerical examples, offering compelling evidence to validate our research findings.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"474-484"},"PeriodicalIF":4.0,"publicationDate":"2024-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676103","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}
{"title":"Group Formation Tracking of Heterogeneous Multiagent Systems Using Reinforcement Learning","authors":"Yuhan Wang;Zhuping Wang;Hao Zhang;Huaicheng Yan","doi":"10.1109/TCNS.2024.3487653","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3487653","url":null,"abstract":"This article introduces a novel distributed control protocol to address the problem of output group formation tracking for heterogeneous multiagent systems. In contrast to the existing group formation control protocols that rely on the system matrices, our approach leverages input-state data to design the optimal control gains in the framework of off-policy reinforcement learning. Specifically, an event-triggered distributed consensus estimator is proposed to estimate the leaders' system matrices and the convex hulls spanned by the leaders while ensuring the exclusion of Zeno behavior. Based on the proposed estimator, we establish an approximate optimal distributed control protocol for each follower to achieve output group formation tracking, which can be solved by the designed data-driven policy iteration algorithm. Finally, a numerical example is provided to show the efficacy of the proposed control approach.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"497-509"},"PeriodicalIF":4.0,"publicationDate":"2024-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676041","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}
{"title":"Dynamics and Optimization in Spatially Distributed Electrical Vehicle Charging","authors":"Fernando Paganini;Andres Ferragut","doi":"10.1109/TCNS.2024.3487650","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3487650","url":null,"abstract":"We consider a spatially distributed demand for electrical vehicle recharging, which must be covered by a fixed set of charging stations. Arriving electrical vehicles receive feedback on transport times to each station, and waiting times at congested ones, based on which they make a selfish selection. This selection determines total arrival rates in station queues, which are represented by a fluid state; departure rates are modeled under the assumption that clients have a given sojourn time in the system. The resulting differential equation system is analyzed with tools of optimization. We characterize the equilibrium as the solution to a specific convex program, which has connections to optimal transport problems, and also with road traffic theory. In particular, a price of anarchy appears with respect to a social planner's allocation. From a dynamical perspective, global convergence to equilibrium is established, with tools of Lagrange duality and Lyapunov theory. An extension of the model that makes customer demand elastic to observed delays is also presented, and analyzed with extensions of the optimization machinery. Simulations to illustrate the global behavior are presented, which also help validate the model beyond the fluid approximation.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"403-415"},"PeriodicalIF":4.0,"publicationDate":"2024-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143675990","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}
{"title":"Event-Triggered Connectivity Maintenance of a Teleoperated Multirobot System","authors":"Liu Yang;Daniela Constantinescu;Ligang Wu","doi":"10.1109/TCNS.2024.3487640","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3487640","url":null,"abstract":"The information that the robots of a teleoperated multirobot system need to exchange to remain connected as they follow the commands of the human operator may strain their communications. To lighten their communications, this article proposes a distributed coordination strategy that relies onevent-triggered communications freed of Zeno behavior through hybrid dynamic event triggering. The proposed strategy maintains the multirobot system globally connected for increased agility in cluttered environments, and maintains the teleoperator passive for stable teleoperation. With the proposed coordination, the robots avoid collisions with obstacles and with each other, and eventually travel at the same velocity and maintain their desired spacings. Teleoperation of a simulated three-robot team illustrates the communications savings, and the connectivity maintenance and obstacle avoidance performance, of the proposed event-triggered distributed coordination controller.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"430-437"},"PeriodicalIF":4.0,"publicationDate":"2024-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143675985","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}
{"title":"Distributed Connectivity-Preserving Control Design With Fast Convergence Over Directed Communication Topology","authors":"Huifen Hong;Wenwu Yu;Guo-Ping Jiang;Xinghuo Yu","doi":"10.1109/TCNS.2024.3487622","DOIUrl":"https://doi.org/10.1109/TCNS.2024.3487622","url":null,"abstract":"This work addresses the consensus problem for first-order multiagent systems with fixed-time convergence rate and heterogeneous communication range constraints. A novel class of distributed fixed-time consensus control algorithms is proposed with connectivity preservation property over directed graphs for nominal agents. Then, the proposed protocol is modified to solve the fixed-time connectivity-preserving consensus for nonlinear and disturbed multiagent systems. The edge-based representation framework is utilized and two strict Lyapunov functions are constructed to show that the initial edges can be maintained under the proposed control protocols. Furthermore, the fixed-time consensus is achieved, where all of the states reach a common value within a finite time, which is upper bounded regardless of initial states. Consequently, the convergence time can be set in advance. Two numerical examples are performed to illustrate the proposed schemes.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 1","pages":"485-496"},"PeriodicalIF":4.0,"publicationDate":"2024-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676148","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}