TY - JOUR

T1 - A graph-theoretic approach on optimizing informed-node selection in multi-agent tracking control

AU - Shi, Guodong

AU - Sou, Kin Cheong

AU - Sandberg, Henrik

AU - Johansson, Karl Henrik

PY - 2014/1/15

Y1 - 2014/1/15

N2 - A graph optimization problem for a multi-agent leader-follower problem is considered. In a multi-agent system with n followers and one leader, each agent's goal is to track the leader using the information obtained from its neighbors. The neighborhood relationship is defined by a directed communication graph where k agents, designated as informed agents, can become neighbors of the leader. This paper establishes that, for any given strongly connected communication graph with k informed agents, all agents will converge to the leader. In addition, an upper bound and a lower bound of the convergence rate are obtained. These bounds are shown to explicitly depend on the maximal distance from the leader to the followers. The dependence between this distance and the exact convergence rate is verified by empirical studies. Then we show that minimizing the maximal distance problem is a metric k-center problem in classical combinatorial optimization studies, which can be approximately solved. Numerical examples are given to illustrate the properties of the approximate solutions.

AB - A graph optimization problem for a multi-agent leader-follower problem is considered. In a multi-agent system with n followers and one leader, each agent's goal is to track the leader using the information obtained from its neighbors. The neighborhood relationship is defined by a directed communication graph where k agents, designated as informed agents, can become neighbors of the leader. This paper establishes that, for any given strongly connected communication graph with k informed agents, all agents will converge to the leader. In addition, an upper bound and a lower bound of the convergence rate are obtained. These bounds are shown to explicitly depend on the maximal distance from the leader to the followers. The dependence between this distance and the exact convergence rate is verified by empirical studies. Then we show that minimizing the maximal distance problem is a metric k-center problem in classical combinatorial optimization studies, which can be approximately solved. Numerical examples are given to illustrate the properties of the approximate solutions.

KW - Convergence rate

KW - Leader-follower models

KW - Multi-agent systems

KW - Structure optimization

UR - http://www.scopus.com/inward/record.url?scp=84889096325&partnerID=8YFLogxK

U2 - 10.1016/j.physd.2013.07.014

DO - 10.1016/j.physd.2013.07.014

M3 - Article

SN - 0167-2789

VL - 267

SP - 104

EP - 111

JO - Physica D: Nonlinear Phenomena

JF - Physica D: Nonlinear Phenomena

ER -