IEEE Transactions on Control of Network Systems最新文献_第4页

On the Constrained CAV Platoon Control Problem 约束CAV排控问题研究

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-01-07 DOI: 10.1109/TCNS.2025.3526678

MirSaleh Bahavarnia;Junyi Ji;Ahmad F. Taha;Daniel B. Work

{"title":"On the Constrained CAV Platoon Control Problem","authors":"MirSaleh Bahavarnia;Junyi Ji;Ahmad F. Taha;Daniel B. Work","doi":"10.1109/TCNS.2025.3526678","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3526678","url":null,"abstract":"The main objective of the connected and automated vehicle (CAV) platoon control problem is to regulate CAVs' position while ensuring stability and accounting for vehicle dynamics. Although this problem has been studied in the literature, existing research has some limitations. This article presents two new theoretical results that address these limitations: the synthesis of unrealistic high-gain control parameters due to the lack of a systematic way to incorporate the lower and upper bounds on the control parameters, and the performance sensitivity to the communication delay due to inaccurate Taylor series approximation. To be more precise, taking advantage of the well-known Padé approximation, this article proposes a constrained CAV platoon controller synthesis that systematically incorporates the lower and upper bounds on the control parameters, and significantly improves the performance sensitivity to the communication delay. The effectiveness of the presented results is verified through conducting extensive numerical simulations. The proposed controller effectively attenuates the <italic>stop-and-go disturbance</i>—a single cycle of deceleration followed by acceleration—amplification throughout the mixed platoon (consisting of CAVs and human-driven vehicles). Modern transportation systems will benefit from the proposed CAV controls in terms of effective disturbance attenuation as it will potentially reduce collisions.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1552-1564"},"PeriodicalIF":4.0,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10829967","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331610","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

Closed-Loop Design for Scalable Performance of Vehicular Formations 车辆编队可伸缩性能闭环设计

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-01-07 DOI: 10.1109/TCNS.2025.3526705

Jonas Hansson;Emma Tegling

{"title":"Closed-Loop Design for Scalable Performance of Vehicular Formations","authors":"Jonas Hansson;Emma Tegling","doi":"10.1109/TCNS.2025.3526705","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3526705","url":null,"abstract":"This article presents a novel control design for vehicular formations as an alternative to alignment through conventional consensus protocols for second-order systems. The design is motivated by the closed-loop system, which we construct as first-order systems connected in series, and is therefore called <italic>serial consensus.</i> The serial consensus design will guarantee the stability of the closed-loop system under the minimum requirement of the underlying communication graph containing a directed spanning tree, which is not generally true for conventional consensus. As our main result, we show that the serial consensus design gives bounds on the worst-case transient behavior of the formation, which is independent of the number of vehicles and the underlying graph structure. In particular, this shows that the serial consensus design guarantees the string stability of the formation and is, therefore, suitable for directed formations and communication topologies. We show that serial consensus can be implemented through message passing or measurements to neighbors at most two hops away. We illustrate our results through numerical examples.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1577-1586"},"PeriodicalIF":4.0,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331708","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

Q-DADAM: A Quantized Distributed Online Optimization Algorithm With Adaptive Momentum Q-DADAM：一种具有自适应动量的量化分布式在线优化算法

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-01-07 DOI: 10.1109/TCNS.2025.3526555

Yantao Li;Chen Chen;Keke Zhang;Dong Li;Qingguo Lü;Shaojiang Deng;Huaqing Li

