61 citations · 329 across the 74 of their papers we have counts for
7 papers · 1 filter
Connectivity and Set Tracking of Multi-agent Systems Guided by Multiple Moving Leaders
Guodong Shi, Yiguang Hong, K. H. Johansson
In this paper, we investigate distributed multi-agent tracking of a convex set specified by multiple moving leaders with unmeasurable velocities. Various jointly-connected interact…
The Role of Persistent Graphs in the Agreement Seeking of Social Networks
Guodong Shi, Karl Henrik Johansson
This paper investigates the role persistent arcs play for a social network to reach a global belief agreement under discrete-time or continuous-time evolution. Each (directed) arc…
Consensus over Random Graph Processes: Network Borel-Cantelli Lemmas for Almost Sure Convergence
Guodong Shi, Brian D. O. Anderson, Karl Henrik Johansson
Distributed consensus computation over random graph processes is considered. The random graph process is defined as a sequence of random variables which take values from the set of…
Reaching an Optimal Consensus: Dynamical Systems that Compute Intersections of Convex Sets
Guodong Shi, Karl Henrik Johansson, Yiguang Hong
In this paper, multi-agent systems minimizing a sum of objective functions, where each component is only known to a particular node, is considered for continuous-time dynamics with…
Multi-agent Robust Consensus: Convergence Analysis and Application
Guodong Shi, Karl Henrik Johansson
The paper investigates consensus problem for continuous-time multi-agent systems with time-varying communication graphs subject to process noises. Borrowing the ideas from input-to…
Randomized Optimal Consensus of Multi-agent Systems
Guodong Shi, Karl Henrik Johansson
In this paper, we formulate and solve a randomized optimal consensus problem for multi-agent systems with stochastically time-varying interconnection topology. The considered multi…
Converging an Overlay Network to a Gradient Topology
Håkan Terelius, Guodong Shi, Jim Dowling +3
In this paper, we investigate the topology convergence problem for the gossip-based Gradient overlay network. In an overlay network where each node has a local utility value, a Gra…