检索结果-内蒙古大学图书馆

consensus-Based Cooperative Droop Control for Accurate Reactive Power Sharing in Islanded AC Microgrid

IEEE JOURNAL OF EMERGING AND SELECTED TOPICS IN POWER ELECTRONICS 2020年第2期8卷 1108-1116页

作者： Zhou, Jiuyang Tsai, Meng-Jiang Cheng, Po-Tai Natl Tsing Hua Univ Inst Elect Engn Hsinchu 30013 Taiwan Natl Tsing Hua Univ Dept Elect Engn Hsinchu 30013 Taiwan

The conventional droop control technology, which can achieve autonomous power sharing among the distributed generation units, suffers from inaccurate reactive power sharing due to its dependence on line impedances. In this article, a novel consensus-based cooperative droop control technique where the droop slope gain is adaptively adjusted is proposed to improve the reactive power-sharing accuracy with the help of a sparse communication network. Through detailed small-signal analysis, it is verified that the proposed droop technique presents excellent immunity against communication delay. Laboratory test results are presented and the performances of the proposed control technique under different operation scenarios are verified, including the load change, communication link failure, and plug-and-play operation.

关键词： Reactive power Impedance Voltage control Microgrids Delays Topology Power electronics Accurate power sharing communication delay consensus algorithm distributed droop control microgrid sparse communication

来源：评论

学校读者我要写书评

暂无评论

Accelerating recursive least squares adaptation/learning algorithms using a dynamic adaptation gain

引用

Automatica 2025年 177卷

作者： Airimitoaie, Tudor-Bogdan Landau, Ioan Doré Vau, Bernard Buche, Gabriel Univ. Bordeaux CNRS Bordeaux INP IMS Talence33405 France Univ. Grenoble Alpes CNRS Grenoble INP GIPSA-lab Grenoble38000 France EXAIL 12 avenue des Coquelicots Bonneuil-sur-Marne94385 France

The concept of "dynamic adaptation gain/learning rate" has been introduced in Landau et al. (2023) in order to accelerate the adaptation/learning transients in the context of adaptation/learning algorithms using constant scalar adaptation gain/learning rate. The present paper shows that inserting a "dynamic adaptation gain/learning rate" into adaptation/learning algorithms with time varying matrix adaptation gain/learning rate belonging to the family of recursive least squares algorithms leads also to a significant acceleration of the adaptation/ learning transients. The proposed algorithms are analyzed in a deterministic and stochastic environment. This allows to emphasize the potential of these algorithms compared with the classical recursive least squares type algorithms. Comparative simulations and experimental results (an active noise control system) further illustrate the performance of these algorithms. © 2025

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Event-Triggered Control for a Class of Nonlinear Multiagent Systems With Directed Graph

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2021年第11期51卷 6986-6993页

作者： Li, Zhenxing Yan, Jun Yu, Wenwu Qiu, Jianlong Southeast Univ Sch Math Nanjing 210096 Peoples R China Linyi Univ Dept Automat Linyi 276000 Shandong Peoples R China Concordia Univ Concordia Inst Informat Syst Engn Montreal PQ Canada

By using the event-triggered technique, we study the distributed control of a class of nonlinear multiagent systems (MASs) with aperiodic sample information. Taking advantage of the combinational sample measurements, we first present an event-triggered consensus algorithm for the leaderless MAS. Thereafter, we design the event-triggered tracking algorithm for the leader-follower MAS with a leader having bounded input. Furthermore, we prove that both consensus and tracking controllers do not exist Zeno behavior. Finally, a numerical example is given to verify the designed event-triggered consensus algorithm.

关键词： Directed graphs consensus algorithm Multi-agent systems Decentralized control Topology Nonlinear dynamical systems Trajectory Directed graph event-triggered control multiagent systems (MASs) nonlinear dynamics

来源：评论

学校读者我要写书评

暂无评论

Distributed Finite-Time Secondary Frequency Control of Islanded Microgrids With Enhanced Operational Flexibility

引用

IEEE TRANSACTIONS ON ENERGY CONVERSION 2021年第3期36卷 1733-1742页

作者： Deng, Sicheng Chen, Laijun Lu, Xiaonan Zheng, Tianwen Mei, Shengwei Tsinghua Univ Dept Elect Engn & Appl Elect Technol State Key Lab Power Syst Beijing 100084 Peoples R China Qinghai Univ New Energy Ind Res Ctr Xining 810016 Peoples R China Anhui Polytech Univ Key Lab Adv Percept & Intelligent Control High En Minist Educ Wuhu 241000 Peoples R China Temple Univ Coll Engn Philadelphia PA 19122 USA Tsinghua Univ Sichuan Energy Internet Res Inst Chengdu 610042 Peoples R China

