Entity

Time filter

Source Type

Tongren, China

Wu Q.,Shanghai University of Electric Power | Zhang H.,Chongqing University of Technology | Zhang H.,Tongren College | Xu L.,Shanghai University of Electric Power | Yan Q.,Chongqing University of Technology
Asian Journal of Control | Year: 2015

The main objective of the present paper is to further investigate finite-time synchronization of a general complex dynamical network from the viewpoint of dynamics and control. By utilizing the finite-time stability theory combined with the inequality techniques, several sufficient criteria on finite-time synchronization are derived analytically. And some effects of control parameters on synchronization speed and synchronization time are also drawn. It is shown that control gains play an important role in making the dynamical networks finite-time exponentially synchronized. Furthermore, the results are applied to a typical nearest-neighbor coupled network composing of chaotic FitzHugh-Nagumo (FHN) neuron oscillators, and numerical simulations are given to demonstrate the effectiveness of the proposed control methodology. ©2014 Chinese Automatic Control Society and Wiley Publishing Asia Pty Ltd.


Gong J.,Tongren College | Wu C.-M.,Zhejiang University
Tien Tzu Hsueh Pao/Acta Electronica Sinica | Year: 2010

CHOKe is an algorithm of fair approximation of the stateless and active queue management. The CHOKe hit, whose effectiveness and the force of punishing non-response flows are the crucial factors to enhance the fairness algorithm, is used to approximately identify and punish non-response flows. In this paper a new algorithm, S-CHOKe, which enhances the fairness of the CHOKe algorithm, not only replace the CHOKe hit with sampling CHOKe hit to improve the effectiveness of CHOKe hit, but also use Queue hit to adaptively determine the number of packet loss so to moderately punish non-response flows. Simulation results show that S-CHOKe, which is able to adapt to changes in flow quantity, is effective and fair.


Wu Q.,Shanghai University of Electric Power | Wu Q.,Shanghai University | Zhou J.,Shanghai University | Zhang H.,Shanghai University | And 2 more authors.
International Journal of Systems Science | Year: 2013

In this article, we propose a distributed δ-consensus protocol in directed networks of dynamic agents having communication delays. The δ-consensus protocol is an average consensus protocol where agents exchange the information with their neighbours at some discontinuous moments. We provide convergence analysis for such consensus algorithm under stochastic switching communication graphs, and then present some generic criteria for solving the average consensus problem. We also show that directed delayed networks of dynamic agents can achieve average consensus even when each agent in the networks intermittently exchanges the information with its neighbours only at some discrete moments. Subsequently, a typical numerical example illustrates and visualises the effectiveness and feasibility of the theoretical results. © 2013 Taylor & Francis.


Zhang H.,Shanghai University | Zhang H.,Chongqing University of Technology | Zhang H.,Tongren College | Zhou J.,Shanghai University
IET Control Theory and Applications | Year: 2013

In this study, a distributed consensus protocol is proposed for second-order multi-agent systems having input time delays. A distinctive feature of the algorithm is to address consensus problems for second-order multi-agent systems with local instantaneous interaction, where each agent can only exchange the position information with its neighbours at a series of discrete-time instants and update its velocity state in the form of abrupt jumps setting. The authors also establish the consensus conditions over fixed and switching network topologies, respectively. It is shown that consensus can be exponentially reached if the interaction graph of the system is connected and the interaction intervals are less than a given threshold value. Subsequently, numerical simulations are given to illustrate and visualise the effectiveness and feasibility of the theoretical results. © The Institution of Engineering and Technology 2013.


Zhou J.,Shanghai University | Zhang H.,Shanghai University | Zhang H.,Tongren College | Xiang L.,Shanghai University | Wu Q.,Shanghai University of Electric Power
Automatica | Year: 2012

In this brief we propose a distributed algorithm for synchronization of coupled harmonic oscillators with local instantaneous interaction. We provide convergence analysis for such algorithm without and with a leader over fixed and switching undirected network topologies, respectively. We also establish the conditions by which the coupled harmonic oscillators achieve synchronized oscillatory motions under instantaneous network connectivity. It is shown that the coupled harmonic oscillators can be synchronized even each oscillator instantaneously exchanges the velocity information with its neighbors only at discrete moments. Subsequently, numerical examples illustrate and visualize the effectiveness and feasibility of the theoretical results. © 2012 Elsevier Ltd. All rights reserved.

Discover hidden collaborations