Search Results for author:
Found 8 papers, 0 papers with code
Vector-valued Privacy-Preserving Average Consensus
We show that the vector-valued PPAC problem can be solved via associated matrix-weighted networks with the higher-dimensional agent state.
Structural Adaptivity of Directed Networks
Inspired by the observation that the link redundancy in a network may degrade its diffusion performance, a distributed data-driven neighbor selection framework is proposed to adaptively adjust the network structure for improving the diffusion performance of exogenous influence over the network.
Event-triggered Consensus of Matrix-weighted Networks Subject to Actuator Saturation
The Zeno phenomenon can be excluded for both cases under the proposed coordination strategy.
Distributed Stabilization of Signed Networks via Self-loop Compensation
First, we examine the stability of signed networks by introducing a novel graph-theoretic objective negative cut set, which implies that manipulating negative edge weights cannot change a unstable network into a stable one.
Distributed Neighbor Selection in Multi-agent Networks
For distributed implementation, a quantitative connection between entries of Laplacian eigenvectors and the "relative rate of change" in the state between neighboring agents is further established; this connection facilitates a distributed algorithm for each agent to identify "favorable" neighbors to interact with.
Cluster Consensus on Matrix-weighted Switching Networks
Second, if the underlying network switches amongst infinite number of networks, the matrix-weighted integral network is employed to provide sufficient conditions for cluster consensus and the quantitative characterization of the corresponding steady-state of the multi-agent system, using null space analysis of matrix-valued Laplacian related of integral network associated with the switching networks.
Dynamic Event-Triggered Consensus of Multi-agent Systems on Matrix-weighted Networks
This paper examines the event-triggered consensus of the multi-agent system on matrix-weighted networks, where the interdependencies among higher-dimensional states of neighboring agents are characterized by matrix-weighted edges in the network.
Characterizing Bipartite Consensus on Signed Matrix-Weighted Networks via Balancing Set
We show that necessary and/or sufficient conditions for bipartite consensus on matrix-weighted networks can be characterized by the uniqueness of the non-trivial balancing set, while the contribution of the associated non-trivial intersection of null spaces to the steady-state of the matrix-weighted network is examined.