consensus-based control has been widely applied in the frequency/voltage restoration and power sharing of microgrids. Considering the existence of plug-and-play devices and accidental communication failures in microgrids, the physical and cyber structure of a microgrid may be time-varying, where the performance of traditional consensus-based control methods under ideal cases may not be guaranteed. This article proposed a novel finite-time consensus-based secondary frequency control strategy, i.e., a control strategy with finite-time convergence performance. The convergence time of the proposed control strategy is independent of both the structure and operation states of the microgrid, which guarantees the effectiveness of the control strategy under flexible operating conditions. Moreover, a detailed performance analysis of the finite-time control strategy is presented, and an optimal design method of the control parameters is developed, which significantly improves the performance of the finite-time control strategy. The flexibility of the proposed control strategy, as well as the effectiveness of the optimal design method, is verified by both simulation and experimental results.

关键词： Microgrids Convergence Frequency control Steady-state Stability analysis Design methodology Communication networks consensus algorithm finite-time convergence microgrids operational flexibility secondary frequency control

来源：评论

学校读者我要写书评

暂无评论

A Modified Distributed Gradient Dynamics for Multi-Agent Optimization on Directed Networks

引用

IEEE Transactions on Control of Network Systems 2025年

作者： Jahvani, Mohammad Guay, Martin Queen's University Department of Chemical Engineering KingstonON Canada

This paper considers the distributed convex optimization problem over directed multi-agent networks. We introduce a continuous-time coordination algorithm to solve unconstrained optimization problems with additive structure. The proposed algorithm can be interpreted as a modified version of the distributed subgradient method, enhanced with an augmented scalar state variable. Each agent is assumed to know its out-degree. Unlike existing methods that rely on a perturbed version of the push-sum algorithm, the proposed algorithm does not require any specific initialization. As a result, it is capable of handling strongly connected networks with sporadically varying sizes. We show that the proposed network flow is guaranteed to converge to the global minimizer of a sum of convex functions, provided that the local objective functions are strongly convex and have Lipschitz-continuous gradients. Additionally, by considering a class of admissible time-varying gains/step-sizes, our analysis substantiates an explicit sublinear rate of convergence for the proposed algorithm. © 2014 IEEE.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

ECM+: An improved evidential c-means with adaptive distance

引用

Fuzzy Sets and Systems 2025年 498卷

作者： Albert, Benoît Antoine, Violaine Koko, Jonas ISIMA Clermont Auvergne University UMR 6158 CNRS LIMOS Clermont-Ferrand63000 France

Evidential c-means (ECM) is a prototype-based clustering algorithm that generates a credal partition. Such a partition encompasses the notions that can be encountered with a hard, fuzzy or possibilistic partition, allowing the representation of various situations concerning the class membership of an object. The ECM method provides a prototype for each subset of the possible classes, calculated by averaging the prototypes of the classes included in the subsets. Although this definition perfectly suits ECM when employing a Euclidean distance, it becomes inappropriate when using a Mahalanobis distance. In this context, a new definition of prototypes for the subsets is proposed. The ECM objective function is then optimized using the new definition of prototypes. The subsequent algorithm, named ECM+, is finally tested on various synthetic and real data sets to demonstrate its interest compared to ECM. © 2024 Elsevier B.V.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

A dual-based first-order algorithm for ToA asynchronous localization and synchronization

引用

Signal Processing 2025年 230卷

作者： Gur, Eyal Amar, Alon Sabach, Shoham Faculty of Data and Decision Sciences Technion – Israel Institute of Technology Haifa3200003 Israel Faculty of Electrical and Computer Engineering Technion – Israel Institute of Technology Haifa3200003 Israel

Joint ToA source localization and synchronization determines the location and time offset of a radiating source using time-of-arrival measurements collected from a time-synchronized array of sensors. Various approaches have been proposed to address this non-convex and non-smooth optimization problem, which usually transform the problem by applying convex relaxations or smooth approximations. In this paper, we focus on the original joint problem and show that it can be expressed as a sum of a quadratic function with multiple non-smooth functions. This type of problems cannot be solved using traditional proximal-based methods, and we develop a tailored dual-based first-order algorithm. We analyze the proposed method, and prove its convergence to critical points of the original problem under mild assumptions. Experimental results showcase advantages of the method in terms of convergence, RMSE, bias, and complexity. © 2024 Elsevier B.V.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Layout Design Method of Indoor Space Environment Artistic Elements Based on GA-SA Hybrid algorithm

引用

International Journal of High Speed Electronics and Systems 2025年第0期

作者： Fu, Qing Li, Yan Hebei Vocational University of Industry and Technology Hebei Shijiazhuang050000 China

