The problem of fixed-time group consensus for second-order multi-agent systems with disturbances is investigated.For cooperative-competitive network,two different control protocols,fixed-time group consensus and fixed...The problem of fixed-time group consensus for second-order multi-agent systems with disturbances is investigated.For cooperative-competitive network,two different control protocols,fixed-time group consensus and fixed-time eventtriggered group consensus,are designed.It is demonstrated that there is no Zeno behavior under the designed eventtriggered control.Meanwhile,it is proved that for an arbitrary initial state of the system,group consensus within the settling time could be obtained under the proposed control protocols by using matrix analysis and graph theory.Finally,a series of numerical examples are propounded to illustrate the performance of the proposed control protocol.展开更多
In this paper,the path integral solutions for a general n-dimensional stochastic differential equa-tions(SDEs)withα-stable Lévy noise are derived and verified.Firstly,the governing equations for the solutions of...In this paper,the path integral solutions for a general n-dimensional stochastic differential equa-tions(SDEs)withα-stable Lévy noise are derived and verified.Firstly,the governing equations for the solutions of n-dimensional SDEs under the excitation ofα-stable Lévy noise are obtained through the characteristic function of stochastic processes.Then,the short-time transition probability density func-tion of the path integral solution is derived based on the Chapman-Kolmogorov-Smoluchowski(CKS)equation and the characteristic function,and its correctness is demonstrated by proving that it satis-fies the governing equation of the solution of the SDE,which is also called the Fokker-Planck-Kolmogorov equation.Besides,illustrative examples are numerically considered for highlighting the feasibility of the proposed path integral method,and the pertinent Monte Carlo solution is also calculated to show its correctness and effectiveness.展开更多
Multi-agent systems can solve scientific issues related to complex systems that are difficult or impossible for a single agent to solve through mutual collaboration and cooperation optimization.In a multi-agent system...Multi-agent systems can solve scientific issues related to complex systems that are difficult or impossible for a single agent to solve through mutual collaboration and cooperation optimization.In a multi-agent system,agents with a certain degree of autonomy generate complex interactions due to the correlation and coordination,which is manifested as cooperative/competitive behavior.This survey focuses on multi-agent cooperative optimization and cooperative/non-cooperative games.Starting from cooperative optimization,the studies on distributed optimization and federated optimization are summarized.The survey mainly focuses on distributed online optimization and its application in privacy protection,and overviews federated optimization from the perspective of privacy protection me-chanisms.Then,cooperative games and non-cooperative games are introduced to expand the cooperative optimization problems from two aspects of minimizing global costs and minimizing individual costs,respectively.Multi-agent cooperative and non-cooperative behaviors are modeled by games from both static and dynamic aspects,according to whether each player can make decisions based on the information of other players.Finally,future directions for cooperative optimization,cooperative/non-cooperative games,and their applications are discussed.展开更多
Stochastic differential equations(SDEs)are mathematical models that are widely used to describe complex processes or phenomena perturbed by random noise from different sources.The identification of SDEs governing a sy...Stochastic differential equations(SDEs)are mathematical models that are widely used to describe complex processes or phenomena perturbed by random noise from different sources.The identification of SDEs governing a system is often a challenge because of the inherent strong stochasticity of data and the complexity of the system’s dynamics.The practical utility of existing parametric approaches for identifying SDEs is usually limited by insufficient data resources.This study presents a novel framework for identifying SDEs by leveraging the sparse Bayesian learning(SBL)technique to search for a parsimonious,yet physically necessary representation from the space of candidate basis functions.More importantly,we use the analytical tractability of SBL to develop an efficient way to formulate the linear regression problem for the discovery of SDEs that requires considerably less time-series data.The effectiveness of the proposed framework is demonstrated using real data on stock and oil prices,bearing variation,and wind speed,as well as simulated data on well-known stochastic dynamical systems,including the generalized Wiener process and Langevin equation.This framework aims to assist specialists in extracting stochastic mathematical models from random phenomena in the natural sciences,economics,and engineering fields for analysis,prediction,and decision making.展开更多
This study is concerned with probabilistic Boolean control networks(PBCNs)with state feedback control.A novel definition of bisimilar PBCNs is proposed to lower computational complexity.To understand more on bisimulat...This study is concerned with probabilistic Boolean control networks(PBCNs)with state feedback control.A novel definition of bisimilar PBCNs is proposed to lower computational complexity.To understand more on bisimulation relations between PBCNs,we resort to a powerful matrix manipulation called semi-tensor product(STP).Because stabilization of networks is of critical importance,the propagation of stabilization with probability one between bisimilar PBCNs is then considered and proved to be attainable.Additionally,the transient periods(the maximum number of steps to implement stabilization)of two PBCNs are certified to be identical if these two networks are paired with a bisimulation relation.The results are then extended to the probabilistic Boolean networks.展开更多
基金Project supported by the Graduate Student Research Innovation Project of Chongqing(Grant No.CYS22482)the National Natural Science Foundation of China(Grant No.61773082)+1 种基金the Science and Technology Research Program of Chongqing Municipal Education Commission(Grant No.KJZD-K202000601)the Research Program of Chongqing Talent,China(Grant No.cstc2021ycjhbgzxm0044).
文摘The problem of fixed-time group consensus for second-order multi-agent systems with disturbances is investigated.For cooperative-competitive network,two different control protocols,fixed-time group consensus and fixed-time eventtriggered group consensus,are designed.It is demonstrated that there is no Zeno behavior under the designed eventtriggered control.Meanwhile,it is proved that for an arbitrary initial state of the system,group consensus within the settling time could be obtained under the proposed control protocols by using matrix analysis and graph theory.Finally,a series of numerical examples are propounded to illustrate the performance of the proposed control protocol.
基金This work was supported by the Key International(Regional)Joint Research Program of the National Natural Science Foundation of China(No.12120101002).
文摘In this paper,the path integral solutions for a general n-dimensional stochastic differential equa-tions(SDEs)withα-stable Lévy noise are derived and verified.Firstly,the governing equations for the solutions of n-dimensional SDEs under the excitation ofα-stable Lévy noise are obtained through the characteristic function of stochastic processes.Then,the short-time transition probability density func-tion of the path integral solution is derived based on the Chapman-Kolmogorov-Smoluchowski(CKS)equation and the characteristic function,and its correctness is demonstrated by proving that it satis-fies the governing equation of the solution of the SDE,which is also called the Fokker-Planck-Kolmogorov equation.Besides,illustrative examples are numerically considered for highlighting the feasibility of the proposed path integral method,and the pertinent Monte Carlo solution is also calculated to show its correctness and effectiveness.
基金supported in part by the National Natural Science Foundation of China(Basic Science Center Program:61988101)the Sino-German Center for Research Promotion(M-0066)+2 种基金the International(Regional)Cooperation and Exchange Project(61720106008)the Programme of Introducing Talents of Discipline to Universities(the 111 Project)(B17017)the Program of Shanghai Academic Research Leader(20XD1401300).
文摘Multi-agent systems can solve scientific issues related to complex systems that are difficult or impossible for a single agent to solve through mutual collaboration and cooperation optimization.In a multi-agent system,agents with a certain degree of autonomy generate complex interactions due to the correlation and coordination,which is manifested as cooperative/competitive behavior.This survey focuses on multi-agent cooperative optimization and cooperative/non-cooperative games.Starting from cooperative optimization,the studies on distributed optimization and federated optimization are summarized.The survey mainly focuses on distributed online optimization and its application in privacy protection,and overviews federated optimization from the perspective of privacy protection me-chanisms.Then,cooperative games and non-cooperative games are introduced to expand the cooperative optimization problems from two aspects of minimizing global costs and minimizing individual costs,respectively.Multi-agent cooperative and non-cooperative behaviors are modeled by games from both static and dynamic aspects,according to whether each player can make decisions based on the information of other players.Finally,future directions for cooperative optimization,cooperative/non-cooperative games,and their applications are discussed.
基金supported by the National Key Research and Development Program of China(2018YFB1701202)the National Natural Science Foundation of China(92167201 and 51975237)the Fundamental Research Funds for the Central Universities,Huazhong University of Science and Technology(2021JYCXJJ028)。
文摘Stochastic differential equations(SDEs)are mathematical models that are widely used to describe complex processes or phenomena perturbed by random noise from different sources.The identification of SDEs governing a system is often a challenge because of the inherent strong stochasticity of data and the complexity of the system’s dynamics.The practical utility of existing parametric approaches for identifying SDEs is usually limited by insufficient data resources.This study presents a novel framework for identifying SDEs by leveraging the sparse Bayesian learning(SBL)technique to search for a parsimonious,yet physically necessary representation from the space of candidate basis functions.More importantly,we use the analytical tractability of SBL to develop an efficient way to formulate the linear regression problem for the discovery of SDEs that requires considerably less time-series data.The effectiveness of the proposed framework is demonstrated using real data on stock and oil prices,bearing variation,and wind speed,as well as simulated data on well-known stochastic dynamical systems,including the generalized Wiener process and Langevin equation.This framework aims to assist specialists in extracting stochastic mathematical models from random phenomena in the natural sciences,economics,and engineering fields for analysis,prediction,and decision making.
基金Project supported by the National Natural Science Foundation of China(Nos.61603268 and 61773319)the Fundamental Research Funds for the Central Universities,China(No.JBK190502)。
文摘This study is concerned with probabilistic Boolean control networks(PBCNs)with state feedback control.A novel definition of bisimilar PBCNs is proposed to lower computational complexity.To understand more on bisimulation relations between PBCNs,we resort to a powerful matrix manipulation called semi-tensor product(STP).Because stabilization of networks is of critical importance,the propagation of stabilization with probability one between bisimilar PBCNs is then considered and proved to be attainable.Additionally,the transient periods(the maximum number of steps to implement stabilization)of two PBCNs are certified to be identical if these two networks are paired with a bisimulation relation.The results are then extended to the probabilistic Boolean networks.