Distributed Consensus Algorithms for a Class of High-Order Multi-Agent Systems on Directed Graphs

Abdelkader Abdessameud, Abdelhamid Tayebi

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

We consider the consensus problem of high-order multi-agent systems, described by multiple integrator dynamics, under general directed graphs. In contrast to the existing results, we propose a fully-distributed consensus algorithm, albeit employing static state feedback. Specifically, it is shown that, with a suitably designed similarity transformation, consensus is reached under only the necessary and sufficient condition of an interconnection graph having a spanning tree. The proposed approach relaxes some restrictive assumptions commonly considered in the available literature, such as imposing global gains in the network and/or exploiting additional information from neighboring agents other than their position-like states. In addition, the proposed approach enables the explicit determination of the final consensus state even in the presence of constant communication delays. Simulation results are provided to illustrate the effectiveness of the proposed approach.

Original languageEnglish (US)
Article number8272377
Pages (from-to)3464-3470
Number of pages7
JournalIEEE Transactions on Automatic Control
Volume63
Issue number10
DOIs
StatePublished - Oct 1 2018

Fingerprint

Directed graphs
State feedback
Multi agent systems
Parallel algorithms
Communication

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

Abdessameud, Abdelkader ; Tayebi, Abdelhamid. / Distributed Consensus Algorithms for a Class of High-Order Multi-Agent Systems on Directed Graphs. In: IEEE Transactions on Automatic Control. 2018 ; Vol. 63, No. 10. pp. 3464-3470.
@article{00a694864fb54a948fafff28c32657f6,
title = "Distributed Consensus Algorithms for a Class of High-Order Multi-Agent Systems on Directed Graphs",
abstract = "We consider the consensus problem of high-order multi-agent systems, described by multiple integrator dynamics, under general directed graphs. In contrast to the existing results, we propose a fully-distributed consensus algorithm, albeit employing static state feedback. Specifically, it is shown that, with a suitably designed similarity transformation, consensus is reached under only the necessary and sufficient condition of an interconnection graph having a spanning tree. The proposed approach relaxes some restrictive assumptions commonly considered in the available literature, such as imposing global gains in the network and/or exploiting additional information from neighboring agents other than their position-like states. In addition, the proposed approach enables the explicit determination of the final consensus state even in the presence of constant communication delays. Simulation results are provided to illustrate the effectiveness of the proposed approach.",
author = "Abdelkader Abdessameud and Abdelhamid Tayebi",
year = "2018",
month = "10",
day = "1",
doi = "10.1109/TAC.2018.2799520",
language = "English (US)",
volume = "63",
pages = "3464--3470",
journal = "IEEE Transactions on Automatic Control",
issn = "0018-9286",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "10",

}

Distributed Consensus Algorithms for a Class of High-Order Multi-Agent Systems on Directed Graphs. / Abdessameud, Abdelkader; Tayebi, Abdelhamid.

In: IEEE Transactions on Automatic Control, Vol. 63, No. 10, 8272377, 01.10.2018, p. 3464-3470.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Distributed Consensus Algorithms for a Class of High-Order Multi-Agent Systems on Directed Graphs

AU - Abdessameud, Abdelkader

AU - Tayebi, Abdelhamid

PY - 2018/10/1

Y1 - 2018/10/1

N2 - We consider the consensus problem of high-order multi-agent systems, described by multiple integrator dynamics, under general directed graphs. In contrast to the existing results, we propose a fully-distributed consensus algorithm, albeit employing static state feedback. Specifically, it is shown that, with a suitably designed similarity transformation, consensus is reached under only the necessary and sufficient condition of an interconnection graph having a spanning tree. The proposed approach relaxes some restrictive assumptions commonly considered in the available literature, such as imposing global gains in the network and/or exploiting additional information from neighboring agents other than their position-like states. In addition, the proposed approach enables the explicit determination of the final consensus state even in the presence of constant communication delays. Simulation results are provided to illustrate the effectiveness of the proposed approach.

AB - We consider the consensus problem of high-order multi-agent systems, described by multiple integrator dynamics, under general directed graphs. In contrast to the existing results, we propose a fully-distributed consensus algorithm, albeit employing static state feedback. Specifically, it is shown that, with a suitably designed similarity transformation, consensus is reached under only the necessary and sufficient condition of an interconnection graph having a spanning tree. The proposed approach relaxes some restrictive assumptions commonly considered in the available literature, such as imposing global gains in the network and/or exploiting additional information from neighboring agents other than their position-like states. In addition, the proposed approach enables the explicit determination of the final consensus state even in the presence of constant communication delays. Simulation results are provided to illustrate the effectiveness of the proposed approach.

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

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

U2 - 10.1109/TAC.2018.2799520

DO - 10.1109/TAC.2018.2799520

M3 - Article

VL - 63

SP - 3464

EP - 3470

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

SN - 0018-9286

IS - 10

M1 - 8272377

ER -