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

Necessary and sufficient conditions of stationary average consensus for second-order multi-agent systems

Author

Listed:
  • Yongquan Pei
  • Jitao Sun

Abstract

This paper investigates the stationary average consensus problem for second-order discrete-time multi-agent systems (SDMAS). A stationary consensus problem is to find a control algorithm that brings the state of a group of agents to a common constant value which is called the collective decision. We introduce the concept of stationary average consensus of SDMAS and propose a consensus algorithm. Based on the polynomial stability and the graph theory, we obtain two necessary and sufficient conditions of stationary average consensus of SDMAS. The last theorem provides an algebraic criterion of stationary average consensus, and can help us to determine the parameters in the consensus algorithm. Furthermore, in this consensus algorithm, only the states of the agents are transferred among the agents. Therefore, this algorithm can not only solve the stationary average consensus problem but also reduce the amount of transferred data. A numerical example is provided to illustrate the efficiency of our results.

Suggested Citation

  • Yongquan Pei & Jitao Sun, 2016. "Necessary and sufficient conditions of stationary average consensus for second-order multi-agent systems," International Journal of Systems Science, Taylor & Francis Journals, vol. 47(15), pages 3631-3636, November.
    • Handle: RePEc:taf:tsysxx:v:47:y:2016:i:15:p:3631-3636
    DOI: 10.1080/00207721.2015.1108475
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2015.1108475
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2015.1108475?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.

    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:47:y:2016:i:15:p:3631-3636. 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.