Ming Cao

Ming Cao

Auto-generated profile, based on publicly available information

Ming Cao

University of Groningen

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2010 in Automatica
Verified
Journal Article
Closed access
WYWenwu Yu
Wenwu Yu
GCGuanrong Chen
Guanrong Chen
MCMing Cao
Ming Cao

6 November 2009 in IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)
Verified
Journal Article
Closed access
Wen wu YuWen wu Yu
Wen wu Yu
GCGuanrong Chen
Guanrong Chen
MCMing Cao
Ming Cao
JKJurgen Kurths
Jurgen Kurths
This paper considers a second-order consensus problem for multiagent systems with nonlinear dynamics and directed topologies where each agent is governed by both position and velocity consensus terms with a time-varying asymptotic velocity. To describe the system's ability for reaching consensus, a new concept about the generalized algebraic connectivity is defined for strongly connected networks and then extended to the strongly connected components of the directed network containing a spanning tree. Some sufficient conditions are derived for reaching second-order consensus in multiagent systems with nonlinear dynamics based on algebraic graph theory, matrix theory, and Lyapunov control approach. Finally, simulation examples are given to verify the theoretical analysis.

1 January 2008 in SIAM Journal on Control and Optimization
Verified
Journal Article
Closed access
MCMing Cao
Ming Cao
AMA. Stephen Morse
A. Stephen Morse
BABrian D. O. Anderson
Brian D. O. Anderson
This paper presents new graph-theoretic results appropriate for the analysis of a variety of consensus problems cast in dynamically changing environments. The concepts of rooted, strongly rooted, and neighbor-shared are defined, and conditions are derived for compositions of sequences of directed graphs to be of these types. The graph of a stochastic matrix is defined, and it is shown that under certain conditions the graph of a Sarymsakov matrix and a rooted graph are one and the same. As an illustration of the use of the concepts developed in this paper, graph-theoretic conditions are obtained which address the convergence question for the leaderless version of the widely studied Vicsek consensus problem.

24 August 2015 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
APAnton Proskurnikov
Anton Proskurnikov
AMAlexey S. Matveev
Alexey S. Matveev
MCMing Cao
Ming Cao
Most of the distributed protocols for multi-agent consensus assume that the agents are mutually cooperative and “trustful,” and so the couplings among the agents bring the values of their states closer. Opinion dynamics in social groups, however, require beyond these conventional models due to ubiquitous competition and distrust between some pairs of agents, which are usually characterized by repulsive couplings and may lead to clustering of the opinions. A simple yet insightful model of opinion dynamics with both attractive and repulsive couplings was proposed recently by C. Altafini, who examined first-order consensus algorithms over static signed graphs. This protocol establishes modulus consensus, where the opinions become the same in modulus but may differ in signs. In this paper, we extend the modulus consensus model to the case where the network topology is an arbitrary time-varying signed graph and prove reaching modulus consensus under mild sufficient conditions of uniform connectivity of the graph. For cut-balanced graphs, not only sufficient, but also necessary conditions for modulus consensus are given.

7 February 2011 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
WYWenwu Yu
Wenwu Yu
GCGuanrong Chen
Guanrong Chen
MCMing Cao
Ming Cao
This technical note studies the consensus problem for cooperative agents with nonlinear dynamics in a directed network. Both local and global consensus are defined and investigated. Techniques for studying the synchronization in such complex networks are exploited to establish various sufficient conditions for reaching consensus. The local consensus problem is first studied via a combination of the tools of complex analysis, local consensus manifold approach, and Lyapunov methods. A generalized algebraic connectivity is then proposed to study the global consensus problem in strongly connected networks and also in a broad class of networks containing spanning trees, for which ideas from algebraic graph theory, matrix theory, and Lyapunov methods are utilized.

25 May 2015 in IEEE Transactions on Control of Network Systems
Verified
Journal Article
Closed access
WXWeiguo Xia
Weiguo Xia
MCMing Cao
Ming Cao
KJKarl Henrik Johansson
Karl Henrik Johansson
Structural balance theory has been developed in sociology and psychology to explain how interacting agents, for example, countries, political parties, opinionated individuals, with mixed trust and mistrust relationships evolve into polarized camps. Recent results have shown that structural balance is necessary for polarization in networks with fixed, strongly connected neighbor relationships when the opinion dynamics are described by DeGroot-type averaging rules. We develop this line of research in this paper in two steps. First, we consider fixed, not necessarily strongly connected, neighbor relationships. It is shown that if the network includes a strongly connected subnetwork containing mistrust, which influences the rest of the network, then no opinion clustering is possible when that subnetwork is not structurally balanced; all of the opinions become neutralized in the end. In contrast, it is shown that when that subnetwork is indeed structurally balanced, the agents of the subnetwork evolve into two polarized camps and the opinions of all other agents in the network spread between these two polarized opinions. Second, we consider time-varying neighbor relationships. We show that the opinion separation criteria carry over if the conditions for fixed graphs are extended to joint graphs. The results are developed for both discrete-time and continuous-time models.