Reach almost sure consensus with only group information
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....[Show more]
|Collections||ANU Research Publications|
|Lin et al Reach almost sure consensus 2015.pdf||566.66 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.