This paper studies the evolutionary prisoner's dilemma game on a highly clustered community network in which the clustering coefficient and the community size can be tuned. It finds that the clustering coefficient in such a degree- homogeneous network inhibits the emergence of cooperation for the entire range of the payoff parameter. Moreover, it finds that the community size can also have a marked influence on the evolution of cooperation, with a larger community size leading to not only a lower cooperation level but also a smaller threshold of the payoff parameter above which cooperators become extinct.
The well-known Generalized Champagne Problem on simultaneous stabilization of linear systems is solved by using complex analysis and Blondel’s technique. We give a complete answer to the open problem proposed by Patel et al., which auto-matically includes the solution to the original Champagne Problem. Based on the recent development in automated inequality-type theorem proving, a new stabiliz-ing controller design method is established. Our numerical examples significantly improve the relevant results in the literature.
This paper studies a non-reciprocal swarm model that consists of a group of mobile autonomous agents with an attraction-repulsion function governing the interaction of the agents. The function is chosen to have infinitely large values of repulsion for vanishing distance between two agents so as to avoid occurrence of collision. It is shown analytically that under the detailed balance condition in coupling weights, all the agents will aggregate and eventually form a cohesive cluster of finite size around the weighted center of the swarm in a finite time. Moreover, the swarm system is completely stable, namely, the motion of all agents converge to the set of equilibrium points. For the general case of non-reciprocal swarms without the detailed balance condition, numerical simulations show that more complex self-organized oscillations can emerge in the swarms. The effect of noise on collective dynamics of the swarm is also examined with a white Gaussian noise model.
This paper is concerned with the robust H∞ filtering problem for uncertain two-dimensional（2-D）systems describ...
Meng Xiangyu1,Gao Huijun1,Chen Tongwen2 1.Space Control and Inertial Technology Research Center,Harbin Institute of Technology,Harbin 150001,P.R.China2.Department of Electrical and Computer Engineering,University of Alberta,Edmonton,Alberta T6G 2V4,Canada
A switched system approach is proposed to model networked control systems (NCSs) with communication constraints. This enables us to apply the rich theory of switched systems to analyzing such NCSs. Sufficient conditions are presented on the stabilization of NCSs. Stabilizing state/output feedback controllers can be constructed by using the feasible solutions of some linear matrix inequalities (LMIs). The merit of our proposed approach is that the behavior of the NCSs can be studied by considering switched system without augmenting the system. A simulation example is worked out to illustrate the effectiveness of the proposed approach.
In this paper, consensus problems in discrete-time multiagent systems with time-invariant delays are considered. In order to characterize the structures of communication topologies, the concept of "pre-leader-follower" decomposition is introduced. Then, a necessary and sufficient condition for state consensus is established. By this method, consensus problems in networks with a single time-delay, as well as with multiple time-delays, are studied, and some necessary and sufficient conditions for solvability of consensus problems are obtained.