In order to efficiently lock the optimal layout strategy and avoid the trap of local optimal solution of a single SA algorithm, a layout design method of artistic elements in indoor space environment based on GA-SA hybrid algorithm is proposed. On the basis of analyzing the basic principles of indoor space environment layout, we should establish the goal of maximizing hierarchy, the relevance of artistic elements, simplicity, comfort, the distance between adjacent artistic elements and the utilization of effective activity space, and this goal should not be interfered with by space boundaries and artistic elements. The layout optimization model for artistic elements in indoor spatial environments, considering constraints such as human activity accessibility, is solved using a GA-SA hybrid algorithm. This approach involves initializing the population, defining a fitness function, and applying selection, crossover and mutation operations. The Metropolis-based jumping mechanism is incorporated to enhance solution exploration, iterating with a gradually decreasing temperature until the optimal layout is achieved. Experimental results indicate that this method effectively arranges artistic elements within indoor spaces, conserving floor area while creating a more spacious, comfortable and functionally distinct activity zone. The user satisfaction score reached 4.8, demonstrating the effectiveness of this layout strategy. © 2025 World Scientific Publishing Company.

关键词： consensus algorithm

来源：评论

学校读者我要写书评

暂无评论

Dynamic reputation-based consensus mechanism: Real-time transactions for energy blockchain

引用

INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS 2020年第3期16卷 1-13页

作者： Cai, Wenjun Jiang, Wei Xie, Ke Zhu, Yan Liu, Yingli Shen, Tao Kunming Univ Sci & Technol Sch Informat Engn & Automat Kunming 650500 Yunnan Peoples R China Kunming Univ Sci & Technol Comp Technol Applicat Key Lab Yunnan Prov Kunming Yunnan Peoples R China State Grid Corp China Beijing Peoples R China State Grid Informat & Telecommun Co Ltd Beijing Peoples R China

The energy blockchain is a distributed Internet protocol for energy transactions between nodes in power systems. The consensus algorithm is the core component of the energy blockchain and has an essential impact on its application. At present, in the implementation of the energy blockchain, there are problems such as low transaction throughput (transactions per second) and high latency, which cannot meet the application requirements of real-time processing transactions in the energy field. To this end, according to the analysis of conventional blockchain consensus algorithm and traditional practical Byzantine fault tolerance algorithm, a dynamic-reputation practical Byzantine fault tolerance algorithm for the energy blockchain is proposed. The dynamic-reputation practical Byzantine fault tolerance algorithm adopts a credit-based consortium node consensus election method. The monitoring node divides the remaining nodes into two types of nodes according to the reputation value: the consensus node and the secondary node, which, respectively, participate in different stages of the block generation process, and dynamically update the consensus nodes with low reputation ratings. By constructing the experimental platform simulation, the test results verify the effectiveness of the dynamic-reputation practical Byzantine fault tolerance algorithm. Compared with the algorithm of the fabric platform, the dynamic-reputation practical Byzantine fault tolerance algorithm improves the transaction processing speed and is suitable for the blockchain application in the energy field.

关键词： Energy blockchain practical Byzantine fault tolerance consensus algorithm reputation value

来源：评论

学校读者我要写书评

暂无评论

Minimum-Energy Distributed consensus Control of Multiagent Systems: A Network Approximation Approach

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2020年第3期65卷 1144-1159页

作者： Chen, Fei Chen, Jie Northeastern Univ State Key Lab Synthet Automat Proc Ind Shenyang 110004 Peoples R China Northeastern Univ Qinhuangdao Sch Control Engn Qinhuangdao 066004 Hebei Peoples R China City Univ Hong Kong Dept Elect Engn Kowloon Hong Kong Peoples R China

This paper investigates the problem of minimizing the global energy cost for multiagent systems to achieve consensus over undirected network topologies. Conventional optimization problems so defined require all-to-all network topologies for interagent communications, which precludes the use of distributed control or otherwise demands that the network be complete. To circumvent this difficulty, we introduce a network approximation (NA) scheme in the optimization criterion, which tends to render the optimization problem to one seemingly over a complete graph network, thus removing the all-to-all communication requirement. With the NA cost, we show that a distributed optimal consensus algorithm always exists for any given connected network topology, which can be determined by solving a single-agent-level parametric algebraic Ricatti equation (PARE). We also investigate the performance of the optimal consensus algorithm, focusing on the minimal energy cost required to achieve consensus optimally, and the speed at which consensus is achieved. Furthermore, for certain more special yet worthy cases, such as single-integrator, double-integrator, and first-order unstable agents, we derive explicit expressions for the energy cost and the consensus speed. It can be seen from these results that the energy cost can be made arbitrarily small for single-integrator and double-integrator systems under the optimal distributed control. On the other hand, for the first-order unstable agents, the energy cost increases and consensus speed decreases monotonically with the value of the agent's real unstable pole.

关键词： consensus algorithm Multi-agent systems Distributed algorithms Network topology Optimization Optimal control Symmetric matrices consensus speed energy cost multiagent systems network approximation (NA) parametric algebraic Ricatti equation (PARE)

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：