Nonlinear convergence algorithm: structural properties with doubly stochastic quadratic operators for multi-agent systems

• Main Authors: Abdulghafor, Rawad Abdulkhaleq Abdulmolla, Turaev, Sherzod, Zeki, Akram M., Adamu, Abubakar Ibrahim
• Format: Article
• Language: English; English; English
• Published: De Gruyter 2018
• Subjects: QA Mathematics; QA75 Electronic computers. Computer science
• Online Access: http://irep.iium.edu.my/59266/1/jaiscr-2018-0003.pdf; http://irep.iium.edu.my/59266/7/59266_Nonlinear%20convergence%20algorithm_scopus.pdf; http://irep.iium.edu.my/59266/13/59266_Nonlinear%20convergence%20algorithm_WoS.pdf; http://irep.iium.edu.my/59266/; https://www.degruyter.com/downloadpdf/j/jaiscr.2018.8.issue-1/jaiscr-2018-0003/jaiscr-2018-0003.pdf
• Institution: Universiti Islam Antarabangsa Malaysia

This paper proposes nonlinear operator of extreme doubly stochastic quadratic operator (EDSQO) for convergence algorithm aimed at solving consensus problem (CP) of discrete-time for multi-agent systems (MAS) on n-dimensional simplex. The first part undertakes systematic review of consensus problems. Convergence was generated via extreme doubly stochastic quadratic operators (EDSQOs) in the other part. However, this work was able to formulate convergence algorithms from doubly stochastic matrices, majorization theory, graph theory and stochastic analysis. We develop two algorithms: 1) the nonlinear algorithm of extreme doubly stochastic quadratic operator (NLAEDSQO) to generate all the convergent EDSQOs and 2) the nonlinear convergence algorithm (NLCA) of EDSQOs to investigate the optimal consensus for MAS. Experimental evaluation on convergent of EDSQOs yielded an optimal consensus for MAS. Comparative analysis with the convergence of EDSQOs and DeGroot model were carried out. The comparison was based on the complexity of operators, number of iterations to converge and the time required for convergences. This research proposed algorithm on convergence which is faster than the DeGroot linear model.