期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到49篇文章
< 1 2 3 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
Design of Consensus Algorithm for UAV Swarm Identity Authentication Based on Lightweight Blockchain 认领 引用
1
作者 Yuji Sang Lijun Liu +2 位作者 Long Lv Husheng Wu Hemin Yin 《Computers, Materials & Continua》 SCIE EI 2026年第5期639-663,共25页
Aiming at the challenges of low throughput,excessive consensus latency and high communication complexity in the Practical Byzantine Fault Tolerance(PBFT)algorithm in blockchain networks,its application in identity ver... Aiming at the challenges of low throughput,excessive consensus latency and high communication complexity in the Practical Byzantine Fault Tolerance(PBFT)algorithm in blockchain networks,its application in identity verification for distributed networking of a drone cluster is limited.Therefore,a lightweight blockchainbased identity authentication model for UAV swarms is designed,and a Credit-score and Grouping-mechanism Practical Byzantine Fault Tolerance(CG-PBFT)algorithm is proposed.CG-PBFT introduces a reputation score evaluation mechanism,classifies the reputation levels of nodes in the network,and optimizes the consensus process based on grouping consensus and BLS aggregate signature technology.Experimental results demonstrate that under identical experimental conditions,compared with the PBFT algorithm,CG-PBFT achieves a 250%increase in average throughput,a 70%reduction in average latency,and simultaneous enhancement in security,thus making it more suitable for UAV swarm networks. 展开更多
关键词 UAV swarm network blockchain PBFT consensus algorithm credit score
暂未订购 下载PDF
Raft Consensus Algorithm Based on Credit Model in Consortium Blockchain 认领 引用 被引量：5
2
作者 CHEN Yunfang LIU Ping ZHANG Wei 《Wuhan University Journal of Natural Sciences》 CAS CSCD 2020年第2期146-154,共9页
As one of the underlying technologies of the blockchain,the consensus algorithm plays a vital role in ensuring security and efficiency.As a consensus algorithm for the private blockchain,Raft has better performance th... As one of the underlying technologies of the blockchain,the consensus algorithm plays a vital role in ensuring security and efficiency.As a consensus algorithm for the private blockchain,Raft has better performance than the rest of the consensus algorithms,and it does not cause problems such as the concentrated hashing power,resource waste and fork.However,Raft can only be used in a non-byzantine environment with a small network size.In order to enable Raft to be used in a large-scale network with a certain number of byzantine nodes,this paper combines Raft and credit model to propose a Raft blockchain consensus algorithm based on credit model CRaft.In the node credit evaluation phase,RBF-based support vector machine is used as the anomaly detection method,and the node credit evaluation model is constructed.Then the Trust Nodes List(TNL)mechanism is introduced to make the consensus phase in a creditable network environment.Finally,the common node is synchronized to the consensus node to update the blockchain of the entire network.Experiments show that CRaft has better throughput and lower latency than the commonly used consortium blockchain consensus algorithm PBFT(Practical Byzantine Fault Tolerance). 展开更多
关键词 credit model consensus algorithm consortium blockchain P2P network
暂未订购 下载PDF
Distributed consensus algorithm for networked Euler-Lagrange systems with self-delays and uncertainties 认领 引用 被引量：3
3
作者 Xu Zhu dianguo Yan Yaohong Qu 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2012年第6期898-905,共8页
A distributed coordinated consensus problem for multiple networked Euler-Lagrange systems is studied.The communication between agents is subject to time delays,unknown parameters and nonlinear inputs,but only with the... A distributed coordinated consensus problem for multiple networked Euler-Lagrange systems is studied.The communication between agents is subject to time delays,unknown parameters and nonlinear inputs,but only with their states available for measurement.When the communication topology of the system is connected,an adaptive control algorithm with selfdelays and uncertainties is suggested to guarantee global full-state synchro-nization that the difference between the agent's positions and ve-locities asymptotically converges to zero.Moreover,the distributed sliding-mode law is given for chaotic systems with nonlinear inputs to compensate for the effects of nonlinearity.Finally,simulation results show the effectiveness of the proposed control algorithm. 展开更多
关键词 networked multi-agent system Euler-Lagrange(EL)system distributed consensus algorithm Lyapunov stability self-delay uncertainty.
暂未订购 下载PDF
A Novel GLS Consensus Algorithm for Alliance Chain in Edge Computing Environment 认领 引用
4
作者 Huijuan Wang Jiang Yong +1 位作者 Qingwei Liu Alan Yang 《Computers, Materials & Continua》 SCIE EI 2020年第10期963-976,共14页
Edge computing devices are widely deployed.An important issue that arises is in that these devices suffer from security attacks.To deal with it,we turn to the blockchain technologies.The note in the alliance chain nee... Edge computing devices are widely deployed.An important issue that arises is in that these devices suffer from security attacks.To deal with it,we turn to the blockchain technologies.The note in the alliance chain need rules to limit write permissions.Alliance chain can provide security management functions,using these functions to meet the management between the members,certification,authorization,monitoring and auditing.This article mainly analyzes some requirements realization which applies to the alliance chain,and introduces a new consensus algorithm,generalized Legendre sequence(GLS)consensus algorithm,for alliance chain.GLS algorithms inherit the recognition and verification efficiency of binary sequence ciphers in computer communication and can solve a large number of nodes verification of key distribution issues.In the alliance chain,GLS consensus algorithm can complete node address hiding,automatic task sorting,task automatic grouping,task node scope confirmation,task address binding and stamp timestamp.Moreover,the GLS consensus algorithm increases the difficulty of network malicious attack. 展开更多
关键词 Alliance chain consensus algorithm GLS data local sharing arithmetic cross-correlation
暂未订购 下载PDF
Blockchain Based Consensus Algorithm and Trustworthy Evaluation of Authenticated Subgraph Queries 认领 引用
5
作者 G.Sharmila M.K.Kavitha Devi 《Computer Systems Science & Engineering》 SCIE EI 2023年第5期1743-1758,共16页
Over the past era,subgraph mining from a large collection of graph database is a crucial problem.In addition,scalability is another big problem due to insufficient storage.There are several security challenges associa... Over the past era,subgraph mining from a large collection of graph database is a crucial problem.In addition,scalability is another big problem due to insufficient storage.There are several security challenges associated with subgraph mining in today’s on-demand system.To address this downside,our proposed work introduces a Blockchain-based Consensus algorithm for Authenticated query search in the Large-Scale Dynamic Graphs(BCCA-LSDG).The two-fold process is handled in the proposed BCCA-LSDG:graph indexing and authenticated query search(query processing).A blockchain-based reputation system is meant to maintain the trust blockchain and cloud server of the proposed architecture.To resolve the issues and provide safe big data transmission,the proposed technique also combines blockchain with a consensus algorithm architecture.Security of the big data is ensured by dividing the BC network into distinct networks,each with a restricted number of allowed entities,data kept in the cloud gate server,and data analysis in the blockchain.The consensus algorithm is crucial for maintaining the speed,performance and security of the blockchain.Then Dual Similarity based MapReduce helps in mapping and reducing the relevant subgraphs with the use of optimal feature sets.Finally,the graph index refinement process is undertaken to improve the query results.Concerning query error,fuzzy logic is used to refine the index of the graph dynamically.The proposed technique outperforms advanced methodologies in both blockchain and non-blockchain systems,and the combination of blockchain and subgraph provides a secure communication platform,according to the findings. 展开更多
关键词 Big data blockchain consensus algorithm trust management graph index
暂未订购 下载PDF
A Review: Consensus Algorithms on Blockchain 认领 引用 被引量：6
6
作者 Jannah Yusoff Zarina Mohamad Mohd Anuar 《Journal of Computer and Communications》 2022年第9期37-50,共14页
Blockchain is a distributed public ledger that keeps track of all transactions that have ever taken place in the system. As a distributed ledger, a consensus mechanism is required to ensure all the transaction functio... Blockchain is a distributed public ledger that keeps track of all transactions that have ever taken place in the system. As a distributed ledger, a consensus mechanism is required to ensure all the transaction functions properly. In order to reach a consensus, it is critical to emphasize the importance of performance and efficiency. The use of the right consensus algorithm will significantly improve the efficiency of a blockchain application. This paper reviewed several types of consensus algorithms used in blockchain and discusses the idea of a new consensus algorithm that can improve the performance of consortium blockchain. 展开更多
关键词 Consensus Algorithms Consortium Blockchain Practical Byzantine Fault Tolerance (PBFT) Performance
暂未订购 下载PDF
Improved PBFT Consensus Algorithm Based on Node Role Division 认领 引用
7
作者 Xiyu Ren Xiangrong Tong Wei Zhang 《Journal of Computer and Communications》 2023年第2期20-38,共19页
The PBFT (Practical Byzantine Fault Tolerance, PBFT) consensus algorithm, which addressed the issue of malicious nodes sending error messages to disrupt the system operation in distributed systems, was challenging to ... The PBFT (Practical Byzantine Fault Tolerance, PBFT) consensus algorithm, which addressed the issue of malicious nodes sending error messages to disrupt the system operation in distributed systems, was challenging to support massive network nodes, the common participation over all nodes in the consensus mechanism would lead to increased communication complexity, and the arbitrary selection of master nodes would also lead to inefficient consensus. This paper offered a PBFT consensus method (Role Division-based Practical Byzantine Fault Tolerance, RD-PBFT) to address the above problems based on node role division. First, the nodes in the system voted with each other to divide the high reputation group and low reputation group, and determined the starting reputation value of the nodes. Then, the mobile node in the group was divided into roles according to the high reputation value, and a total of three roles were divided into consensus node, backup node, and supervisory node to reduce the number of nodes involved in the consensus process and reduced the complexity of communication. In addition, an adaptive method was used to select the master nodes in the consensus process, and an integer value was introduced to ensure the unpredictability and equality of the master node selection. Experimentally, it was verified that the algorithm has lower communication complexity and better decentralization characteristics compared with the PBFT consensus algorithm, which improved the efficiency of consensus. 展开更多
关键词 Blockchain Consensus Algorithm Practical Byzantine Fault Tolerance Node Role Division
暂未订购 下载PDF
Optimal Distributed Dispatch of Smart Multi-Agent Energy Hubs Based on Consensus Algorithm Considering Lossy Communication Network and Uncertainty 认领 引用
8
作者 Abdelfattah A.Eladl Magda I.El-Afifi +1 位作者 Magdi M.El-Saadawi Bishoy E.Sedhom 《CSEE Journal of Power and Energy Systems》 SCIE EI CSCD 2025年第1期352-364,共13页
This paper proposes an IoT-Fog-Cloud distributed consensus algorithm for solving the energy hub(EH)dispatch problem with packet-dropping communication links and some of EH elements'uncertainties.Every generating a... This paper proposes an IoT-Fog-Cloud distributed consensus algorithm for solving the energy hub(EH)dispatch problem with packet-dropping communication links and some of EH elements'uncertainties.Every generating and consumption unit in this algorithm is required to estimate total power generated,total load,and power mismatches.Energy node coordination is accomplished using a distributed approach.Such a distributed approach wins in work sharing,enduring a single link failure,effective decision-making,quickest convergence,and autonomy for global power nodes.The method works with all grid types in connected and islanded modes.Minimizing total operation cost and emissions while meeting total demand and system constraints are the most crucial contributions of this paper.Two case studies are applied to explain performance and effectiveness of the proposed algorithm with different packet loss scenarios.Under uncertainty,sensitivity of the system was evaluated.Results show mismatch between generated and consumed power is improved by 100%in the electricity grid,99.94%in heating grid,and 99.91%in gas grid.Also,total operating cost,total emissions,and emissions cost decreased by 8.6%,13.48%,and 18.73%,respectively. 展开更多
关键词 Consensus algorithm CO2emissions energy hubs multi-energy systems packet drops
暂未订购 下载PDF
NI-HotStuff:A Reputation-Driven Committee Framework for Efficient and Robust BFT Consensus 认领 引用
9
作者 Long Zheng 《Journal of Electronic Research and Application》 2026年第1期13-27,共15页
Consensus mechanisms are fundamental to blockchain systems,ensuring that distributed nodes agree on the validity of transactions and data.However,performance bottlenecks,particularly those related to throughput,latenc... Consensus mechanisms are fundamental to blockchain systems,ensuring that distributed nodes agree on the validity of transactions and data.However,performance bottlenecks,particularly those related to throughput,latency,and node selection,have increasingly constrained the scalability of modern blockchain deployments.To address these issues,this paper proposes NI-HotStuff,a reputation-driven committee-based BFT consensus framework built upon the HotStuff protocol.A CatBoost-based reputation model is introduced to learn and evaluate historical behavioral features of nodes,enabling quantitative reputation scoring.A hardware-aware bidding mechanism is further incorporated to dynamically compute each node’s bid value and integrate it with its reputation score,thereby prioritizing stable and high-performance nodes for consensus participation.Moreover,a committee mechanism is established in which a set of committee nodes were selected from the candidate pool,and only committee members participate in the consensus process,reducing redundant communication and mitigating the performance drag caused by weak nodes.On top of that,a leader-selection strategy based on reputation values and inter-view time intervals is designed to prevent low-reputation or potentially malicious nodes from frequently becoming leaders.Experimental results demonstrate that NI-HotStuff significantly outperforms traditional PBFT and HotStuff in terms of communication overhead,consensus latency,and system throughput,with particularly notable improvements in small-and medium-scale node environments. 展开更多
关键词 Blockchain Consensus algorithm HotStuff Reputation model Bidding mechanism
暂未订购 下载PDF
Hierarchical distributed control for decentralized battery energy storage system based on consensus algorithm with pinning node 认领 引用 被引量：14
10
作者 Hanqing Yang Shihan Li +1 位作者 Qi Li Weirong Chen 《Protection and Control of Modern Power Systems》 EI 2018年第1期52-60,共9页
A decentralized battery energy storage system(DBESS)is used for stabilizing power fluctuation in DC microgrids.Different state of charge(SoC)among various battery energy storage units(BESU)during operation will reduce... A decentralized battery energy storage system(DBESS)is used for stabilizing power fluctuation in DC microgrids.Different state of charge(SoC)among various battery energy storage units(BESU)during operation will reduce batteries’service life.A hierarchical distributed control method is proposed in this paper for SoC balancing and power control according to dispatching center requirement in DBESS.A consensus algorithm with pinning node is employed to allocate power among BESUs in the secondary control whereas in the primary control,the local controller of BESU adjusts output power according to the reference power from secondary control.Part of BESUs are selected to be pinning node for accepting command from dispatching center while other BESUs as following nodes which exchange output power and SoC information with the adjacent nodes through communication network.After calculating reference power of each BESU by adopting consensus algorithm,the power sharing in DBESS is achieved according to their respective SoC of BESUs.Meanwhile,the total output power of DBESS follows the varying requirements of dispatching center.The stability of DBESS is also improved because of having no center controller.The feasibility of the proposed control strategy is validated by simulation results. 展开更多
关键词 Decentralized battery energy storage system Hierarchical distributed control Consensus algorithm Pinning node
Research on Distributed Coordination Control Method for Microgrid System Based on Finite-time Event-triggered Consensus Algorithm 认领 引用 被引量：2
11
作者 Lizhen Wu Heng Yang +1 位作者 Jianping Wei Wendong Jiang 《Chinese Journal of Electrical Engineering》 EI CSCD 2024年第2期103-115,共13页
Microgrids are networked control systems with multiple distributed generators(DGs).Microgrids are associated with many problems,such as communication delays,high sampling rates,and frequent controller updates,which ma... Microgrids are networked control systems with multiple distributed generators(DGs).Microgrids are associated with many problems,such as communication delays,high sampling rates,and frequent controller updates,which make it challenging to realize coordination control among the DGs.Therefore,finite-time consensus algorithms and event-triggered control methods are combined to propose a distributed coordination control method for microgrid systems.The DG in the microgrid system serves as an agent node in the control network,and a distributed secondary controller is designed using finite-time consensus algorithm,such that the frequency and voltage restoration control has a faster convergence time and better anti-interference performance.The event-triggered function was designed based on the state information of the agents.The controller exchanges the state information at the trigger instants.System stability is analyzed using the Lyapunov stability theory,and it is verified that the controller cannot exhibit the Zeno phenomenon in the event-triggered process.A simulation platform was developed in Matlab/Simulink to verify that the proposed control method can effectively reduce the frequency of controller updates during communication delays and the burden on the communication network. 展开更多
关键词 Microgrid event-triggered control distributed secondary control finite-time consensus algorithm coordination control
Distributed Economic Dispatch Algorithms of Microgrids Integrating Grid-Connected and Isolated Modes 认领 引用 被引量：1
12
作者 Zhongxin Liu Yanmeng Zhang +1 位作者 Yalin Zhang Fuyong Wang 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2025年第1期86-98,共13页
The economic dispatch problem(EDP) of microgrids operating in both grid-connected and isolated modes within an energy internet framework is addressed in this paper. The multi-agent leader-following consensus algorithm... The economic dispatch problem(EDP) of microgrids operating in both grid-connected and isolated modes within an energy internet framework is addressed in this paper. The multi-agent leader-following consensus algorithm is employed to address the EDP of microgrids in grid-connected mode, while the push-pull algorithm with a fixed step size is introduced for the isolated mode. The proposed algorithm of isolated mode is proven to converge to the optimum when the interaction digraph of microgrids is strongly connected. A unified algorithmic framework is proposed to handle the two modes of operation of microgrids simultaneously, enabling our algorithm to achieve optimal power allocation and maintain the balance between power supply and demand in any mode and any mode switching. Due to the push-pull structure of the algorithm and the use of fixed step size,the proposed algorithm can better handle the case of unbalanced graphs, and the convergence speed is improved. It is documented that when the transmission topology is strongly connected and there is bi-directional communication between the energy router and its neighbors, the proposed algorithm in composite mode achieves economic dispatch even with arbitrary mode switching.Finally, we demonstrate the effectiveness and superiority of our algorithm through numerical simulations. 展开更多
关键词 Consensus algorithm distributed optimization economic dispatch(ED) energy router(ER) multi-agent systems
暂未订购 下载PDF
Imp Raft:a consensus algorithm based on Raft and storage compression consensus for IoT scenario 认领 引用 被引量：1
13
作者 Li Wenzheng He Mingsheng 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2020年第3期53-61,共9页
In order to meet various challenges in the Internet of things(IoT),such as identity authentication,privacy preservation of distributed data and network security,the integration of blockchain and IoT became a new trend... In order to meet various challenges in the Internet of things(IoT),such as identity authentication,privacy preservation of distributed data and network security,the integration of blockchain and IoT became a new trend in recent years.As the key supporting technology of blockchain,the consensus algorithm is a hotspot of distributed system research.At present,the research direction of the consensus algorithm is mainly focused on improving throughput and reducing delay.However,when blockchain is applied to IoT scenario,the storage capacity of lightweight IoT devices is limited,and the normal operations of blockchain system cannot be guaranteed.To solve this problem,an improved version of Raft(Imp Raft)based on Raft and the storage compression consensus(SCC)algorithm is proposed,where initialization process and compression process are added into the flow of Raft.Moreover,the data validation process aims to ensure that blockchain data cannot be tampered with.It is obtained from experiments and analysis that the new proposed algorithm can effectively reduce the size of the blockchain and the storage burden of lightweight IoT devices. 展开更多
关键词 consensus algorithm Kafl Internet of things(IoT) blockchain
暂未订购 下载PDF
Consensus algorithm for medical data storage and sharing based on master–slave multi-chain of alliance chain 认领 引用 被引量：1
14
作者 Yixian Zhang Feng Zhao 《High-Confidence Computing》 EI 2023年第3期12-21,共10页
The safe storage and sharing of medical data have promoted the development of the public medical field.At the same time,blockchain technology guarantees the safe storage and sharing of medical data.However,the consens... The safe storage and sharing of medical data have promoted the development of the public medical field.At the same time,blockchain technology guarantees the safe storage and sharing of medical data.However,the consensus algorithm in the current medical blockchain cannot meet the requirements of low delay and high throughput in the large-scale network,and the identity of the primary node is exposed and vulnerable to attack.Therefore,this paper proposes an efficient consensus algorithm for medical data storage and sharing based on a master–slave multi-chain of alliance chain(ECA_MDSS).Firstly,institutional nodes in the healthcare alliance chain are clustered according to geographical location and medical system structure to form a multi-zones network.The system adopts master–slave multi-chain architecture to ensure security,and each zone processes transactions in parallel to improve consensus efficiency.Secondly,the aggregation signature is used to improve the practical Byzantine fault-tolerant(PBFT)consensus to reduce the communication interaction of consensus in each zone.Finally,an efficient ring signature is used to ensure the anonymity and privacy of the primary node in each zone and to prevent adaptive attacks.Meanwhile,a trust model is introduced to evaluate the trust degree of the node to reduce the evil done by malicious nodes.The experimental results show that ECA_MDSS can effectively reduce communication overhead and consensus delay,improve transaction throughput,and enhance system scalability. 展开更多
关键词 Alliance chain Master-slave multi-chain Consensus algorithm Aggregation signature Ring signature Trust value
Tilt Measurement Method of Wooden Columns in Traditional Timber Buildings Based on Adaptive RANSAC and PCA Method 认领 引用
15
作者 Minyan Zhan Wei Yang +2 位作者 Minghao Wu Hsin-Yi Wang Yu-Hsien Ho 《Structural Durability & Health Monitoring》 EI 2026年第3期395-414,共20页
The inclination of wooden columns is a key indicator for evaluating the structural safety of traditional timber buildings in China.However,accurate measurement is challenging because these columns typically exhibit na... The inclination of wooden columns is a key indicator for evaluating the structural safety of traditional timber buildings in China.However,accurate measurement is challenging because these columns typically exhibit natural tapering,with diameters decreasing from the base to the top,and surface irregularities such as artificial cuts,cracks,and knots.Both the intrinsic geometric characteristics and surface defects reduce the precision of coordinate acquisition and the reliability of inclination estimation.To overcome these limitations,this study proposes a novel inclination measurement method for wooden columns in traditional timber buildings based on multi-section measurement and spatial line fitting.An adaptive random sample consensus algorithm is employed to effectively remove outliers induced by surface damage and measurement noise.Subsequently,principal component analysis is used to fit a three-dimensional spatial line through the center points of multiple cross-sections,enabling accurate computation of the inclination angle while accounting for structural imperfections.Moreover,the effects of damage defects,the number of measuring points,the measurement range,and the number of selected cross-sections on measurement accuracy are systematically investigated through statistical analysis,and corresponding recommended values for engineering practice are provided.The proposed method offers an efficient and reliable solution for inclination measurement,supporting the inspection and structural safety assessment of traditional timber columns. 展开更多
关键词 Traditional timber building inclination measurement of wooden column adaptive random sample consensus algorithm principal component analysis
暂未订购 下载PDF
A Fast Averaging Synchronization Algorithm for Clock Oscillators in Nonlinear Dynamical Network with Arbitrary Time-delays 认领 引用 被引量：7
16
作者 CHEN Jie YU Miao +1 位作者 DOU Li-Hua GAN Ming-Gang 《自动化学报》 EI CAS 北大核心 2010年第6期873-880,共8页
This paper investigates the synchronization problem of clock oscillators in nonlinear dynamical network with arbitrary time-delays.First,a dynamic synchronization algorithm based on consensus control strategy,named fa... This paper investigates the synchronization problem of clock oscillators in nonlinear dynamical network with arbitrary time-delays.First,a dynamic synchronization algorithm based on consensus control strategy,named fast averaging syn-chronization algorithm(FASA),is presented to find a solution to the synchronization problem.This algorithm can compensate the clock skew and offset differences between clock nodes,achieving the synchronization of clock nodes in a shorter time as compared to previous synchronization methods.Second,because of the dynamical performance of FASA,it is characterized from the perspective of compartmental dynamical system with arbitrary time-delays.In this case,the algorithm guarantees the states of all clock nodes in dynamical network converge to Lyapunov stable equilibria.Finally,numerical simulations and experimental results demonstrate the correctness and effciency of the FASA,which means that the clock nodes can reach global consensus,and the synchronization error can reach nanosecond order of magnitude. 展开更多
关键词 Clock synchronization dynamical network arbitrary time-delays consensus algorithm
暂未订购 下载PDF
Necessary and Sufficient Conditions for Consensus in Third Order Multi-Agent Systems 认领 引用 被引量：11
17
作者 Chi Huang Guisheng Zhai Gesheng Xu 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2018年第6期1044-1053,共10页
We deal with a consensus control problem for a group of third order agents which are networked by digraphs.Assuming that the control input of each agent is constructed based on weighted difference between its states a... We deal with a consensus control problem for a group of third order agents which are networked by digraphs.Assuming that the control input of each agent is constructed based on weighted difference between its states and those of its neighbor agents, we aim to propose an algorithm on computing the weighting coefficients in the control input. The problem is reduced to designing Hurwitz polynomials with real or complex coefficients. We show that by using Hurwitz polynomials with complex coefficients, a necessary and sufficient condition can be obtained for designing the consensus algorithm. Since the condition is both necessary and sufficient, we provide a kind of parametrization for all the weighting coefficients achieving consensus. Moreover, the condition is a natural extension to second order consensus, and is reasonable and practical due to its comparatively decreased computation burden. The result is also extended to the case where communication delay exists in the control input. 展开更多
关键词 Communication delay consensus algorithms,graph Laplacians Hurwitz polynomials third order multi-agent systems.
暂未订购 下载PDF
RGS-PBFT:A Reputation-Based Grouping and Supervision PBFT 认领 引用
18
作者 Xiangyuan Qi Guanglei Qiang +2 位作者 Qianxiang Zhang Zhuokun Fan Yu Du 《Journal of Electronic Research and Application》 2026年第2期21-31,共11页
To address the problems of high communication overhead,insufficient robustness in master node election,and difficulty in timely management of faulty nodes in large-scale networks,the traditional PBFT consensus algorit... To address the problems of high communication overhead,insufficient robustness in master node election,and difficulty in timely management of faulty nodes in large-scale networks,the traditional PBFT consensus algorithm is proposed as a reputation-based grouping and supervision PBFT(RGS-PBFT).This method constructs a dynamic reputation score model based on the behavioral characteristics of nodes during the consensus process,such as verification correctness,voting participation,and operational stability.Based on this model,nodes are divided into consensus groups,candidate node groups,and ordinary node groups,enabling adaptive adjustment of node roles.During the master node election phase,the top 5%of nodes with the highest reputation scores from the consensus groups are selected as the candidate set.The ordinary node group and the candidate node group elect the master node through reputation-weighted voting,thus balancing the reliability of the master node with the decentralized nature of the election process.During the consensus process,only the consensus group participates in the core voting and confirmation process of PBFT to reduce communication complexity,while the remaining nodes mainly undertake verification and supervision responsibilities.Simultaneously,a monitoring and punishment mechanism for low-reputation nodes is introduced to limit,downgrade,and isolate faulty and abnormal nodes.Experimental results show that this mechanism,while maintaining Byzantine fault tolerance,can effectively reduce consensus communication overhead and improve master node election stability and overall system performance. 展开更多
关键词 PBFT Blockchain Reputation score Consensus algorithm Node classification
暂未订购 下载PDF
Distributed Cooperative Control Algorithm for Multi-UAV Mission Rendezvous 认领 引用 被引量：6
19
作者 Liu Guoliang Xing Dongjing +2 位作者 Hou Jianyong Jin Guting Zhen Ziyang 《Transactions of Nanjing University of Aeronautics and Astronautics》 EI CSCD 2017年第6期617-626,共10页
Multiple unmanned aerial vehicles(UAVs)cooperative operation is the main form for UAVs fighting in battlefield,and multi-UAV mission rendezvous is the premise of cooperative reconnaissance and attack missions.We propo... Multiple unmanned aerial vehicles(UAVs)cooperative operation is the main form for UAVs fighting in battlefield,and multi-UAV mission rendezvous is the premise of cooperative reconnaissance and attack missions.We propose a rendezvous control strategy,which divides the rendezvous process into two parts:The loose formation rendezvous and the close formation rendezvous.In the first stage,UAVs are supposed to reach the specific target locations simultaneously and form a loose formation.A distributed control strategy based on first-order consensus algorithm is presented to achieve this goal.Then the second stage is designed based on the second-order consensus algorithm to complete the transition from the loose formation to the close formation.This process needs the speeds and heading angles of UAVs to reach an agreement.Besides,control algorithms with a virtual leader are proposed,by which the formation states can reach a specific value.Finally,simulation results show that the control algorithms are capable of realizing the mission rendezvous of multi-UAV and the consistence of UAVs′final states,which verify the effectiveness and feasibility of the designed control strategy. 展开更多
关键词 unmanned aerial vehicles loose formation rendezvous close formation rendezvous consensus algorithm cooperative control
暂未订购 下载PDF
Global FLS-based Consensus of Stochastic Uncertain Nonlinear Multi-agent Systems 认领 引用 被引量：1
20
作者 Jia-Xi Chen Jun-Min Li 《International Journal of Automation and computing》 CSCD 2021年第5期826-837,共12页
Using graph theory, matrix theory, adaptive control, fuzzy logic systems and other tools, this paper studies the leader-follower global consensus of two kinds of stochastic uncertain nonlinear multi-agent systems(MAS)... Using graph theory, matrix theory, adaptive control, fuzzy logic systems and other tools, this paper studies the leader-follower global consensus of two kinds of stochastic uncertain nonlinear multi-agent systems(MAS). Firstly, the fuzzy logic systems replaces the feedback compensator as the feedforward compensator to describe the uncertain nonlinear dynamics. Secondly, based on the network topology, all followers are divided into two categories: One is the followers who can obtain the leader signal, and the other is the follower who cannot obtain the leader signal. Thirdly, based on the adaptive control method, distributed control protocols are designed for the two types of followers. Fourthly, based on matrix theory and stochastic Lyapunov stability theory, the stability of the closed-loop systems is analyzed. Finally, three simulation examples are given to verify the effectiveness of the proposed control algorithms. 展开更多
关键词 Fuzzy logic systems stochastic nonlinear multi-agent systems(MAS) consensus algorithm adaptive control
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 3 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