Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Global consensus for discrete-time multi-agent systems with input saturation constraints
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-7309-8086
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-9940-5929
2014 (English)In: Automatica, ISSN 0005-1098, E-ISSN 1873-2836, Vol. 50, no 2, 499-506 p.Article in journal (Refereed) Published
Abstract [en]

In this paper, we consider the global consensus problem for discrete-time multi-agent systems with input saturation constraints under fixed undirected topologies. We first give necessary conditions for achieving global consensus via a distributed protocol based on relative state measurements of the agent itself and its neighboring agents. We then focus on two special cases, where the agent model is either neutrally stable or a double integrator. For the neutrally stable case, any linear protocol of a particular form, which solves the consensus problem for the case without input saturation constraints, also solves the global consensus problem for the case with input saturation constraints. For the double integrator case, we show that a subset of linear protocols, which solve the consensus problem for the case without saturation constraints, also solve the global consensus problem for the case with input saturation constraints. The results are illustrated by numerical simulations.

Place, publisher, year, edition, pages
2014. Vol. 50, no 2, 499-506 p.
Keyword [en]
Global consensus, Input saturation constraints, Multi-agent systems
National Category
Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-142984DOI: 10.1016/j.automatica.2013.11.008ISI: 000332816400017Scopus ID: 2-s2.0-84893861538OAI: oai:DiVA.org:kth-142984DiVA: diva2:705177
Funder
Knut and Alice Wallenberg FoundationSwedish Research Council
Note

QC 20140314

Available from: 2014-03-14 Created: 2014-03-14 Last updated: 2017-12-05Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Dimarogonas, Dimos V.Johansson, Karl Henrik

Search in DiVA

By author/editor
Yang, TaoMeng, ZiyangDimarogonas, Dimos V.Johansson, Karl Henrik
By organisation
Automatic ControlACCESS Linnaeus Centre
In the same journal
Automatica
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 52 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf