Cartesian product-based hierarchical scheme for multi-agent systems

Abstract In this paper, we solve the average-consensus problem using a hierarchical scheme based on Cartesian product of strongly connected balanced graphs — an algebraic approach to design complex networks. We show that the Cartesian product based hierarchical scheme for multi-agent systems outperforms the single-layer control strategies for average-consensus problem in terms of convergence rate, and also the system matrix produced by Cartesian product-based hierarchical (CPH) scheme do not necessarily exhibit block circulant symmetry. We analyze that if the factors graphs in Cartesian product are cyclic pursuit graphs, then the CPH scheme provides the same convergence rate while requiring the same communication links as in the hierarchical cyclic pursuit (HCP). We provide simulation results to demonstrate the key theoretical results.

[1]  M. Mesbahi,et al.  On the controllability and observability of Cartesian product networks , 2012, CDC 2012.

[2]  H. Shimizu,et al.  Cyclic pursuit behavior for hierarchical multi-agent systems with low-rank interconnection , 2008, 2008 SICE Annual Conference.

[3]  Mireille E. Broucke,et al.  A hierarchical cyclic pursuit scheme for vehicle networks , 2005, Autom..

[4]  Soummya Kar,et al.  Distributed Consensus Algorithms in Sensor Networks With Imperfect Communication: Link Failures and Channel Noise , 2007, IEEE Transactions on Signal Processing.

[5]  Shinji Hara,et al.  An algebraic approach to hierarchical LQR synthesis for large-scale dynamical systems , 2013, 2013 9th Asian Control Conference (ASCC).

[6]  Debasish Ghose,et al.  Generalization of Linear Cyclic Pursuit With Application to Rendezvous of Multiple Autonomous Agents , 2006, IEEE Transactions on Automatic Control.

[7]  Mehran Mesbahi,et al.  Controllability and Observability of Network-of-Networks via Cartesian Products , 2014, IEEE Transactions on Automatic Control.

[8]  Debasish Ghose,et al.  Generalized hierarchical cyclic pursuit , 2016, Autom..

[9]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[10]  Kevin S. Galloway,et al.  Symmetry and reduction in collectives: cyclic pursuit strategies , 2013, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[11]  Ruggero Carli,et al.  Communication constraints in the average consensus problem , 2008, Autom..

[12]  Kevin S. Galloway,et al.  Symmetry and reduction in collectives: low-dimensional cyclic pursuit , 2016, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[13]  Shinji Hara,et al.  Eigenvector-based intergroup connection of low rank for hierarchical multi-agent dynamical systems , 2012, Syst. Control. Lett..

[14]  Mireille E. Broucke,et al.  Local control strategies for groups of mobile autonomous agents , 2004, IEEE Transactions on Automatic Control.

[15]  Trung Dung Ngo,et al.  A Hierarchical Nearly Cyclic Pursuit for Consensus in Large-Scale Multi-agent Systems , 2017 .

[16]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[17]  José M. F. Moura,et al.  Big Data Analysis with Signal Processing on Graphs: Representation and processing of massive data sets with irregular structure , 2014, IEEE Signal Processing Magazine.

[18]  Shun-ichi Azuma,et al.  On a relation between graph signal processing and multi-agent consensus , 2016, 2016 IEEE 55th Conference on Decision and Control (CDC).