http://iet.metastore.ingenta.com
1887

Algebra

More general concepts than this:

1-1 of 1 results

Filter by subject:

< Any subject

  • Physics [1]
  • General [1]
  • Mathematical methods in physics [1]
  • Algebra, set theory, and graph theory [1]
  • Electrical and electronic engineering [1]
  • General topics, engineering mathematics and materials science [1]
  • Engineering mathematics and mathematical techniques [1]
  • Algebra [1]
  • Combinatorial mathematics [1]
  • Computer and control engineering [1]
  • See more See less

Filter by content type:

Filter by publication date:

< Any publication date

  • 2017 [1]

Filter by author:

< Any author

Finite-horizon bounded synchronisation and state estimation for discrete-time complex networks: local performance analysis
Author(s): Fei Han, Guoliang Wei, Derui Ding, Yan Song
Source: IET Control Theory & Applications, Volume 11, Issue 6, April 2017, p. 827 - 837
Type: Article
+ Show details - Hide details

This study is concerned with the finite-horizon bounded synchronisation and state estimation for the discrete-time complex networks with missing measurements based on the local performance analysis. First, a new local description of the bounded synchronisation performance index is proposed, which considers only the synchronisation errors among neighbours. In addition, a more general sector-bounded condition is presented, where the parameter matrices are different for different node. Next, by establishing the vector dissipativity-like for the complex network dynamics, the synchronisation criterion is derived in term of the locally coupled conditions for each node. These conditions implemented in a cooperative manner can judge whether the complex network reaches synchronisation. Similarly, the existence conditions for the estimator on each node are obtained, and then the estimator parameters are designed via the recursive linear matrix inequalities. Notably, these conditions on each node by cooperation among neighbours can achieve the desirable performance index. The distinctive features of the authors' algorithms are low complexity, scalability, and distributed execution. At last, two numerical examples are utilised to verify the effectiveness and applicability of the proposed algorithms.

Add to favourites
Export citations
Items per page 20 | 50 | 100
Print this page
This is a required field
Please enter a valid email address