Flocking of multi-agents based on consensus protocol and pinning control

He, Chenlong; Feng, Zuren; Ren, Zhigang

doi:10.1109/wcica.2012.6358083

Cited by 2 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, the ordinary Laplacian based protocols can be adopted to solve the flocking problem. The flocking problem has also been widely investigated from single-integrator kinematics to double-integrator dynamics, from timely communication to delayed communication, from fixed topology to switching topology, and from without robustness to robustness (Blondel et al, 2005;Moshtagh and Jadbabaie, 2007;Li et al, 2008;He et al, 2012;Wang and Peng, 2012;Martin, 2014;Semnani and Basir, 2015).…”

Section: Flockingmentioning

confidence: 99%

Distributed coordination in multi-agent systems: a graph Laplacian perspective

Han

Lin

et al. 2015

Frontiers Inf Technol Electronic Eng

View full text Add to dashboard Cite

This paper reviews some main results and progress in distributed multi-agent coordination from a graph Laplacian perspective. Distributed multi-agent coordination has been a very active subject studied extensively by the systems and control community in last decades, including distributed consensus, formation control, sensor localization, distributed optimization, etc. The aim of this paper is to provide both a comprehensive survey of existing literature in distributed multi-agent coordination and a new perspective in terms of graph Laplacian to categorize the fundamental mechanisms for distributed coordination. For different types of graph Laplacians, we summarize their inherent coordination features and specific research issues. This paper also highlights several promising research directions along with some open problems that are deemed important for future study.

show abstract