Interval consensus problem of multi-agent systems in accordance with switching protocol

Minghui Wang, Kenko Uchida

    Research output: Contribution to journalArticle

    2 Citations (Scopus)

    Abstract

    In this paper, we discuss the interval consensus problem of multi-agent systems by providing a special Laplacian of directed graphs. As one of the most important issues in the coordination control of multi-agent systems, the consensus problem requires that the output of several spatially distributed agents reach a common value that depends on the states of all agents. For the given consensus protocol and initial states, a fixed consensus value is obtained. The resulting consensus value, however, may not be ideal or meet the quality that we require from the multi-agent system. In this paper, by introducing two state-dependent switching parameters into the consensus protocol, the system given by the proposed protocol can globally asymptotically converge to a designated point on a special closed and bounded interval. In other words, the system given by the proposed protocol can globally asymptotically reach interval consensus and then the system can also achieve a generalised interval average consensus if the directed graph is balanced. Simulations are presented to demonstrate the effectiveness of our theoretical results.

    Original languageEnglish
    Pages (from-to)707-717
    Number of pages11
    JournalInternational Journal of Systems Science
    Volume47
    Issue number3
    DOIs
    Publication statusPublished - 2016 Feb 17

    Fingerprint

    Consensus Problem
    Multi agent systems
    Multi-agent Systems
    Directed graphs
    Interval
    Directed Graph
    Converge
    Closed
    Dependent
    Output
    Demonstrate
    Simulation

    Keywords

    • consensus problem
    • multi-agent systems
    • switching protocol

    ASJC Scopus subject areas

    • Control and Systems Engineering
    • Theoretical Computer Science
    • Computer Science Applications

    Cite this

    Interval consensus problem of multi-agent systems in accordance with switching protocol. / Wang, Minghui; Uchida, Kenko.

    In: International Journal of Systems Science, Vol. 47, No. 3, 17.02.2016, p. 707-717.

    Research output: Contribution to journalArticle

    @article{6b6fc9a6dd5f4f8cb5be60c3e99ce5b7,
    title = "Interval consensus problem of multi-agent systems in accordance with switching protocol",
    abstract = "In this paper, we discuss the interval consensus problem of multi-agent systems by providing a special Laplacian of directed graphs. As one of the most important issues in the coordination control of multi-agent systems, the consensus problem requires that the output of several spatially distributed agents reach a common value that depends on the states of all agents. For the given consensus protocol and initial states, a fixed consensus value is obtained. The resulting consensus value, however, may not be ideal or meet the quality that we require from the multi-agent system. In this paper, by introducing two state-dependent switching parameters into the consensus protocol, the system given by the proposed protocol can globally asymptotically converge to a designated point on a special closed and bounded interval. In other words, the system given by the proposed protocol can globally asymptotically reach interval consensus and then the system can also achieve a generalised interval average consensus if the directed graph is balanced. Simulations are presented to demonstrate the effectiveness of our theoretical results.",
    keywords = "consensus problem, multi-agent systems, switching protocol",
    author = "Minghui Wang and Kenko Uchida",
    year = "2016",
    month = "2",
    day = "17",
    doi = "10.1080/00207721.2014.901581",
    language = "English",
    volume = "47",
    pages = "707--717",
    journal = "International Journal of Systems Science",
    issn = "0020-7721",
    publisher = "Taylor and Francis Ltd.",
    number = "3",

    }

    TY - JOUR

    T1 - Interval consensus problem of multi-agent systems in accordance with switching protocol

    AU - Wang, Minghui

    AU - Uchida, Kenko

    PY - 2016/2/17

    Y1 - 2016/2/17

    N2 - In this paper, we discuss the interval consensus problem of multi-agent systems by providing a special Laplacian of directed graphs. As one of the most important issues in the coordination control of multi-agent systems, the consensus problem requires that the output of several spatially distributed agents reach a common value that depends on the states of all agents. For the given consensus protocol and initial states, a fixed consensus value is obtained. The resulting consensus value, however, may not be ideal or meet the quality that we require from the multi-agent system. In this paper, by introducing two state-dependent switching parameters into the consensus protocol, the system given by the proposed protocol can globally asymptotically converge to a designated point on a special closed and bounded interval. In other words, the system given by the proposed protocol can globally asymptotically reach interval consensus and then the system can also achieve a generalised interval average consensus if the directed graph is balanced. Simulations are presented to demonstrate the effectiveness of our theoretical results.

    AB - In this paper, we discuss the interval consensus problem of multi-agent systems by providing a special Laplacian of directed graphs. As one of the most important issues in the coordination control of multi-agent systems, the consensus problem requires that the output of several spatially distributed agents reach a common value that depends on the states of all agents. For the given consensus protocol and initial states, a fixed consensus value is obtained. The resulting consensus value, however, may not be ideal or meet the quality that we require from the multi-agent system. In this paper, by introducing two state-dependent switching parameters into the consensus protocol, the system given by the proposed protocol can globally asymptotically converge to a designated point on a special closed and bounded interval. In other words, the system given by the proposed protocol can globally asymptotically reach interval consensus and then the system can also achieve a generalised interval average consensus if the directed graph is balanced. Simulations are presented to demonstrate the effectiveness of our theoretical results.

    KW - consensus problem

    KW - multi-agent systems

    KW - switching protocol

    UR - http://www.scopus.com/inward/record.url?scp=84941875789&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84941875789&partnerID=8YFLogxK

    U2 - 10.1080/00207721.2014.901581

    DO - 10.1080/00207721.2014.901581

    M3 - Article

    VL - 47

    SP - 707

    EP - 717

    JO - International Journal of Systems Science

    JF - International Journal of Systems Science

    SN - 0020-7721

    IS - 3

    ER -