Achieving asymptotical cooperative goal for multi-agent systems(MASs)with non-autonomous leaders(i.e.,leaders with nonzero inputs)is a critical but challenging issue.Traditional approach is to use discontinuous contro...Achieving asymptotical cooperative goal for multi-agent systems(MASs)with non-autonomous leaders(i.e.,leaders with nonzero inputs)is a critical but challenging issue.Traditional approach is to use discontinuous controllers which may cause chattering phenomenon in practical applications.How to achieve the asymptotical goal via a chattering free cooperative controller remains to be open so far.In this paper,an adaptive continuous controller is designed to achieve zero error consensus tracking in multiple Lur’e systems with a non-autonomous leader under directed switching topology.Firstly,an unknown input observer(UIO)based on relative outputs is given to estimate the relative full states.Then an adaptive continuous controller is designed by introducing a decay function which remains positive into the term that plays the role of eliminating the impacts of leader’s nonzero inputs.Secondly,by using multiple Lyapunov functions(MLFs)technique,it is proven that zero error consensus tracking can be achieved if the average dwell time(ADT)is greater than a positive threshold.Finally,theoretical result is verified by performing simulations on Chua’s circuits.Compared with existing work,the proposed controller can not only achieve asymptotical consensus,but also is chattering free.展开更多
This paper is concerned with the distributed Nash equilibrium(NE) computation problem for non-cooperative games subject to partial-decision information.For the purpose of congestion mitigation,coding-decoding-based sc...This paper is concerned with the distributed Nash equilibrium(NE) computation problem for non-cooperative games subject to partial-decision information.For the purpose of congestion mitigation,coding-decoding-based schemes are constructed on the basis of logarithmic and uniform quantizers,respectively.To be specific,the data(decision variable) are first mapped to codewords by an encoder scheme,and then sent to the neighboring agents through a directed communication network(with non-doubly stochastic weighted matrix).By using a decoder scheme,a new distributed algorithm is established for seeking the NE.In order to eliminate the convergence error caused by quantization,a dynamic variable is introduced and a modified codingdecoding-based algorithm is constructed under the uniform quantization scheme,which ensures the asymptotic convergence to the NE.The proposed algorithm only requires that the weighted adjacency matrix is row stochastic instead of double stochastic.Finally,one numerical example is provided to validate the effectiveness of our algorithms.展开更多
Complex cyber-physical network refers to a new generatio~ of complex networks whose normal functioning significantly relies on tight interactions between its physical and cyber compo- nents. Many modern critical infra...Complex cyber-physical network refers to a new generatio~ of complex networks whose normal functioning significantly relies on tight interactions between its physical and cyber compo- nents. Many modern critical infrastructures can be appropriately modelled as complex cyber-physical networks. Typical examples of such infrastructures are electrical power grids, WWW, public trans- portation systems, state financial networks, and the Interact. These critical facilities play important roles in ensuring the stability of society as well as the development of economy. Advances in informa- tion and communication technology open opportunities for malicious attackers to launch coordinated attacks on cyber-physical critical facilities in networked infrastructures from any Interact-accessible place. Cybersecurity of complex cyber-physical networks has emerged as a hot topic within this con- text. In practice, it is also very crucial to understand the interplay between the evolution of underlying network structures and the collective dynamics on these complex networks and consequently to design efficient security control strategies to protect the evolution of these networks. In this paper, cybersecu- rity of complex cyber-physical networks is first outlined and then some security enhancing techniques, with particular emphasis on safety communications, attack detection and fault-tolerant control, are suggested. Furthermore, a new class of efficient secure the achievement of desirable pinning synchronization control strategies are proposed for guaranteeing behaviors in complex cyber-physical networks against malicious attacks on nodes. The authors hope that this paper motivates to design enhanced security strategies for complex cyber-physical network systems, to realize resilient and secure critical infrastructures.展开更多
The development of power system informatization,the massive access of distributed power supply and electric vehicles have increased the complexity of power consumption in the distribution network,which puts forward hi...The development of power system informatization,the massive access of distributed power supply and electric vehicles have increased the complexity of power consumption in the distribution network,which puts forward higher requirements for the accuracy and stability of load forecasting.In this paper,an integrated network architecture which consists of the self-organized mapping,chaotic time series,intelligent optimization algorithm and long short-term memory(LSTM)is proposed to extend the load forecasting length,decrease artificial debugging,and improve the prediction precision for the short-term power load forecasting.Compared with LSTM prediction,the algorithm in this paper improves the prediction accuracy by 61.87%in terms of root mean square error(RMSE),and reduces the prediction error by 50%in the 40-fold forecast window under some circumstances.展开更多
In this paper,a group consensus problem is investigated for multiple networked agents with parametric uncertainties where all the agents are governed by the Euler-Lagrange system with uncertain parameters.In the group...In this paper,a group consensus problem is investigated for multiple networked agents with parametric uncertainties where all the agents are governed by the Euler-Lagrange system with uncertain parameters.In the group consensus problem,the agents asymptotically reach several different states rather than one consistent state.A novel group consensus protocol and a time-varying estimator of the uncertain parameters are proposed for each agent in order to solve the couple-group consensus problem.It is shown that the group consensus is reachable even when the system contains the uncertain parameters.Furthermore,the multi-group consensus is discussed as an extension of the couple-group consensus,and then the group consensus with switching topology is considered.Simulation results are finally provided to validate the effectiveness of the theoretical analysis.展开更多
In this paper, we study the distributed economic dispatch problem where the supply demand balance, capacity constraints and ramp-rate constraints are considered. In order to accommodate varying power load and power st...In this paper, we study the distributed economic dispatch problem where the supply demand balance, capacity constraints and ramp-rate constraints are considered. In order to accommodate varying power load and power storage in reality, we introduce two variables where each variable is time-varing and has its own dynamics. The renewable power is also considered. Barrier functions are introduced to deal with the local constraints by means of imposing penalty terms into the objective function to ensure that the optimal solution satisfies the corresponding constraints. Based on the Langrange dual theory, the primal optimization problem is transformed into the dual problem, which is solved by the primary-dual algorithm proposed in this paper. Under the assumption that the communication graph is an undirected and connected graph, we analyze the convergence of the proposed algorithm. The simulations on IEEE six-bus test systems are carried out to verify the performance of the algorithm, which shows that the proposed algorithm converges to the optimal solution, while all the constraints are met.展开更多
In this paper, we present a distributed consensus-based algorithm to solve the social welfare maximization problem. This is one of typical problems of distributed energy management in smart grid. In this problem, we c...In this paper, we present a distributed consensus-based algorithm to solve the social welfare maximization problem. This is one of typical problems of distributed energy management in smart grid. In this problem, we consider not only the generator and demand, but also the transmission losses which make the feasibility set of the formulated problem a non-convex set. In solving this issue, we find a noticeable result that the primal problem has the same solution with a new convex optimization problem by getting the utmost out of the implied term in practice. Considering the general communication topology among generators and demands, we first design a finite step algorithm to make each generator and demand know the information of parameters of others.Then, we design a distributed algorithm and also prove the optimality and convergence of the proposed algorithm. Finally, the convergence and optimality are examined through extensive simulations.展开更多
基金supported by the National Natural Science Foundation of China(Grant Nos.62003003 and 62073076)the Natural Science Foundation of Anhui Province(Grant No.2008085QF304)the Talent Programme of Anhui Province for Young Scholars。
文摘Achieving asymptotical cooperative goal for multi-agent systems(MASs)with non-autonomous leaders(i.e.,leaders with nonzero inputs)is a critical but challenging issue.Traditional approach is to use discontinuous controllers which may cause chattering phenomenon in practical applications.How to achieve the asymptotical goal via a chattering free cooperative controller remains to be open so far.In this paper,an adaptive continuous controller is designed to achieve zero error consensus tracking in multiple Lur’e systems with a non-autonomous leader under directed switching topology.Firstly,an unknown input observer(UIO)based on relative outputs is given to estimate the relative full states.Then an adaptive continuous controller is designed by introducing a decay function which remains positive into the term that plays the role of eliminating the impacts of leader’s nonzero inputs.Secondly,by using multiple Lyapunov functions(MLFs)technique,it is proven that zero error consensus tracking can be achieved if the average dwell time(ADT)is greater than a positive threshold.Finally,theoretical result is verified by performing simulations on Chua’s circuits.Compared with existing work,the proposed controller can not only achieve asymptotical consensus,but also is chattering free.
基金supported by the National Natural Science Foundation of China (Grant Nos.62173087,62233004,62176056,and 62073076)the Young Elite Scientists Sponsorship Program by CAST (Grant No.2021QNRC001)+2 种基金the Fundamental Research Funds for the Central Universitiesthe Alexander von Humboldt Foundation of Germanysupported by ZhiShan Youth Scholar Program from Southeast University。
文摘This paper is concerned with the distributed Nash equilibrium(NE) computation problem for non-cooperative games subject to partial-decision information.For the purpose of congestion mitigation,coding-decoding-based schemes are constructed on the basis of logarithmic and uniform quantizers,respectively.To be specific,the data(decision variable) are first mapped to codewords by an encoder scheme,and then sent to the neighboring agents through a directed communication network(with non-doubly stochastic weighted matrix).By using a decoder scheme,a new distributed algorithm is established for seeking the NE.In order to eliminate the convergence error caused by quantization,a dynamic variable is introduced and a modified codingdecoding-based algorithm is constructed under the uniform quantization scheme,which ensures the asymptotic convergence to the NE.The proposed algorithm only requires that the weighted adjacency matrix is row stochastic instead of double stochastic.Finally,one numerical example is provided to validate the effectiveness of our algorithms.
基金supported by the National Key Research and Development Program of China under Grant No.2016YFB0800401the National Nature Science Foundation of China under Grant Nos.61304168,61673104,and 61322302+3 种基金the Natural Science Foundation of Jiangsu Province of China under Grant No.BK20130595the National Ten Thousand Talent Program for Young Top-Notch Talents,the Six Talent Peaks of Jiangsu Province of China under Grant No.2014-DZXX-004the Doctoral Program of Higher Education of China under Grant No.20130092120030the Fundamental Research Funds for the Central Universities of China under Grant No.2242016K41030
文摘Complex cyber-physical network refers to a new generatio~ of complex networks whose normal functioning significantly relies on tight interactions between its physical and cyber compo- nents. Many modern critical infrastructures can be appropriately modelled as complex cyber-physical networks. Typical examples of such infrastructures are electrical power grids, WWW, public trans- portation systems, state financial networks, and the Interact. These critical facilities play important roles in ensuring the stability of society as well as the development of economy. Advances in informa- tion and communication technology open opportunities for malicious attackers to launch coordinated attacks on cyber-physical critical facilities in networked infrastructures from any Interact-accessible place. Cybersecurity of complex cyber-physical networks has emerged as a hot topic within this con- text. In practice, it is also very crucial to understand the interplay between the evolution of underlying network structures and the collective dynamics on these complex networks and consequently to design efficient security control strategies to protect the evolution of these networks. In this paper, cybersecu- rity of complex cyber-physical networks is first outlined and then some security enhancing techniques, with particular emphasis on safety communications, attack detection and fault-tolerant control, are suggested. Furthermore, a new class of efficient secure the achievement of desirable pinning synchronization control strategies are proposed for guaranteeing behaviors in complex cyber-physical networks against malicious attacks on nodes. The authors hope that this paper motivates to design enhanced security strategies for complex cyber-physical network systems, to realize resilient and secure critical infrastructures.
基金supported by the National Natural Science Foundation of China(Grant No.61673107)the National Ten Thousand Talent Program for Young Top-notch Talents(Grant No.W2070082)+1 种基金the General Joint Fund of the Equipment Advance Research Program of Ministry of Education(Grant No.6141A020223)the Jiangsu Provincial Key Laboratory of Networked Collective Intelligence(Grant No.BM2017002)。
文摘The development of power system informatization,the massive access of distributed power supply and electric vehicles have increased the complexity of power consumption in the distribution network,which puts forward higher requirements for the accuracy and stability of load forecasting.In this paper,an integrated network architecture which consists of the self-organized mapping,chaotic time series,intelligent optimization algorithm and long short-term memory(LSTM)is proposed to extend the load forecasting length,decrease artificial debugging,and improve the prediction precision for the short-term power load forecasting.Compared with LSTM prediction,the algorithm in this paper improves the prediction accuracy by 61.87%in terms of root mean square error(RMSE),and reduces the prediction error by 50%in the 40-fold forecast window under some circumstances.
基金supported by the National Natural Science Foundation of China under Grant Nos.60974017.61273212,61322302,61104145,and 61004097Zhejiang Provincial Natural Science Foundation of China under Grant No.LQ14F030011+2 种基金the Natural Science Foundation of Jiangsu Province of China under Grant No.BK2011581the Research Fund for the Doctoral Program of Higher Education of China under Grant No.20110092120024the Fundamental Research Funds for the Central Universities of China
文摘In this paper,a group consensus problem is investigated for multiple networked agents with parametric uncertainties where all the agents are governed by the Euler-Lagrange system with uncertain parameters.In the group consensus problem,the agents asymptotically reach several different states rather than one consistent state.A novel group consensus protocol and a time-varying estimator of the uncertain parameters are proposed for each agent in order to solve the couple-group consensus problem.It is shown that the group consensus is reachable even when the system contains the uncertain parameters.Furthermore,the multi-group consensus is discussed as an extension of the couple-group consensus,and then the group consensus with switching topology is considered.Simulation results are finally provided to validate the effectiveness of the theoretical analysis.
基金supported by the National Natural Science Foundation of China(Grant No.61673107)the Stable Supporting Fund of Science and Technology on Underwater Vehicle Technology(Grant No.SXJQR2018WDKT05)the Jiangsu Provincial Key Laboratory of Networked Collective Intelligence(Grant No.BM2017002)
文摘In this paper, we study the distributed economic dispatch problem where the supply demand balance, capacity constraints and ramp-rate constraints are considered. In order to accommodate varying power load and power storage in reality, we introduce two variables where each variable is time-varing and has its own dynamics. The renewable power is also considered. Barrier functions are introduced to deal with the local constraints by means of imposing penalty terms into the objective function to ensure that the optimal solution satisfies the corresponding constraints. Based on the Langrange dual theory, the primal optimization problem is transformed into the dual problem, which is solved by the primary-dual algorithm proposed in this paper. Under the assumption that the communication graph is an undirected and connected graph, we analyze the convergence of the proposed algorithm. The simulations on IEEE six-bus test systems are carried out to verify the performance of the algorithm, which shows that the proposed algorithm converges to the optimal solution, while all the constraints are met.
基金supported by the Science and Technology Project of State Grid Zhejiang Electric Power Co.Ltd.(Grant No.5211JY17000P)the Fundamental Research Funds for the Central Universities(Grant No.2242019K40111)+1 种基金the National Natural Science Foundation of China(Grant No.61673107)the Jiangsu Provincial Key Laboratory of Networked Collective Intelligence(Grant No.BM2017002)
文摘In this paper, we present a distributed consensus-based algorithm to solve the social welfare maximization problem. This is one of typical problems of distributed energy management in smart grid. In this problem, we consider not only the generator and demand, but also the transmission losses which make the feasibility set of the formulated problem a non-convex set. In solving this issue, we find a noticeable result that the primal problem has the same solution with a new convex optimization problem by getting the utmost out of the implied term in practice. Considering the general communication topology among generators and demands, we first design a finite step algorithm to make each generator and demand know the information of parameters of others.Then, we design a distributed algorithm and also prove the optimality and convergence of the proposed algorithm. Finally, the convergence and optimality are examined through extensive simulations.
