The dynamic average consensus(DAC)algorithm is to enable a group of networked agents to track the average of their time-varying reference signals.For most existing DAC algorithms,a necessary assumption is that the upp...The dynamic average consensus(DAC)algorithm is to enable a group of networked agents to track the average of their time-varying reference signals.For most existing DAC algorithms,a necessary assumption is that the upper bounds of the reference signals and their derivatives are known in advance,thereby posing significant challenges in practical scenarios.Introducing adaptive gains in DAC algorithms provides a remedy by relaxing this assumption.However,the current adaptive gains used in this type of DAC algorithms are non-decreasing and may increase to infinity if persist disturbance exists.In order to overcome this defect,this paper presents a novel DAC algorithm with modified adaptive gains.This approach obviates the necessity for prior knowledge concerning the upper bounds of the reference signals and their derivatives.Moreover,the adaptive gains are able to remain bounded even in the presence of external disturbances.Furthermore,the proposed adaptive DAC algorithm is employed to address the distributed secondary control problem of DC microgrids.Comparative case studies are provided to verify the superiority of the proposed DAC algorithm.展开更多
To solve the dynamical consensus problem of second-order multi-agent systems with communication delay,delay-dependent compensations are added into the normal asynchronously-coupled consensus algorithm so as to make th...To solve the dynamical consensus problem of second-order multi-agent systems with communication delay,delay-dependent compensations are added into the normal asynchronously-coupled consensus algorithm so as to make the agents achieve a dynamical consensus. Based on frequency-domain analysis, sufficient conditions are gained for second-order multi-agent systems with communication delay under leaderless and leader-following consensus algorithms respectively. Simulation illustrates the correctness of the results.展开更多
This paper investigates fault-tolerant finite-time dynamical consensus problems of double-integrator multi-agent systems(MASs)with partial agents subject to synchronous self-sensing function failure(SSFF).A strategy o...This paper investigates fault-tolerant finite-time dynamical consensus problems of double-integrator multi-agent systems(MASs)with partial agents subject to synchronous self-sensing function failure(SSFF).A strategy of recovering the connectivity of network topology among normal agents based on multi-hop communication and a fault-tolerant finitetime dynamical consensus protocol with time-varying gains are proposed to resist synchronous SSFF.It is proved that double-integrator MASs with partial agents subject to synchronous SSFF using the proposed strategy of network topology connectivity recovery and fault-tolerant finite-time dynamical consensus protocol with the proper time-varying gains can achieve finite-time dynamical consensus.Numerical simulations are given to illustrate the effectiveness of the theoretical results.展开更多
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.展开更多
基金supported in part by the National Natural Science Foundation of China(20221017-10,62573258,62188101)the National Natural Science Foundation of Shandong Province(ZR2024 JQ018,ZR2022MF227).
文摘The dynamic average consensus(DAC)algorithm is to enable a group of networked agents to track the average of their time-varying reference signals.For most existing DAC algorithms,a necessary assumption is that the upper bounds of the reference signals and their derivatives are known in advance,thereby posing significant challenges in practical scenarios.Introducing adaptive gains in DAC algorithms provides a remedy by relaxing this assumption.However,the current adaptive gains used in this type of DAC algorithms are non-decreasing and may increase to infinity if persist disturbance exists.In order to overcome this defect,this paper presents a novel DAC algorithm with modified adaptive gains.This approach obviates the necessity for prior knowledge concerning the upper bounds of the reference signals and their derivatives.Moreover,the adaptive gains are able to remain bounded even in the presence of external disturbances.Furthermore,the proposed adaptive DAC algorithm is employed to address the distributed secondary control problem of DC microgrids.Comparative case studies are provided to verify the superiority of the proposed DAC algorithm.
基金Supported by the National Natural Science Foundation of China under Grant Nos.61104092,61134007,and61203147the Priority Academic Program Development of Jiangsu Higher Education Institutions
文摘To solve the dynamical consensus problem of second-order multi-agent systems with communication delay,delay-dependent compensations are added into the normal asynchronously-coupled consensus algorithm so as to make the agents achieve a dynamical consensus. Based on frequency-domain analysis, sufficient conditions are gained for second-order multi-agent systems with communication delay under leaderless and leader-following consensus algorithms respectively. Simulation illustrates the correctness of the results.
基金Project supported by the National Natural Science Foundation of China(Grant No.61876073)the Fundamental Research Funds for the Central Universities of China(Grant No.JUSRP21920)
文摘This paper investigates fault-tolerant finite-time dynamical consensus problems of double-integrator multi-agent systems(MASs)with partial agents subject to synchronous self-sensing function failure(SSFF).A strategy of recovering the connectivity of network topology among normal agents based on multi-hop communication and a fault-tolerant finitetime dynamical consensus protocol with time-varying gains are proposed to resist synchronous SSFF.It is proved that double-integrator MASs with partial agents subject to synchronous SSFF using the proposed strategy of network topology connectivity recovery and fault-tolerant finite-time dynamical consensus protocol with the proper time-varying gains can achieve finite-time dynamical consensus.Numerical simulations are given to illustrate the effectiveness of the theoretical results.
基金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.
