An algebraic approach to designing consensus algorithm of networked high dimensional agents

Chi Huang, Guisheng Zhai, Gesheng Xu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, we deal with a consensus control problem for a group of high dimensional agents which are networked by digraphs. Assuming that the control input of each agent is constructed based on the weighted difference between its states and those of its neighbor agents, we aim to propose an algorithm on computing the weighting coefficients in the control input. The problem is reduced to designing Hurwitz polynomials with complex coefficients. Focusing on the case of three dimensional systems, we show that by using Hurwitz polynomials with complex coefficients, we obtain a necessary and sufficient condition for the consensus algorithm. The condition is a natural extension to second order consensus, and is reasonable and practical due to its comparatively less computation burden. Two numerical examples show effectiveness of the proposed condition and the consensus algorithm.

Original languageEnglish
Title of host publicationProceedings of the 36th Chinese Control Conference, CCC 2017
PublisherIEEE Computer Society
Pages8293-8298
Number of pages6
ISBN (Electronic)9789881563934
DOIs
Publication statusPublished - 2017 Sep 7
Event36th Chinese Control Conference, CCC 2017 - Dalian, China
Duration: 2017 Jul 262017 Jul 28

Other

Other36th Chinese Control Conference, CCC 2017
CountryChina
CityDalian
Period17/7/2617/7/28

Fingerprint

Polynomials

Keywords

  • consensus algorithm
  • graph Laplacian
  • Hurwitz polynomials with complex coefficients
  • Networked high dimensional agents

ASJC Scopus subject areas

  • Computer Science Applications
  • Control and Systems Engineering
  • Applied Mathematics
  • Modelling and Simulation

Cite this

Huang, C., Zhai, G., & Xu, G. (2017). An algebraic approach to designing consensus algorithm of networked high dimensional agents. In Proceedings of the 36th Chinese Control Conference, CCC 2017 (pp. 8293-8298). [8028670] IEEE Computer Society. https://doi.org/10.23919/ChiCC.2017.8028670

An algebraic approach to designing consensus algorithm of networked high dimensional agents. / Huang, Chi; Zhai, Guisheng; Xu, Gesheng.

Proceedings of the 36th Chinese Control Conference, CCC 2017. IEEE Computer Society, 2017. p. 8293-8298 8028670.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Huang, C, Zhai, G & Xu, G 2017, An algebraic approach to designing consensus algorithm of networked high dimensional agents. in Proceedings of the 36th Chinese Control Conference, CCC 2017., 8028670, IEEE Computer Society, pp. 8293-8298, 36th Chinese Control Conference, CCC 2017, Dalian, China, 17/7/26. https://doi.org/10.23919/ChiCC.2017.8028670
Huang C, Zhai G, Xu G. An algebraic approach to designing consensus algorithm of networked high dimensional agents. In Proceedings of the 36th Chinese Control Conference, CCC 2017. IEEE Computer Society. 2017. p. 8293-8298. 8028670 https://doi.org/10.23919/ChiCC.2017.8028670
Huang, Chi ; Zhai, Guisheng ; Xu, Gesheng. / An algebraic approach to designing consensus algorithm of networked high dimensional agents. Proceedings of the 36th Chinese Control Conference, CCC 2017. IEEE Computer Society, 2017. pp. 8293-8298
@inproceedings{dee769c6dad341fe9f08524e7ee1ecd9,
title = "An algebraic approach to designing consensus algorithm of networked high dimensional agents",
abstract = "In this paper, we deal with a consensus control problem for a group of high dimensional agents which are networked by digraphs. Assuming that the control input of each agent is constructed based on the weighted difference between its states and those of its neighbor agents, we aim to propose an algorithm on computing the weighting coefficients in the control input. The problem is reduced to designing Hurwitz polynomials with complex coefficients. Focusing on the case of three dimensional systems, we show that by using Hurwitz polynomials with complex coefficients, we obtain a necessary and sufficient condition for the consensus algorithm. The condition is a natural extension to second order consensus, and is reasonable and practical due to its comparatively less computation burden. Two numerical examples show effectiveness of the proposed condition and the consensus algorithm.",
keywords = "consensus algorithm, graph Laplacian, Hurwitz polynomials with complex coefficients, Networked high dimensional agents",
author = "Chi Huang and Guisheng Zhai and Gesheng Xu",
year = "2017",
month = "9",
day = "7",
doi = "10.23919/ChiCC.2017.8028670",
language = "English",
pages = "8293--8298",
booktitle = "Proceedings of the 36th Chinese Control Conference, CCC 2017",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - An algebraic approach to designing consensus algorithm of networked high dimensional agents

AU - Huang, Chi

AU - Zhai, Guisheng

AU - Xu, Gesheng

PY - 2017/9/7

Y1 - 2017/9/7

N2 - In this paper, we deal with a consensus control problem for a group of high dimensional agents which are networked by digraphs. Assuming that the control input of each agent is constructed based on the weighted difference between its states and those of its neighbor agents, we aim to propose an algorithm on computing the weighting coefficients in the control input. The problem is reduced to designing Hurwitz polynomials with complex coefficients. Focusing on the case of three dimensional systems, we show that by using Hurwitz polynomials with complex coefficients, we obtain a necessary and sufficient condition for the consensus algorithm. The condition is a natural extension to second order consensus, and is reasonable and practical due to its comparatively less computation burden. Two numerical examples show effectiveness of the proposed condition and the consensus algorithm.

AB - In this paper, we deal with a consensus control problem for a group of high dimensional agents which are networked by digraphs. Assuming that the control input of each agent is constructed based on the weighted difference between its states and those of its neighbor agents, we aim to propose an algorithm on computing the weighting coefficients in the control input. The problem is reduced to designing Hurwitz polynomials with complex coefficients. Focusing on the case of three dimensional systems, we show that by using Hurwitz polynomials with complex coefficients, we obtain a necessary and sufficient condition for the consensus algorithm. The condition is a natural extension to second order consensus, and is reasonable and practical due to its comparatively less computation burden. Two numerical examples show effectiveness of the proposed condition and the consensus algorithm.

KW - consensus algorithm

KW - graph Laplacian

KW - Hurwitz polynomials with complex coefficients

KW - Networked high dimensional agents

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

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

U2 - 10.23919/ChiCC.2017.8028670

DO - 10.23919/ChiCC.2017.8028670

M3 - Conference contribution

SP - 8293

EP - 8298

BT - Proceedings of the 36th Chinese Control Conference, CCC 2017

PB - IEEE Computer Society

ER -