A New Generalized Consensus Problem and Its CRT-Based Solution

Giuseppe Campobello

doi:10.1109/TAC.2015.2446711

A New Generalized Consensus Problem and Its CRT-Based Solution

2016-03-01

1

PRE

AI

G

Giuseppe Campobello *

Alessandro Leonardi *

DOI：10.1109/TAC.2015.2446711

原文链接

原文求助

摘要

En 中文

This technical note introduces a new generalized consensus problem where nodes in a network are guaranteed to reach the final consensus on a common vector whose elements are exactly the initial values arbitrarily chosen by nodes. We propose a fully decentralized algorithm able to solve the above problem and derive conditions to guarantee that consensus is reached in a finite number of steps. In particular, we prove that in a network composed by n nodes, the proposed consensus problem is solvable in at most 2n steps. Moreover, we introduce a finite-field solution based on the Chinese Remainder Theorem (CRT) able to reduce the complexity of the proposed approach in the case of capacity constraints, and we discuss an illustrative case study.

Keyword:

Chinese Remainder Theorem (CRT)

Consensus

A New Generalized Consensus Problem and Its CRT-Based Solution

摘要

AI总结

期刊

机构