- Title
- Reach almost sure consensus with only group information
- Creator
- Lin, Zhiyun; Hou, Jian; Yan, Gangfeng; Yu, Changbin
- Relation
- ARC.DP130103610 http://purl.org/au-research/grants/arc/DP130103610
- Relation
- Automatica Vol. 52, Issue February 2015, p. 283-289
- Publisher Link
- http://dx.doi.org/10.1016/j.automatica.2014.11.011
- Publisher
- Elsevier
- Resource Type
- journal article
- Date
- 2015
- Description
- This brief presents a new distributed scheme to solve the consensus problem for a group of agents if neither their absolute states nor inter-agent relative states are available. The new scheme considers a random partition of agents into two subgroups at each step and then uses the relative group representative state as feedback information for the consensus purpose. It is then shown that almost sure consensus can be achieved under the proposed scheme in both discrete time and continuous time. For the discrete time case, almost sure consensus is achieved if and only if the weighting parameter for state update is greater than one. For the continuous time case, almost sure consensus is realized when the weighting parameter is positive. Moreover, it is shown that if a uniform probability is considered for group selection, then the group of agents can reach average consensus in mean.
- Subject
- consensus; multi-agent systems; random networks
- Identifier
- http://hdl.handle.net/1959.13/1335638
- Identifier
- uon:27467
- Identifier
- ISSN:0005-1098
- Language
- eng
- Reviewed
- Hits: 1335
- Visitors: 1293
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|