Sökning: L773:0743 1619 OR L773:9781457710957
> (2010-2014) >
Agreeing under rand...
Agreeing under randomized network dynamics
-
- Shi, Guodong (författare)
- KTH,Reglerteknik,ACCESS Linnaeus Centre
-
- Johansson, Karl Henrik (författare)
- KTH,Reglerteknik,ACCESS Linnaeus Centre
-
(creator_code:org_t)
- IEEE Computer Society, 2012
- 2012
- Engelska.
-
Ingår i: 2012 American Control Conference (ACC). - : IEEE Computer Society. - 9781457710957 ; , s. 2394-2400
- Relaterad länk:
-
https://urn.kb.se/re...
Abstract
Ämnesord
Stäng
- In this paper, we study randomized consensus processing over general random graphs. At time step k, each node will follow the standard consensus algorithm, or stick to current state by a simple Bernoulli trial with success probability pk. Connectivity-independent and arc-independent graphs are defined, respectively, to capture the fundamental independence of random graph processes with respect to a consensus convergence. Sufficient and/or necessary conditions are presented on the success probability sequence for the network to reach a global a.s. consensus under various conditions of the communication graphs. Particularly, for arc-independent graphs with simple self-confidence condition, we show that Σk pk is a sharp threshold corresponding to a consensus 0 1 law, i.e., the consensus probability is 0 for almost all initial conditions if Σk pk converges, and jumps to 1 for all initial conditions if Σk pk diverges.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Reglerteknik (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Control Engineering (hsv//eng)
Nyckelord
- Consensus algorithms
- Dynamics Randomization
- Random graphs
- Threshold
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas