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
Reaching optimal consensus for multi-agent systems based on approximate projection
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: 10th World Congress on Intelligent Control and Automation (WCICA), 2012, IEEE conference proceedings, 2012, s. 2794-2800Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

In this paper, we propose an approximately projected consensus algorithm (APCA) for a network to cooperatively compute the intersection of several convex sets, each of which is known only to a particular node. Instead of assuming the exact convex projection, we allow each node to just compute an approximate projection. The communication graph is directed and time-varying, and nodes can only exchange information via averaging among local view. We present sufficient and/or necessary conditions for the APCA, which shows on how much projection accuracy is required to ensure a global consensus within the intersection set when the communication graphs is uniformly jointly strongly connected. We show that π/4 is a critical angle error in the projection approximation to ensure a bounded solution for iterative projections. A numerical example indicates that the APCA may achieve better performance than the exact projected consensus algorithm. The results add the understanding of the fundamentals of distributed convex intersection computation.

sted, utgiver, år, opplag, sider
IEEE conference proceedings, 2012. s. 2794-2800
Emneord [en]
Multi-agent systems, approximate projection, intersection computation, optimal consensus
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-111469DOI: 10.1109/WCICA.2012.6358346Scopus ID: 2-s2.0-84872342739OAI: oai:DiVA.org:kth-111469DiVA, id: diva2:586477
Konferanse
IEEE World Congress on Intelligent control and Automation, Beijing, China,6-8 July 2012
Merknad

QC 20130116

Tilgjengelig fra: 2013-01-16 Laget: 2013-01-11 Sist oppdatert: 2016-11-24bibliografisk kontrollert

Open Access i DiVA

fulltext(590 kB)230 nedlastinger
Filinformasjon
Fil FULLTEXT02.pdfFilstørrelse 590 kBChecksum SHA-512
39b4a9b58e5f766ab6954ae11271321e8c780b59272efc05712348dab191249bdc257849935a4c739796e914968a62f23465b05afd789b0f07680041a0e2b5de
Type fulltextMimetype application/pdf

Andre lenker

Forlagets fulltekstScopusIEEEXplore

Personposter BETA

Johansson, Karl Henrik

Søk i DiVA

Av forfatter/redaktør
Shi, GuodongJohansson, Karl Henrik
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 230 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 84 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