{"title":"Q-DADAM: A Quantized Distributed Online Optimization Algorithm With Adaptive Momentum","authors":"Yantao Li;Chen Chen;Keke Zhang;Dong Li;Qingguo Lü;Shaojiang Deng;Huaqing Li","doi":"10.1109/TCNS.2025.3526555","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3526555","url":null,"abstract":"This article investigates distributed online optimization for a group of agents communicating on undirected networks. The objective is to collaboratively minimize the sum of locally known convex cost functions while overcoming communication bandwidth limitations. To tackle this challenge, we propose the Q-DADAM algorithm, a quantized distributed adaptive momentum method that ensures that agents interact with neighbors to optimize the global cost function collectively. Unlike many existing distributed online optimization algorithms that overlook communication bandwidth constraints, the Q-DADAM algorithm involves random quantization to effectively reduce the data transmission volume, making it more practical for applications with limited channel capacity. Different from existing algorithms that neglect adaptive momentum methods, the Q-DADAM algorithm incorporates these adaptive momentum methods, contributing to improved convergence and superior performance. Theoretical analysis demonstrates that the Q-DADAM algorithm with appropriate step size and quantization level can reduce communication traffic and achieve sublinear dynamic regret. Simulation experiments validate the practicality and effectiveness of the Q-DADAM algorithm. In addition, we discuss the impacts on the convergence of the Q-DADAM algorithm under different quantization levels and the number of agents.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1540-1551"},"PeriodicalIF":4.0,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331750","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

Privacy-Preserving Distributed Extended Kalman Filtering for Graphical Nonlinear Systems 非线性图形系统的隐私保护分布扩展卡尔曼滤波

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-01-07 DOI: 10.1109/TCNS.2025.3526723

Simeng Guo;Wenling Li;Yang Liu;Jia Song

引用次数: 0

Approximate Dynamic Programming With Feasibility Guarantees 具有可行性保证的近似动态规划

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-01-07 DOI: 10.1109/TCNS.2025.3526715

Alexander Engelmann;Maísa Beraldo Bandeira;Timm Faulwasser

引用次数: 0

Polyhedral Restrictions of Feasibility Regions in Optimal Power Flow for Distribution Networks 配电网最优潮流可行性区域的多面体约束

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-01-07 DOI: 10.1109/TCNS.2025.3526718

Mark Christianen;Sanne van Kempen;Maria Vlasiou;Bert Zwart

{"title":"Polyhedral Restrictions of Feasibility Regions in Optimal Power Flow for Distribution Networks","authors":"Mark Christianen;Sanne van Kempen;Maria Vlasiou;Bert Zwart","doi":"10.1109/TCNS.2025.3526718","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3526718","url":null,"abstract":"The optimal power flow (OPF) problem is one of the most fundamental problems in power system operations. The nonlinear ac power flow equations that model different physical laws (together with operational constraints) lay the foundation for the feasibility region of the OPF problem. While significant research has focused on convex relaxations, which are approaches to solve an OPF problem by enlarging the true feasibility region, the opposite approach of convex restrictions offers valuable insights as well. Convex restrictions, including polyhedral restrictions, reduce the true feasible region to a convex region, ensuring that it contains only feasible points. In this work, we develop a sequential optimization method that offers a scalable way to obtain (bounds on) solutions to OPF problems for distribution networks. To do so, we first develop sufficient conditions for the existence of feasible power flow solutions in the neighborhood of a specific (feasible) operating point in distribution networks; second, based on these conditions, we construct a polyhedral restriction of the feasibility region. Our numerical results demonstrate the efficacy of the sequential optimization method as an alternative to existing approaches to obtain (bounds on) solutions to OPF problems for distribution networks. By construction, the optimization problems within the defined restrictions can be solved in polynomial time and are guaranteed to have feasible solutions.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1587-1599"},"PeriodicalIF":4.0,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331609","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 Identification for Node and Edge Numbers of Time-Varying Anonymous Networks 时变匿名网络节点数和边缘数的分布式识别

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-01-07 DOI: 10.1109/TCNS.2025.3526549

Xingjian Liu;Hai-Tao Zhang;Haosen Cao;Ning Xing;Bowen Xu;Jiayu Zou;Haofei Meng

引用次数: 0

Computationally Light Privacy Preservation of Matrix-Weighted Average Consensus 矩阵加权平均共识的轻计算隐私保护

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-01-07 DOI: 10.1109/TCNS.2025.3526713

Peng Wang;Haibin Shao;Lulu Pan;Weiwu Yan;Ning Li

