Pinning stabilization of linearly coupled stochastic neural networks via minimum number of controllers

  • Authors:
  • Jianquan Lu;Daniel W. C. Ho;Zidong Wang

  • Affiliations:
  • Department of Mathematics, Southeast University, Nanjing, China and Department of Mathematics, City University of Hong Kong, Kowloon, Hong Kong;Department of Mathematics, City University of Hong Kong, Kowloon, Hong Kong;Department of Information Systems and Computing, Brunel University, Uxbridge, Middlesex, UK

  • Venue:
  • IEEE Transactions on Neural Networks
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

Pinning stabilization problem of linearly coupled stochastic neural networks (LCSNNs) is studied in this paper. A minimum number of controllers are used to force the LCSNNs to the desired equilibrium point by fully utilizing the structure of the network. In order to pinning control the LCSNNs to a certain desired state, only one controller is required for strongly connected network topology, and M controllers, which will be shown to be the minimum number, are needed for LCSNNs with M-reducible coupling matrix. The isolate node of the LCSNNs can be stable, periodic, or even chaotic. The coupling Laplacian matrix of the LCSNNs can be symmetric irreducible, asymmetric irreducible, or M-reducible, which means that the network topology can be strongly connected, weakly connected, or even unconnected. There is no constraint on the network topology. Some criteria are derived to judge whether the LCSNNs can be controlled in mean square by using designed controllers. The given criteria are expressed in terms of strict linear matrix inequalities, which can be easily checked by resorting to recently developed algorithm. Moreover, numerical examples including small-world and scale-free networks are also given to demonstrate that our theoretical results are valid and efficient for large systems.