Second-order agents on ring digraphs

Sergei Parsegov, Pavel Chebotarev

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

The paper addresses the problem of consensus Seeking among second-order linear agents interconnected in a specific ring topology. Unlike the existing results in the field dealing with one-directional digraphs arising in various cyclic pursuit algorithms or two-directional graphs, we focus on the case where some arcs in a two-directional ring graph are dropped in a regular fashion. The derived condition for achieving consensus turns out to be independent of the number of agents in a network.

Original languageEnglish
Title of host publication2018 22nd International Conference on System Theory, Control and Computing, ICSTCC 2018 - Proceedings
EditorsRazvan Solea, Marian Barbu, Adrian Filipescu
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages609-614
Number of pages6
ISBN (Electronic)9781538644447
DOIs
Publication statusPublished - 19 Nov 2018
Event22nd International Conference on System Theory, Control and Computing, ICSTCC 2018 - Sinaia, Romania
Duration: 10 Oct 201812 Oct 2018

Publication series

Name2018 22nd International Conference on System Theory, Control and Computing, ICSTCC 2018 - Proceedings

Conference

Conference22nd International Conference on System Theory, Control and Computing, ICSTCC 2018
Country/TerritoryRomania
CitySinaia
Period10/10/1812/10/18

Keywords

  • cyclic pursuit
  • ring digraph
  • second-order agents

Fingerprint

Dive into the research topics of 'Second-order agents on ring digraphs'. Together they form a unique fingerprint.

Cite this