{"title":"Computationally Light Privacy Preservation of Matrix-Weighted Average Consensus","authors":"Peng Wang;Haibin Shao;Lulu Pan;Weiwu Yan;Ning Li","doi":"10.1109/TCNS.2025.3526713","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3526713","url":null,"abstract":"Multiagent consensus algorithms have emerged as foundational tools across a spectrum of applications, and matrix-weighted consensus ones are capable of characterizing cross-dimensional interdependence. Yet, their potential is often shadowed by a pressing concern: the privacy of agents' initial values, which frequently represent sensitive data or proprietary information. A computationally light privacy-preserving mechanism for matrix-weighted average consensus (MAC) algorithms is proposed in response to the concern of agents' privacy. In the mechanism, agents' states are first perturbed and then multiplied by the matrix weights before being sent to their neighbors. Both the perturbation and the matrix weight are neighbor-dependent, i.e., they may be selected to be different for different neighbors, and they can be selected independently to mask the true state of an agent. The proposed mechanism can simultaneously guarantee the privacy of initial values and accurate average consensus. The additional computational burden that an agent bears is only the addition of vectors in the same dimension as its state compared to the original MAC algorithm. Through practical case studies with a peer-to-peer transactive energy system, we demonstrate the tangible implications of safeguarding initial value privacy with the proposed mechanism.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1651-1661"},"PeriodicalIF":4.0,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331543","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

Codesign of Dynamic Quantizer and Small-Gain-Based Distributed Model Predictive Control of Nonlinear Continuous System 非线性连续系统动态量化器与小增益分布式模型预测控制的协同设计

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-01-07 DOI: 10.1109/TCNS.2025.3526729

Yi Zheng;Yueyan Zhang;Shaoyuan Li;Min Luo

引用次数: 0

Strategic Pricing and Routing to Maximize Profit in Congested Roads Considering Interactions With Travelers 考虑与出行者互动的拥挤道路上利润最大化的策略定价和路线

IF 4 3区计算机科学

IEEE Transactions on Control of Network Systems Pub Date : 2025-01-07 DOI: 10.1109/TCNS.2025.3526714

Youngseo Kim;Ning Duan;Gioele Zardini;Samitha Samaranayake;Damon Wischik

{"title":"Strategic Pricing and Routing to Maximize Profit in Congested Roads Considering Interactions With Travelers","authors":"Youngseo Kim;Ning Duan;Gioele Zardini;Samitha Samaranayake;Damon Wischik","doi":"10.1109/TCNS.2025.3526714","DOIUrl":"https://doi.org/10.1109/TCNS.2025.3526714","url":null,"abstract":"We introduce an innovative approach for analyzing strategic interactions in transportation networks featuring mobility-on-demand (MoD) services. This study focuses on achieving company–traveler equilibria, whereby a single company optimizes pricing and routing decisions to maximize profitability while considering travelers' mode choices, modeled via a multinomial logit model (MNL). Although profit maximization problems have been extensively studied in the field of revenue management across various domains, their application to transportation networks poses unique challenges, such as the influence of network topology and additional constraints (e.g., flow conservation, rebalancing, etc.). To address the inherent nonlinear relationship arising from endogenous travel demand, we shift our domain space from price to market share. Subsequently, we derive prices using a direct one-to-one correspondence within the MNL. This work is the first effort in leveraging such novel techniques in the context of transportation network analysis. Remarkably, the proposed reformulation results in an equivalent problem exhibiting convexity, offering computational efficiency and interpretability. By solving the Karush–Kuhn–Tucker conditions, we characterize user equilibrium with the generalized route cost, which incorporates the operating cost by rebalancing and travelers' disutility caused by congestion. Our approach is empirically validated through a numerical analysis conducted on the widely recognized Sioux Falls network. The results underscore the effectiveness and practical applicability of our method in analyzing transportation networks featuring MoD services and open the stage for important future investigations.","PeriodicalId":56023,"journal":{"name":"IEEE Transactions on Control of Network Systems","volume":"12 2","pages":"1638-1650"},"PeriodicalIF":4.0,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144331535","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