Brief paper: Containment in leader-follower networks with switching communication topologies

Authors:
G. Notarstefano;M. Egerstedt;M. Haque
Affiliations:
Department of Engineering, University of Lecce, Via per Monteroni, 73100 Lecce, Italy;School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA;School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA 30332, USA
Venue:
Automatica (Journal of IFAC)
Year:
2011

Citing 2
Cited 2

Solving coverage problems with embedded graph grammars

HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
Laplacian sheep: a hybrid, stop-go policy for leader-based containment control

HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control

Necessary and sufficient conditions for containment control of networked multi-agent systems

Automatica (Journal of IFAC)
Distributed adaptive coordination for multiple Lagrangian systems under a directed graph without using neighbors' velocity information

Automatica (Journal of IFAC)

Quantified Score

Hi-index	22.16

Visualization

Abstract

We study bipartite, first-order networks where the nodes take on leader or follower roles. Specifically, we let the leaders' positions be static and assume that leaders and followers communicate via an undirected switching graph topology. This assumption is inspired by the swarming behavior of silkworm moths, where female moths intermittently release pheromones to be detected by the males. The main result presented here states that if the followers execute the linear agreement protocol, they will converge to the convex hull spanned by the leaders' positions as long as the time-varying undirected graph defining the communication among all agents is jointly connected. The novelty of this research is that we use LaSalle's Invariance Principle for switched systems, and additionally, the result is shown to hold for arbitrary state dimensions.