The research and development of new traditional Chinese medicine(TCM)drugs have progressively established a novel system founded on the integration of TCM theory,human experience,and clinical trials(termed the“Three ...The research and development of new traditional Chinese medicine(TCM)drugs have progressively established a novel system founded on the integration of TCM theory,human experience,and clinical trials(termed the“Three Combinations”).However,considering TCM's distinctive features of“syndrome differentiation and treatment”and“multicomponent formulations and complex mechanisms”,current TCM drug development faces challenges such as insufficient understanding of the material basis and the overall mechanism of action and an incomplete evidence chain system.Moreover,significant obstacles persist in gathering human experience data,evaluating clinical efficacy,and controlling the quality of active ingredients,which impede the innovation process in TCM drug development.Network pharmacology,centered on the“network targets”theory,transcends the limitations of the conventional“single target”reductionist research model.It emphasizes the comprehensive effects of disease or syndrome biological networks as targets to elucidate the overall regulatory mechanism of TCM prescriptions.This approach aligns with the holistic perspective of TCM,offering a novel method consistent with TCM's holistic view for investigating the complex mechanisms of TCM and developing new TCM drugs.It is internationally recognized as a“next-generation drug research model”.To advance the research of new tools,methods,and standards for TCM evaluation and to overcome fundamental,critical,and cutting-edge technical challenges in TCM regulation,this consensus aims to explore the characteristics,progress,challenges,applicable pathways,and specific applications of network pharmacology as a new theory,method,and tool in TCM drug development.The goal is to enhance the quality of TCM drug research and development and accelerate the efficiency of developing new TCM products.展开更多
Blockchain-based spectrum sharing with consensus is the key technology for sixth-generation mobile communication to realize dynamic spectrum management.In order to avoid the waste of computing and communication resour...Blockchain-based spectrum sharing with consensus is the key technology for sixth-generation mobile communication to realize dynamic spectrum management.In order to avoid the waste of computing and communication resources,a spectrum sharing policy-based consensus mechanism is proposed in this paper.Firstly,a spectrum sharing algorithm based on graph neural network is designed in the satelliteterrestrial spectrum sharing networks under the underlay model.It avoids high computational overhead of the traditional iterative optimization algorithm when the wireless channel condition and network topology are highly dynamic.Secondly,a consensus mechanism based on spectrum sharing strategy is designed,which converts the traditional meaningless hash problem into the graph neural network training.Miners compete for accounting rights by training a graph neutral network model that meets the spectrum sharing requirement.Finally,the consensus delay,communication and storage overhead of the proposed consensus mechanism are analyzed theoretically.The simulation results show that the proposed consensus mechanism can effectively improve spectrum efficiency with excellent scalability and generalization performance.展开更多
In the current information society, the dissemination mechanisms and evolution laws of individual or collective opinions and their behaviors are the research hot topics in the field of opinion dynamics. First, in this...In the current information society, the dissemination mechanisms and evolution laws of individual or collective opinions and their behaviors are the research hot topics in the field of opinion dynamics. First, in this paper, a two-layer network consisting of an individual-opinion layer and a collective-opinion layer is constructed, and a dissemination model of opinions incorporating higher-order interactions(i.e. OIHOI dissemination model) is proposed. Furthermore, the dynamic equations of opinion dissemination for both individuals and groups are presented. Using Lyapunov's first method,two equilibrium points, including the negative consensus point and positive consensus point, and the dynamic equations obtained for opinion dissemination, are analyzed theoretically. In addition, for individual opinions and collective opinions,some conditions for reaching negative consensus and positive consensus as well as the theoretical expression for the dissemination threshold are put forward. Numerical simulations are carried to verify the feasibility and effectiveness of the proposed theoretical results, as well as the influence of the intra-structure, inter-connections, and higher-order interactions on the dissemination and evolution of individual opinions. The main results are as follows.(i) When the intra-structure of the collective-opinion layer meets certain characteristics, then a negative or positive consensus is easier to reach for individuals.(ii) Both negative consensus and positive consensus perform best in mixed type of inter-connections in the two-layer network.(iii) Higher-order interactions can quickly eliminate differences in individual opinions, thereby enabling individuals to reach consensus faster.展开更多
Intelligent blockchain is an emerging field that integrates Artificial Intelligence(AI)techniques with blockchain networks,with a particular emphasis on improving the performance of blockchain,especially in cryptocurr...Intelligent blockchain is an emerging field that integrates Artificial Intelligence(AI)techniques with blockchain networks,with a particular emphasis on improving the performance of blockchain,especially in cryptocurrencies exchanges.Meanwhile,arbitrage bots are widely deployed and increasing in intelligent blockchain.These bots exploit the characteristics of cryptocurrencies exchanges to engage in frontrunning,generating substantial profits at the expense of ordinary users.In this paper,we address this issue by proposing a more efficient asynchronous Byzantine ordered consensus protocol,which can be used to prevent arbitrage bots from changing the order of the transactions for profits in intelligent blockchain-based cryptocurrencies.Specifically,we present two signal asynchronous common subset protocols,the more optimal one with only constant time complexity.We implement both our protocol and the optimal existing solution Chronos with Go language in the same environment.The experiment results indicate that our protocols achieve a threefold improvement over Chronos in consensus latency and nearly a tenfold increase in throughput.展开更多
This paper highlights the utilization of parallel control and adaptive dynamic programming(ADP) for event-triggered robust parallel optimal consensus control(ETRPOC) of uncertain nonlinear continuous-time multiagent s...This paper highlights the utilization of parallel control and adaptive dynamic programming(ADP) for event-triggered robust parallel optimal consensus control(ETRPOC) of uncertain nonlinear continuous-time multiagent systems(MASs).First, the parallel control system, which consists of a virtual control variable and a specific auxiliary variable obtained from the coupled Hamiltonian, allows general systems to be transformed into affine systems. Of interest is the fact that the parallel control technique's introduction provides an unprecedented perspective on eliminating the negative effects of disturbance. Then, an eventtriggered mechanism is adopted to save communication resources while ensuring the system's stability. The coupled HamiltonJacobi(HJ) equation's solution is approximated using a critic neural network(NN), whose weights are updated in response to events. Furthermore, theoretical analysis reveals that the weight estimation error is uniformly ultimately bounded(UUB). Finally,numerical simulations demonstrate the effectiveness of the developed ETRPOC method.展开更多
This paper proposes second-order consensus protocols with time-delays and gives the measure of the robustness of the protocols to the time-delay existing in the network of agents with second-order dynamics. By employi...This paper proposes second-order consensus protocols with time-delays and gives the measure of the robustness of the protocols to the time-delay existing in the network of agents with second-order dynamics. By employing a frequency domain method, it is proven that the information states and their time derivatives of all the agents in the network achieve consensus asymptotically, respectively, for appropriate communication timedelay if the topology of weighted network is connected. Particularly, a tight upper bound on the communication time-delay that can be tolerated in the dynamic network is found. The consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which reduces the complexity of connections between neighboring agents significantly. Numerical simulation results are provided to demonstrate the effectiveness and the sharpness of the theoretical results for second-order consensus in networks in the presence of communication time-delays.展开更多
This paper studies the weighted average consensus problem for networks of agents with fixed directed asymmetric unbalance information exchange topology. We suppose that the classical distributed consensus protocol is ...This paper studies the weighted average consensus problem for networks of agents with fixed directed asymmetric unbalance information exchange topology. We suppose that the classical distributed consensus protocol is destroyed by diverse time-delays which include communication time-delay and self time-delay. Based on the generalized Nyquist stability criterion and the Gerschgorin disk theorem, some sufficient conditions for the consensus of multi-agent systems are obtained. And we give the expression of the weighted average consensus value for our consensus protocol. Finally, numerical examples are presented to illustrate the theoretical results.展开更多
In this paper, the finite-time consensus of a leader-following multi-agent network with non-identical nonlinear dynamics and time-varying topologies is investigated. All the agents, especially the leaders, have non-id...In this paper, the finite-time consensus of a leader-following multi-agent network with non-identical nonlinear dynamics and time-varying topologies is investigated. All the agents, especially the leaders, have non-identical and nonlinear dynamics. According to the algebraic graph theory, Lyapunov stability theory and Kronecker product, a control strategy strategy is established to guarantee the finite-time consensus of multi-agent network with multiple leaders. Furthermore, several numerical simulations illustrate the effectiveness and feasibility of the proposed method.展开更多
Community detection is a fundamental work to analyse the structural and functional properties of complex networks. The label propagation algorithm （LPA） is a near linear time algorithm to find a good community struc...Community detection is a fundamental work to analyse the structural and functional properties of complex networks. The label propagation algorithm （LPA） is a near linear time algorithm to find a good community structure. Despite various subsequent advances, an important issue of this algorithm has not yet been properly addressed. Random update orders within the algorithm severely hamper the stability of the identified community structure. In this paper, we executed the basic label propagation algorithm on networks multiple times, to obtain a set of consensus partitions. Based on these consensus partitions, we created a consensus weighted graph. In this consensus weighted graph, the weight value of the edge was the proportion value that the number of node pairs allocated in the same cluster was divided by the total number of partitions. Then, we introduced consensus weight to indicate the direction of label propagation. In label update steps, by computing the mixing value of consensus weight and label frequency, a node adopted the label which has the maximum mixing value instead of the most frequent one. For extending to different networks, we introduced a proportion parameter to adjust the proportion of consensus weight and label frequency in computing mixing value. Finally, we proposed an approach named the label propagation algorithm with consensus weight （LPAcw）, and the experimental results showed that the LPAcw could enhance considerably both the stability and the accuracy of community partitions.展开更多
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 ...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.展开更多
This paper proposes a distributed second-order consensus time synchronization, which incorporates the second-order consensus algorithm into wireless sensor networks. Since local clocks may have different skews and off...This paper proposes a distributed second-order consensus time synchronization, which incorporates the second-order consensus algorithm into wireless sensor networks. Since local clocks may have different skews and offsets, the algorithm is designed to include offset compensation and skew compensation. The local clocks are not directly modified, thus the virtual clocks are built according to the local clocks via the compensation parameters. Each node achieves a virtual consensus clock by periodically updated compensation parameters. Finally, the effectiveness of the proposed algorithm is verified through a number of simulations in a mesh network. It is proved that the proposed algorithm has the advantage of being distributed, asymptotic convergence, and robust to new node joining.展开更多
This paper investigates the differentially private problem of the average consensus for a class of discrete-time multi-agent network systems(MANSs). Based on the MANSs,a new distributed differentially private consensu...This paper investigates the differentially private problem of the average consensus for a class of discrete-time multi-agent network systems(MANSs). Based on the MANSs,a new distributed differentially private consensus algorithm(DPCA) is developed. To avoid continuous communication between neighboring agents, a kind of intermittent communication strategy depending on an event-triggered function is established in our DPCA. Based on our algorithm, we carry out the detailed analysis including its convergence, its accuracy, its privacy and the trade-off between the accuracy and the privacy level, respectively. It is found that our algorithm preserves the privacy of initial states of all agents in the whole process of consensus computation. The trade-off motivates us to find the best achievable accuracy of our algorithm under the free parameters and the fixed privacy level. Finally, numerical experiment results testify the validity of our theoretical analysis.展开更多
The advent of blockchain technology has transformed traditional methods of information exchange,shifting reliance from centralized data centers to decentralized frameworks.While blockchain’s decentralization and secu...The advent of blockchain technology has transformed traditional methods of information exchange,shifting reliance from centralized data centers to decentralized frameworks.While blockchain’s decentralization and security are strengths,traditional consensus mechanisms like Proof of Work(PoW)and Proof of Stake(PoS)face limitations in scalability.PoW achieves decentralization and security but struggles with scalability as transaction volumes grow,while PoS enhances scalability,but risks centralization due to monopolization by high-stake participants.Sharding,a recent advancement in blockchain technology,addresses scalability by partitioning the network into shards that process transactions independently,thereby improving throughput and reducing latency.However,cross-shard communication,essential for transactions involving multiple shards,introduces challenges in coordination and fault tolerance.This research introduces a shard-based hybrid consensus model,PoSW,which combines PoW and PoS to mitigate the limitations of both mechanisms.By integrating PoW’s fairness with PoS’s scalability in a shard-based blockchain,the proposed model addresses key issues of scalability and monopolization.We evaluate the model against state-of-the-art consensus algorithms,including Monoxide and Practical Byzantine Fault Tolerance(PBFT).The results show that the proposed PoSW model reduces communication overhead compared to PBFT and improves resource utilization over Monoxide.In addition to performance gains,the security analysis demonstrates that the PoSW model provides robust defense against common blockchain attacks such as the 51%and Sybil attacks,etc.The proposed approach is particularly suited for applications like decentralized finance(DeFi)and supply chain management,which require both high scalability and robust security.The contributions of this research include the development of the PoSW hybrid consensus mechanism,its comparative evaluation with leading algorithms,and a thorough security analysis.These contributions represent a significant step forward in addressing blockchain’s scalability,fairness,and security challenges.展开更多
Due to people’s increasing dependence on social networks,it is essential to develop a consensus model considering not only their own factors but also the interaction between people.Both external trust relationship am...Due to people’s increasing dependence on social networks,it is essential to develop a consensus model considering not only their own factors but also the interaction between people.Both external trust relationship among experts and the internal reliability of experts are important factors in decision-making.This paper focuses on improving the scientificity and effectiveness of decision-making and presents a consensus model combining trust relationship among experts and expert reliability in social network group decision-making(SN-GDM).A concept named matching degree is proposed to measure expert reliability.Meanwhile,linguistic information is applied to manage the imprecise and vague information.Matching degree is expressed by a 2-tuple linguistic model,and experts’preferences are measured by a probabilistic linguistic term set(PLTS).Subsequently,a hybrid weight is explored to weigh experts’importance in a group.Then a consensus measure is introduced and a feedback mechanism is developed to produce some personalized recommendations with higher group consensus.Finally,a comparative example is provided to prove the scientificity and effectiveness of the proposed consensus model.展开更多
Double-integrator multi-agent systems(MASs)might not achieve dynamical consensus,even if only partial agents suffer from self-sensing function failures(SSFFs).SSFFs might be asynchronous in real engineering applicatio...Double-integrator multi-agent systems(MASs)might not achieve dynamical consensus,even if only partial agents suffer from self-sensing function failures(SSFFs).SSFFs might be asynchronous in real engineering application.The existing fault-tolerant dynamical consensus protocol suitable for synchronous SSFFs cannot be directly used to tackle fault-tolerant dynamical consensus of double-integrator MASs with partial agents subject to asynchronous SSFFs.Motivated by these facts,this paper explores a new fault-tolerant dynamical consensus protocol suitable for asynchronous SSFFs.First,multi-hop communication together with the idea of treating asynchronous SSFFs as multiple piecewise synchronous SSFFs is used for recovering the connectivity of network topology among all normal agents.Second,a fault-tolerant dynamical consensus protocol is designed for double-integrator MASs by utilizing the history information of an agent subject to SSFF for computing its own state information at the instants when its minimum-hop normal neighbor set changes.Then,it is theoretically proved that if the strategy of network topology connectivity recovery and the fault-tolerant dynamical consensus protocol with proper time-varying gains are used simultaneously,double-integrator MASs with all normal agents and all agents subject to SSFFs can reach dynamical consensus.Finally,comparison numerical simulations are given to illustrate the effectiveness of the theoretical results.展开更多
This paper addresses the decentralized consensus problem for a system of multiple dynamic agents with remote controllers via networking,known as a networked control multi-agent system(NCMAS).It presents a challenging ...This paper addresses the decentralized consensus problem for a system of multiple dynamic agents with remote controllers via networking,known as a networked control multi-agent system(NCMAS).It presents a challenging scenario where partial dynamic entities or remote control units are vulnerable to disclosure attacks,making them potentially malicious.To tackle this issue,we propose a secure decentralized control design approach employing a double-layer cryptographic strategy.This approach not only ensures that the input and output information of the benign entities remains protected from the malicious entities but also practically achieves consensus performance.The paper provides an explicit design,supported by theoretical proof and numerical verification,covering stability,steady-state error,and the prevention of computation overflow or underflow.展开更多
This paper investigates second-order consensus of multi-agent systems with a virtual leader of varying velocity while preserving network connectivity.We propose a novel second-order consensus algorithm with bounded co...This paper investigates second-order consensus of multi-agent systems with a virtual leader of varying velocity while preserving network connectivity.We propose a novel second-order consensus algorithm with bounded control inputs.Under the condition that the initial network is connected,the network will be connected all the time and all agents and the virtual leader can attain the same position and move with the same velocity.A simulation example is proposed to illustrate the effective of the proposed algorithm.展开更多
Scale-free networks and consensus behaviour among multiple agents have both attracted much attention. To investigate the consensus speed over scale-free networks is the major topic of the present work. A novel method ...Scale-free networks and consensus behaviour among multiple agents have both attracted much attention. To investigate the consensus speed over scale-free networks is the major topic of the present work. A novel method is developed to construct scale-free networks due to their remarkable power-law degree distributions, while preserving the diversity of network topologies. The time cost or iterations for networks to reach a certain level of consensus is discussed, considering the influence from power-law parameters. They are both demonstrated to be reversed power-law functions of the algebraic connectivity, which is viewed as a measurement on convergence speed of the consensus behaviour. The attempts of tuning power-law parameters may speed up the consensus procedure, but it could also make the network less robust over time delay at the same time. Large scale of simulations are supportive to the conclusions.展开更多
The bounded consensus tracking problems of second-order multi-agent systems under directed networks with sam- pling delay are addressed in this paper. When the sampling delay is more than a sampling period, new protoc...The bounded consensus tracking problems of second-order multi-agent systems under directed networks with sam- pling delay are addressed in this paper. When the sampling delay is more than a sampling period, new protocols based on sampled-data control are proposed so that each agent can track the time-varying reference state of the virtual leader. By using the delay decomposition approach, the augmented matrix method, and the frequency domain analysis, necessary and sufficient conditions are obtained, which guarantee that the bounded consensus tracking is realized. Furthermore, some numerical simulations are presented to demonstrate the effectiveness of the theoretical results.展开更多
基金supported by the National Medical Products Administration Commissioned Research Project (No.20211440216)the National Administration of Traditional Chinese Medicine Science and Technology Project (No.GZY-KJS-2024-03)+3 种基金the State Key Laboratory of Drug Regulatory Science Project (No.2023SKLDRS0104)the Basic Research Program Natural Science Fund-Frontier Leading Technology Basic Research Special Project of Jiangsu Province (No.BK20232014)the Programs Foundation for Leading Talents in National Administration of Traditional Chinese Medicine of China“Qihuang scholars”Projectthe Tianjin Administration for Market Regulation Science and Technology Key Projects (No.2022-W35)。
文摘The research and development of new traditional Chinese medicine(TCM)drugs have progressively established a novel system founded on the integration of TCM theory,human experience,and clinical trials(termed the“Three Combinations”).However,considering TCM's distinctive features of“syndrome differentiation and treatment”and“multicomponent formulations and complex mechanisms”,current TCM drug development faces challenges such as insufficient understanding of the material basis and the overall mechanism of action and an incomplete evidence chain system.Moreover,significant obstacles persist in gathering human experience data,evaluating clinical efficacy,and controlling the quality of active ingredients,which impede the innovation process in TCM drug development.Network pharmacology,centered on the“network targets”theory,transcends the limitations of the conventional“single target”reductionist research model.It emphasizes the comprehensive effects of disease or syndrome biological networks as targets to elucidate the overall regulatory mechanism of TCM prescriptions.This approach aligns with the holistic perspective of TCM,offering a novel method consistent with TCM's holistic view for investigating the complex mechanisms of TCM and developing new TCM drugs.It is internationally recognized as a“next-generation drug research model”.To advance the research of new tools,methods,and standards for TCM evaluation and to overcome fundamental,critical,and cutting-edge technical challenges in TCM regulation,this consensus aims to explore the characteristics,progress,challenges,applicable pathways,and specific applications of network pharmacology as a new theory,method,and tool in TCM drug development.The goal is to enhance the quality of TCM drug research and development and accelerate the efficiency of developing new TCM products.
基金supported in part by the National Natural Science Foundation of China under Grant 62171020.
文摘Blockchain-based spectrum sharing with consensus is the key technology for sixth-generation mobile communication to realize dynamic spectrum management.In order to avoid the waste of computing and communication resources,a spectrum sharing policy-based consensus mechanism is proposed in this paper.Firstly,a spectrum sharing algorithm based on graph neural network is designed in the satelliteterrestrial spectrum sharing networks under the underlay model.It avoids high computational overhead of the traditional iterative optimization algorithm when the wireless channel condition and network topology are highly dynamic.Secondly,a consensus mechanism based on spectrum sharing strategy is designed,which converts the traditional meaningless hash problem into the graph neural network training.Miners compete for accounting rights by training a graph neutral network model that meets the spectrum sharing requirement.Finally,the consensus delay,communication and storage overhead of the proposed consensus mechanism are analyzed theoretically.The simulation results show that the proposed consensus mechanism can effectively improve spectrum efficiency with excellent scalability and generalization performance.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.72031009 and 61473338)。
文摘In the current information society, the dissemination mechanisms and evolution laws of individual or collective opinions and their behaviors are the research hot topics in the field of opinion dynamics. First, in this paper, a two-layer network consisting of an individual-opinion layer and a collective-opinion layer is constructed, and a dissemination model of opinions incorporating higher-order interactions(i.e. OIHOI dissemination model) is proposed. Furthermore, the dynamic equations of opinion dissemination for both individuals and groups are presented. Using Lyapunov's first method,two equilibrium points, including the negative consensus point and positive consensus point, and the dynamic equations obtained for opinion dissemination, are analyzed theoretically. In addition, for individual opinions and collective opinions,some conditions for reaching negative consensus and positive consensus as well as the theoretical expression for the dissemination threshold are put forward. Numerical simulations are carried to verify the feasibility and effectiveness of the proposed theoretical results, as well as the influence of the intra-structure, inter-connections, and higher-order interactions on the dissemination and evolution of individual opinions. The main results are as follows.(i) When the intra-structure of the collective-opinion layer meets certain characteristics, then a negative or positive consensus is easier to reach for individuals.(ii) Both negative consensus and positive consensus perform best in mixed type of inter-connections in the two-layer network.(iii) Higher-order interactions can quickly eliminate differences in individual opinions, thereby enabling individuals to reach consensus faster.
基金supported by the National Key R&D Program of China under Grant(2022YFB2702702)in part by the National Natural Science Foundation of China under Grants(62372020,72031001)+1 种基金in part by the Beijing Natural Science Foundation under Grants(L222050)in part by the Fundamental Research Funds for the Central Universities under Grant(YWF-23-L-1032).
文摘Intelligent blockchain is an emerging field that integrates Artificial Intelligence(AI)techniques with blockchain networks,with a particular emphasis on improving the performance of blockchain,especially in cryptocurrencies exchanges.Meanwhile,arbitrage bots are widely deployed and increasing in intelligent blockchain.These bots exploit the characteristics of cryptocurrencies exchanges to engage in frontrunning,generating substantial profits at the expense of ordinary users.In this paper,we address this issue by proposing a more efficient asynchronous Byzantine ordered consensus protocol,which can be used to prevent arbitrage bots from changing the order of the transactions for profits in intelligent blockchain-based cryptocurrencies.Specifically,we present two signal asynchronous common subset protocols,the more optimal one with only constant time complexity.We implement both our protocol and the optimal existing solution Chronos with Go language in the same environment.The experiment results indicate that our protocols achieve a threefold improvement over Chronos in consensus latency and nearly a tenfold increase in throughput.
基金supported in part by the National Key Research and Development Program of China(2021YFE0206100)the National Natural Science Foundation of China(62425310,62073321)+2 种基金the National Defense Basic Scientific Research Program(JCKY2019203C029,JCKY2020130C025)the Science and Technology Development FundMacao SAR(FDCT-22-009-MISE,0060/2021/A2,0015/2020/AMJ)
文摘This paper highlights the utilization of parallel control and adaptive dynamic programming(ADP) for event-triggered robust parallel optimal consensus control(ETRPOC) of uncertain nonlinear continuous-time multiagent systems(MASs).First, the parallel control system, which consists of a virtual control variable and a specific auxiliary variable obtained from the coupled Hamiltonian, allows general systems to be transformed into affine systems. Of interest is the fact that the parallel control technique's introduction provides an unprecedented perspective on eliminating the negative effects of disturbance. Then, an eventtriggered mechanism is adopted to save communication resources while ensuring the system's stability. The coupled HamiltonJacobi(HJ) equation's solution is approximated using a critic neural network(NN), whose weights are updated in response to events. Furthermore, theoretical analysis reveals that the weight estimation error is uniformly ultimately bounded(UUB). Finally,numerical simulations demonstrate the effectiveness of the developed ETRPOC method.
基金supported by the National Natural Science Foundation of China (6057408860274014)
文摘This paper proposes second-order consensus protocols with time-delays and gives the measure of the robustness of the protocols to the time-delay existing in the network of agents with second-order dynamics. By employing a frequency domain method, it is proven that the information states and their time derivatives of all the agents in the network achieve consensus asymptotically, respectively, for appropriate communication timedelay if the topology of weighted network is connected. Particularly, a tight upper bound on the communication time-delay that can be tolerated in the dynamic network is found. The consensus protocols are distributed in the sense that each agent only needs information from its neighboring agents, which reduces the complexity of connections between neighboring agents significantly. Numerical simulation results are provided to demonstrate the effectiveness and the sharpness of the theoretical results for second-order consensus in networks in the presence of communication time-delays.
基金supported by the National Natural Science Foundation of China(6127312661363002+3 种基金61374104)the Natural Science Foundation of Guangdong Province(10251064101000008S2012010009675)the Fundamental Research Funds for the Central Universities(2012ZM0059)
文摘This paper studies the weighted average consensus problem for networks of agents with fixed directed asymmetric unbalance information exchange topology. We suppose that the classical distributed consensus protocol is destroyed by diverse time-delays which include communication time-delay and self time-delay. Based on the generalized Nyquist stability criterion and the Gerschgorin disk theorem, some sufficient conditions for the consensus of multi-agent systems are obtained. And we give the expression of the weighted average consensus value for our consensus protocol. Finally, numerical examples are presented to illustrate the theoretical results.
基金Supported by the National Natural Science Foundation of China(6147333861304164)
文摘In this paper, the finite-time consensus of a leader-following multi-agent network with non-identical nonlinear dynamics and time-varying topologies is investigated. All the agents, especially the leaders, have non-identical and nonlinear dynamics. According to the algebraic graph theory, Lyapunov stability theory and Kronecker product, a control strategy strategy is established to guarantee the finite-time consensus of multi-agent network with multiple leaders. Furthermore, several numerical simulations illustrate the effectiveness and feasibility of the proposed method.
基金supported by the National Natural Science Foundation of China(Grant No.61370073)the China Scholarship Council,China(Grant No.201306070037)
文摘Community detection is a fundamental work to analyse the structural and functional properties of complex networks. The label propagation algorithm （LPA） is a near linear time algorithm to find a good community structure. Despite various subsequent advances, an important issue of this algorithm has not yet been properly addressed. Random update orders within the algorithm severely hamper the stability of the identified community structure. In this paper, we executed the basic label propagation algorithm on networks multiple times, to obtain a set of consensus partitions. Based on these consensus partitions, we created a consensus weighted graph. In this consensus weighted graph, the weight value of the edge was the proportion value that the number of node pairs allocated in the same cluster was divided by the total number of partitions. Then, we introduced consensus weight to indicate the direction of label propagation. In label update steps, by computing the mixing value of consensus weight and label frequency, a node adopted the label which has the maximum mixing value instead of the most frequent one. For extending to different networks, we introduced a proportion parameter to adjust the proportion of consensus weight and label frequency in computing mixing value. Finally, we proposed an approach named the label propagation algorithm with consensus weight （LPAcw）, and the experimental results showed that the LPAcw could enhance considerably both the stability and the accuracy of community partitions.
基金supported by the National Natural Sciences Foundation of China (60974146)
文摘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.
基金Supported by the National Natural Science Foundation of China(No.61340034)the Research Program of Application Foundation and Advanced Technology of Tianjin(No.13JCYBJC15600)
文摘This paper proposes a distributed second-order consensus time synchronization, which incorporates the second-order consensus algorithm into wireless sensor networks. Since local clocks may have different skews and offsets, the algorithm is designed to include offset compensation and skew compensation. The local clocks are not directly modified, thus the virtual clocks are built according to the local clocks via the compensation parameters. Each node achieves a virtual consensus clock by periodically updated compensation parameters. Finally, the effectiveness of the proposed algorithm is verified through a number of simulations in a mesh network. It is proved that the proposed algorithm has the advantage of being distributed, asymptotic convergence, and robust to new node joining.
基金supported in part by the National Key Research and Development Program of China (2016YFB0800601)
文摘This paper investigates the differentially private problem of the average consensus for a class of discrete-time multi-agent network systems(MANSs). Based on the MANSs,a new distributed differentially private consensus algorithm(DPCA) is developed. To avoid continuous communication between neighboring agents, a kind of intermittent communication strategy depending on an event-triggered function is established in our DPCA. Based on our algorithm, we carry out the detailed analysis including its convergence, its accuracy, its privacy and the trade-off between the accuracy and the privacy level, respectively. It is found that our algorithm preserves the privacy of initial states of all agents in the whole process of consensus computation. The trade-off motivates us to find the best achievable accuracy of our algorithm under the free parameters and the fixed privacy level. Finally, numerical experiment results testify the validity of our theoretical analysis.
文摘The advent of blockchain technology has transformed traditional methods of information exchange,shifting reliance from centralized data centers to decentralized frameworks.While blockchain’s decentralization and security are strengths,traditional consensus mechanisms like Proof of Work(PoW)and Proof of Stake(PoS)face limitations in scalability.PoW achieves decentralization and security but struggles with scalability as transaction volumes grow,while PoS enhances scalability,but risks centralization due to monopolization by high-stake participants.Sharding,a recent advancement in blockchain technology,addresses scalability by partitioning the network into shards that process transactions independently,thereby improving throughput and reducing latency.However,cross-shard communication,essential for transactions involving multiple shards,introduces challenges in coordination and fault tolerance.This research introduces a shard-based hybrid consensus model,PoSW,which combines PoW and PoS to mitigate the limitations of both mechanisms.By integrating PoW’s fairness with PoS’s scalability in a shard-based blockchain,the proposed model addresses key issues of scalability and monopolization.We evaluate the model against state-of-the-art consensus algorithms,including Monoxide and Practical Byzantine Fault Tolerance(PBFT).The results show that the proposed PoSW model reduces communication overhead compared to PBFT and improves resource utilization over Monoxide.In addition to performance gains,the security analysis demonstrates that the PoSW model provides robust defense against common blockchain attacks such as the 51%and Sybil attacks,etc.The proposed approach is particularly suited for applications like decentralized finance(DeFi)and supply chain management,which require both high scalability and robust security.The contributions of this research include the development of the PoSW hybrid consensus mechanism,its comparative evaluation with leading algorithms,and a thorough security analysis.These contributions represent a significant step forward in addressing blockchain’s scalability,fairness,and security challenges.
基金the National Natural Science Foundation of China(71871121).
文摘Due to people’s increasing dependence on social networks,it is essential to develop a consensus model considering not only their own factors but also the interaction between people.Both external trust relationship among experts and the internal reliability of experts are important factors in decision-making.This paper focuses on improving the scientificity and effectiveness of decision-making and presents a consensus model combining trust relationship among experts and expert reliability in social network group decision-making(SN-GDM).A concept named matching degree is proposed to measure expert reliability.Meanwhile,linguistic information is applied to manage the imprecise and vague information.Matching degree is expressed by a 2-tuple linguistic model,and experts’preferences are measured by a probabilistic linguistic term set(PLTS).Subsequently,a hybrid weight is explored to weigh experts’importance in a group.Then a consensus measure is introduced and a feedback mechanism is developed to produce some personalized recommendations with higher group consensus.Finally,a comparative example is provided to prove the scientificity and effectiveness of the proposed consensus model.
基金National Natural Science Foundation of China(No.61876073)Fundamental Research Funds for the Central Universities of China(No.JUSRP21920)。
文摘Double-integrator multi-agent systems(MASs)might not achieve dynamical consensus,even if only partial agents suffer from self-sensing function failures(SSFFs).SSFFs might be asynchronous in real engineering application.The existing fault-tolerant dynamical consensus protocol suitable for synchronous SSFFs cannot be directly used to tackle fault-tolerant dynamical consensus of double-integrator MASs with partial agents subject to asynchronous SSFFs.Motivated by these facts,this paper explores a new fault-tolerant dynamical consensus protocol suitable for asynchronous SSFFs.First,multi-hop communication together with the idea of treating asynchronous SSFFs as multiple piecewise synchronous SSFFs is used for recovering the connectivity of network topology among all normal agents.Second,a fault-tolerant dynamical consensus protocol is designed for double-integrator MASs by utilizing the history information of an agent subject to SSFF for computing its own state information at the instants when its minimum-hop normal neighbor set changes.Then,it is theoretically proved that if the strategy of network topology connectivity recovery and the fault-tolerant dynamical consensus protocol with proper time-varying gains are used simultaneously,double-integrator MASs with all normal agents and all agents subject to SSFFs can reach dynamical consensus.Finally,comparison numerical simulations are given to illustrate the effectiveness of the theoretical results.
文摘This paper addresses the decentralized consensus problem for a system of multiple dynamic agents with remote controllers via networking,known as a networked control multi-agent system(NCMAS).It presents a challenging scenario where partial dynamic entities or remote control units are vulnerable to disclosure attacks,making them potentially malicious.To tackle this issue,we propose a secure decentralized control design approach employing a double-layer cryptographic strategy.This approach not only ensures that the input and output information of the benign entities remains protected from the malicious entities but also practically achieves consensus performance.The paper provides an explicit design,supported by theoretical proof and numerical verification,covering stability,steady-state error,and the prevention of computation overflow or underflow.
基金Supported by National Basic Research Program of China （973 Program） （2010CB731800） and National Natural Science Foundation of China （60974059, 60736026, 61021063）
文摘This paper investigates second-order consensus of multi-agent systems with a virtual leader of varying velocity while preserving network connectivity.We propose a novel second-order consensus algorithm with bounded control inputs.Under the condition that the initial network is connected,the network will be connected all the time and all agents and the virtual leader can attain the same position and move with the same velocity.A simulation example is proposed to illustrate the effective of the proposed algorithm.
基金Project supported by the National Natural Science Foundation for Distinguished Young Scholars of China (Grant No. 60925011)
文摘Scale-free networks and consensus behaviour among multiple agents have both attracted much attention. To investigate the consensus speed over scale-free networks is the major topic of the present work. A novel method is developed to construct scale-free networks due to their remarkable power-law degree distributions, while preserving the diversity of network topologies. The time cost or iterations for networks to reach a certain level of consensus is discussed, considering the influence from power-law parameters. They are both demonstrated to be reversed power-law functions of the algebraic connectivity, which is viewed as a measurement on convergence speed of the consensus behaviour. The attempts of tuning power-law parameters may speed up the consensus procedure, but it could also make the network less robust over time delay at the same time. Large scale of simulations are supportive to the conclusions.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.60874053 and 61034006)
文摘The bounded consensus tracking problems of second-order multi-agent systems under directed networks with sam- pling delay are addressed in this paper. When the sampling delay is more than a sampling period, new protocols based on sampled-data control are proposed so that each agent can track the time-varying reference state of the virtual leader. By using the delay decomposition approach, the augmented matrix method, and the frequency domain analysis, necessary and sufficient conditions are obtained, which guarantee that the bounded consensus tracking is realized. Furthermore, some numerical simulations are presented to demonstrate the effectiveness of the theoretical results.
