Cartesian product-based hierarchical scheme for multi-agent systems

Muhammad Iqbal, John-Josef Leth, Trung Dung Ngo

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

2 Citationer (Scopus)

Resumé

In this paper, we solve the average-consensus problem using a hierarchical scheme based on Cartesian product of strongly connected balanced graphs — an algebraic approach to design complex networks. We show that the Cartesian product based hierarchical scheme for multi-agent systems outperforms the single-layer control strategies for average-consensus problem in terms of convergence rate, and also the system matrix produced by Cartesian product-based hierarchical (CPH) scheme do not necessarily exhibit block circulant symmetry. We analyze that if the factors graphs in Cartesian product are cyclic pursuit graphs, then the CPH scheme provides the same convergence rate while requiring the same communication links as in the hierarchical cyclic pursuit (HCP). We provide simulation results to demonstrate the key theoretical results.

OriginalsprogEngelsk
TidsskriftAutomatica
Vol/bind88
Sider (fra-til)70-75
Antal sider6
ISSN0005-1098
DOI
StatusUdgivet - 2018

Fingerprint

Complex networks
Multi agent systems
Telecommunication links
Byproducts

Citer dette

Iqbal, Muhammad ; Leth, John-Josef ; Ngo, Trung Dung. / Cartesian product-based hierarchical scheme for multi-agent systems. I: Automatica. 2018 ; Bind 88. s. 70-75.
@article{048996c30abd49bcb0a2b0496607fbf3,
title = "Cartesian product-based hierarchical scheme for multi-agent systems",
abstract = "In this paper, we solve the average-consensus problem using a hierarchical scheme based on Cartesian product of strongly connected balanced graphs — an algebraic approach to design complex networks. We show that the Cartesian product based hierarchical scheme for multi-agent systems outperforms the single-layer control strategies for average-consensus problem in terms of convergence rate, and also the system matrix produced by Cartesian product-based hierarchical (CPH) scheme do not necessarily exhibit block circulant symmetry. We analyze that if the factors graphs in Cartesian product are cyclic pursuit graphs, then the CPH scheme provides the same convergence rate while requiring the same communication links as in the hierarchical cyclic pursuit (HCP). We provide simulation results to demonstrate the key theoretical results.",
author = "Muhammad Iqbal and John-Josef Leth and Ngo, {Trung Dung}",
year = "2018",
doi = "10.1016/j.automatica.2017.11.009",
language = "English",
volume = "88",
pages = "70--75",
journal = "Automatica",
issn = "0005-1098",
publisher = "Pergamon Press",

}

Cartesian product-based hierarchical scheme for multi-agent systems. / Iqbal, Muhammad; Leth, John-Josef; Ngo, Trung Dung.

I: Automatica, Bind 88, 2018, s. 70-75.

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

TY - JOUR

T1 - Cartesian product-based hierarchical scheme for multi-agent systems

AU - Iqbal, Muhammad

AU - Leth, John-Josef

AU - Ngo, Trung Dung

PY - 2018

Y1 - 2018

N2 - In this paper, we solve the average-consensus problem using a hierarchical scheme based on Cartesian product of strongly connected balanced graphs — an algebraic approach to design complex networks. We show that the Cartesian product based hierarchical scheme for multi-agent systems outperforms the single-layer control strategies for average-consensus problem in terms of convergence rate, and also the system matrix produced by Cartesian product-based hierarchical (CPH) scheme do not necessarily exhibit block circulant symmetry. We analyze that if the factors graphs in Cartesian product are cyclic pursuit graphs, then the CPH scheme provides the same convergence rate while requiring the same communication links as in the hierarchical cyclic pursuit (HCP). We provide simulation results to demonstrate the key theoretical results.

AB - In this paper, we solve the average-consensus problem using a hierarchical scheme based on Cartesian product of strongly connected balanced graphs — an algebraic approach to design complex networks. We show that the Cartesian product based hierarchical scheme for multi-agent systems outperforms the single-layer control strategies for average-consensus problem in terms of convergence rate, and also the system matrix produced by Cartesian product-based hierarchical (CPH) scheme do not necessarily exhibit block circulant symmetry. We analyze that if the factors graphs in Cartesian product are cyclic pursuit graphs, then the CPH scheme provides the same convergence rate while requiring the same communication links as in the hierarchical cyclic pursuit (HCP). We provide simulation results to demonstrate the key theoretical results.

U2 - 10.1016/j.automatica.2017.11.009

DO - 10.1016/j.automatica.2017.11.009

M3 - Journal article

VL - 88

SP - 70

EP - 75

JO - Automatica

JF - Automatica

SN - 0005-1098

ER -