IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v48y2017i10p2033-2040.html
   My bibliography  Save this article

Finite-time scaled consensus through parametric linear iterations

Author

Listed:
  • Yilun Shang

Abstract

This paper deals with finite-time scaled consensus problems over undirected and directed topologies, wherein agents’ states reach prescribed ratios in a finite time. We develop distributed linear iterations as a function of a linear operator on the underlying network and present necessary and sufficient conditions guaranteeing scaled consensus in a fixed number of steps equal to the number of distinct eigenvalues of a related linear operator. We identify the dependence of the final consensus states on the initial state condition, which can be conveniently and freely tuned by designing suitable parameters. Our results extend the recently developed approach on successive nulling of eigenvalues from complete consensus to scaled consensus, and from undirected topologies to directed topologies. Numerical examples and comparison studies are provided to illustrate the effectiveness of our theoretical results.

Suggested Citation

  • Yilun Shang, 2017. "Finite-time scaled consensus through parametric linear iterations," International Journal of Systems Science, Taylor & Francis Journals, vol. 48(10), pages 2033-2040, July.
  • Handle: RePEc:taf:tsysxx:v:48:y:2017:i:10:p:2033-2040
    DOI: 10.1080/00207721.2017.1309593
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2017.1309593
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207721.2017.1309593?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yilun Shang, 2018. "Resilient Multiscale Coordination Control against Adversarial Nodes," Energies, MDPI, vol. 11(7), pages 1-17, July.
    2. Bilal A. Rather & Hilal A. Ganie & Yilun Shang, 2024. "On the Signless Laplacian ABC -Spectral Properties of a Graph," Mathematics, MDPI, vol. 12(15), pages 1-23, July.
    3. Bin Yang & Xin Wang & Jian-an Fang & Yuhua Xu, 2019. "The Impact of Coupling Function on Finite-Time Synchronization Dynamics of Multi-Weighted Complex Networks with Switching Topology," Complexity, Hindawi, vol. 2019, pages 1-15, March.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tsysxx:v:48:y:2017:i:10:p:2033-2040. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.