We consider the problem of achieving average consensus in the minimum number of linear
iterations on a fixed, undirected graph. We are motivated by the task of deriving lower …

Finite time consensus algorithms compute consensus values exactly and in a finite number
of steps, contrasting with asymptotic consensus algorithms. In the literature, there exists few …

For multiagent networks described by undirected connectivity graphs, the problem of optimal
distributed consensus without prior knowledge of global connectivity is considered. The …

Synthesis of optimal controllers achieving finite-time consensus for multiagent networks
described by fixed or periodic connectivity graphs is considered. The solution procedure …

In a network, each agent communicates with its neighbors. All the agents have initial
observations, and they update their beliefs with the average of the beliefs in their …

The problem of finite-time distributed consensus for multi-agent networks described by fixed
directed graphs is considered without assuming the global connectivity graph is known to …

In this paper, we discuss the consensus of discrete-time multi-agent system. Based on the
network topology, consensus protocol in discrete-time with dynamic step-size is designed …

Development of a network of autonomous cooperating vehicles has attracted significant
attention during the past few years due to its broad range of applications in areas such as …

The problem of synthesizing linear dynamic feedback controllers which achieve distributed fi
nite-time consensus for networks of multiple agents described by fi xed connectivity graphs …

Diameter, optimal consensus, and graph eigenvalues | DIAL.pr - BOREAL Skip to main content
User menu Cart Login Home DIAL.pr - BOREAL Search form Search Home All Publications …