Improvement of a distributed algorithm for solving linear equations
This paper performs further improvement to a distributed algorithm for solving linear
algebraic equations via multi-agent networks recently developed by Mou et al., in which all …
algebraic equations via multi-agent networks recently developed by Mou et al., in which all …
A resilient convex combination for consensus-based distributed algorithms
Consider a set of vectors in $\mathbb {R}^ n $, partitioned into two classes: normal vectors
and malicious vectors. The number of malicious vectors is bounded but their identities are …
and malicious vectors. The number of malicious vectors is bounded but their identities are …
Disturbance observer-based consensus control for multiple robotic manipulators
CE Ren, T Du, G Li, Z Shi - IEEE Access, 2018 - ieeexplore.ieee.org
In this paper, a new distributed consensus control algorithm for multiple robotic manipulators
is proposed. Comparing with the existing works, this paper studies the consensus problem …
is proposed. Comparing with the existing works, this paper studies the consensus problem …
Vector-Valued Gossip over -Holonomic Networks
We study the weighted average consensus problem for a gossip network of agents with
vector-valued states. For a given matrix-weighted graph, the gossip process is described by …
vector-valued states. For a given matrix-weighted graph, the gossip process is described by …
Pointing consensus and bearing-based solutions to the fermat–weber location problem
The pointing consensus problem asks each agent in a multiagent system to agree on their
headings toward a common target. This paper proposes a decentralized approach to the …
headings toward a common target. This paper proposes a decentralized approach to the …
Distributed algorithms for edge-agreements: More than consensus
In this paper, we propose distributed algorithms for multi-agent systems to achieve edge-
agreements. Different from consensus, where all agents' states converge to be the same …
agreements. Different from consensus, where all agents' states converge to be the same …
Resilience for distributed consensus with constraints
This paper proposes a new approach that enables multi-agent systems to achieve
resilient\textit {constrained} consensus in the presence of Byzantine attacks, in contrast to …
resilient\textit {constrained} consensus in the presence of Byzantine attacks, in contrast to …
On the H-Property for Step-Graphons and Edge Polytopes
Graphons can be used as stochastic models to sample graphs on nodes for arbitrarily large.
A graphon is said to have the-property if admits a decomposition into disjoint cycles with …
A graphon is said to have the-property if admits a decomposition into disjoint cycles with …
Distributed Algorithm for Edge Agreement Over Nonlinear Constraints
In this paper, we introduce a comprehensive framework called edge agreement, where
agents collaboratively strive to reach an agreement on non-linear edge constraints de-fined …
agents collaboratively strive to reach an agreement on non-linear edge constraints de-fined …
Distributed Algorithm with Resilience for Multi-Agent Task Allocation
This paper develops an Iterated Auction-Consensus Algorithm (IACA) for resilient task
allocation on a distributed multi-agent platform. The IACA enables each agent in the network …
allocation on a distributed multi-agent platform. The IACA enables each agent in the network …