• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
搜索

Author:

Zhang, Y.-X. (Zhang, Y.-X..) (Scholars:张永祥) | Chen, Y.-Z. (Chen, Y.-Z..) (Scholars:陈阳舟)

Indexed by:

Scopus PKU CSCD

Abstract:

The consensus problem is investigated for high-order continuous-time linear multi-agent systems with timevarying delay protocol over switching directed communication topologies. By using a linear transformation, the consensus problem is equivalently transformed into the asymptotic stability problem of a corresponding switched delay system. Under the assumption that each of the communication topologies is consensusable, with the help of the scheme of average dwelltime in switched systems, a sufficient condition is presented in terms of linear matrix inequalities(LMIs) to guarantee the consensus of the agents. Simulation result shows the effectiveness of the obtained results. © 2016, Editorial Office of Control and Decision. All right reserved.

Keyword:

Average dwell-time; Consensus; LMIs; Multi-agent system; Switching directed communication topologies; Time-varying delay

Author Community:

  • [ 1 ] [Zhang, Y.-X.]School of Metropolitan Transportation, Beijing University of Technology, Beijing, 100124, China
  • [ 2 ] [Chen, Y.-Z.]School of Metropolitan Transportation, Beijing University of Technology, Beijing, 100124, China

Reprint Author's Address:

  • 陈阳舟

    [Chen, Y.-Z.]School of Metropolitan Transportation, Beijing University of TechnologyChina

Show more details

Related Keywords:

Related Article:

Source :

Control and Decision

ISSN: 1001-0920

Year: 2016

Issue: 2

Volume: 31

Page: 349-354

Cited Count:

WoS CC Cited Count: 0

SCOPUS Cited Count: 6

ESI Highly Cited Papers on the List: 0 Unfold All

WanFang Cited Count:

Chinese Cited Count:

30 Days PV: 13

Online/Total:941/10619319
Address:BJUT Library(100 Pingleyuan,Chaoyang District,Beijing 100124, China Post Code:100124) Contact Us:010-67392185
Copyright:BJUT Library Technical Support:Beijing Aegean Software Co., Ltd.