Curtin University Homepage
  • Library
  • Help
    • Admin

    espace - Curtin’s institutional repository

    JavaScript is disabled for your browser. Some features of this site may not work without it.
    View Item 
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item
    • espace Home
    • espace
    • Curtin Research Publications
    • View Item

    Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs

    Access Status
    In process
    Authors
    Kawamura, S.
    Cai, K.
    Ye, Mengbin
    Lin, Z.
    Date
    2020
    Type
    Journal Article
    
    Metadata
    Show full item record
    Citation
    Kawamura, S. and Cai, K. and Ye, M. and Lin, Z. 2020. Tight bound on parameter of surplus-based averaging algorithm over balanced digraphs. International Journal of Control. 93 (8): pp. 1859-1866.
    Source Title
    International Journal of Control
    DOI
    10.1080/00207179.2018.1535200
    ISSN
    0020-7179
    Faculty
    Faculty of Science and Engineering
    School
    School of Elec Eng, Comp and Math Sci (EECMS)
    URI
    http://hdl.handle.net/20.500.11937/82649
    Collection
    • Curtin Research Publications
    Abstract

    © 2018, © 2018 Informa UK Limited, trading as Taylor & Francis Group. We study a continuous-time surplus-based algorithm for multi-agent average consensus, and derive a tight upper bound on the key parameter included in this algorithm that ensures convergence over strongly connected and balanced digraphs. We specialise the upper bound result to undirected (connected) graphs and unweighted cyclic digraphs; in particular, for undirected graphs the algorithm converges for arbitrary positive values of the parameter, and for cyclic digraphs the upper bound on the parameter depends only on the number of agents and may be easily calculated. Moreover, it is suggested through extensive simulation that, for the same number of agents, the upper bound for cyclic digraphs be smaller than that for other strongly connected and possibly unbalanced digraphs; this implies that as long as the parameter satisfies the upper bound for cyclic digraphs, this parameter can work for other digraphs.

    Related items

    Showing items related by title, author, creator and subject.

    • Restricted spanning trees and graph partitioning.
      Lam, Bee K. (1999)
      A network is a system that involves movement or flow of some commodities such as goods and services. In fact any structure that is in the form of a system of components some of which interact can be considered as a network. ...
    • Adaptive antenna array beamforming using a concatenation of recursive least square and least mean square algorithms
      Srar, Jalal Abdulsayed (2011)
      In recent years, adaptive or smart antennas have become a key component for various wireless applications, such as radar, sonar and cellular mobile communications including worldwide interoperability for microwave ...
    • 4D numerical observer for lesion detection in respiratory-gated PET
      Lorsakul, A.; Li, Q.; Trott, Cathryn; Hoog, C.; Petibon, Y.; Ouyang, J.; Laine, A.; El Fakhri, G. (2014)
      Purpose: Respiratory-gated positron emission tomography (PET)/computed tomography protocols reduce lesion smearing and improve lesion detection through a synchronized acquisition of emission data. However, an objective ...
    Advanced search

    Browse

    Communities & CollectionsIssue DateAuthorTitleSubjectDocument TypeThis CollectionIssue DateAuthorTitleSubjectDocument Type

    My Account

    Admin

    Statistics

    Most Popular ItemsStatistics by CountryMost Popular Authors

    Follow Curtin

    • 
    • 
    • 
    • 
    • 

    CRICOS Provider Code: 00301JABN: 99 143 842 569TEQSA: PRV12158

    Copyright | Disclaimer | Privacy statement | Accessibility

    Curtin University would like to pay our respect to the indigenous members of our community by acknowledging the traditional owners of the land on which the Perth Campus is located, the Wadjuk people of the Nyungar Nation; and on our Kalgoorlie Campus, the Wongutha people of the North-Eastern Goldfields.
    Watch our traditional Aboriginal welcome