Achieving consensus in networks with disturbances
The convergence of binary majority consensus algorithms is studied in networks with different types of disturbances. It is shown how randomization can foster convergence.
The convergence of binary majority consensus algorithms is studied in networks with different types of disturbances. It is shown how randomization can foster convergence.