Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Randomized optimal consensus of multi-agent systems
KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.ORCID-id: 0000-0001-9940-5929
2012 (engelsk)Inngår i: Automatica, ISSN 0005-1098, E-ISSN 1873-2836, Vol. 48, nr 12, s. 3018-3030Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

In this paper, we formulate and solve a randomized optimal consensus problem for multi-agent systems with stochastically time-varying interconnection topology. The considered multi-agent system with a simple randomized iterating rule achieves an almost sure consensus meanwhile solving the optimization problem min(z is an element of Rd) Sigma(n)(i=1) f(i)(z), in which the optimal solution set of objective function f(i) can only be observed by agent i itself. At each time step, simply determined by a Bernoulli trial, each agent independently and randomly chooses either taking an average among its neighbor set, or projecting onto the optimal solution set of its own optimization component. Both directed and bidirectional communication graphs are studied. Connectivity conditions are proposed to guarantee an optimal consensus almost surely with proper convexity and intersection assumptions. The convergence analysis is carried out using convex analysis. We compare the randomized algorithm with the deterministic one via a numerical example. The results illustrate that a group of autonomous agents can reach an optimal opinion by each node simply making a randomized trade-off between following its neighbors or sticking to its own opinion at each time step.

sted, utgiver, år, opplag, sider
2012. Vol. 48, nr 12, s. 3018-3030
Emneord [en]
Multi-agent systems, Optimal consensus, Set convergence, Distributed optimization, Randomized algorithms
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-85510DOI: 10.1016/j.automatica.2012.08.018ISI: 000312286800003OAI: oai:DiVA.org:kth-85510DiVA, id: diva2:499944
Forskningsfinansiär
Knut and Alice Wallenberg FoundationSwedish Research CouncilICT - The Next Generation
Merknad

QC 20130110

Tilgjengelig fra: 2012-02-13 Laget: 2012-02-13 Sist oppdatert: 2017-12-07bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstarXiv

Personposter BETA

Johansson, Karl Henrik

Søk i DiVA

Av forfatter/redaktør
Shi, GuodongJohansson, Karl Henrik
Av organisasjonen
I samme tidsskrift
Automatica

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 59 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf