Concensus-based ALADIN method to faster the decentralized estimation of Laplacian spectrum

Abstract

With the upcoming fifth Industrial Revolution, humans and collaborative robots will dance together in production. They themselves act as an agent in a connected world, understood as a multi-agent system, in which the Laplacian spectrum plays an important role since it can define the connection of the complex networks as well as depict the robustness. In addition, the Laplacian spectrum can locally check the controllability and observability of a dynamic controlled network, etc. This paper presents a new method, which is based on the Augmented Lagrange based Alternating Direction Inexact Newton (ALADIN) method, to faster the convergence rate of the Laplacian Spectrum Estimation via factorization of the average consensus matrices, that are expressed as Laplacian-based matrices problems. Herein, the non-zero distinct Laplacian eigenvalues are the inverse of the stepsizes fat, ( = 1, 2, . . .) of those matrices. Therefore, the problem now is to carry out the agreement on the stepsize values for all agents in the given network while ensuring the factorization of average consensus matrices to be accomplished. Furthermore, in order to obtain the entire Laplacian spectrum, it is necessary to estimate the relevant multiplicities of these distinct eigenvalues. Consequently, a non-convex optimization problem is formed and solved using ALADIN method. The effectiveness of the proposed method is evaluated through the simulation results and the comparison with the Lagrange-based method in advance.