Positive Consensus of Fractional-Order Multiagent Systems Over Directed Graphs

This article investigates the positive consensus problem of a special kind of interconnected positive systems over directed graphs. They are composed of multiple fractional-order continuous-time positive linear systems. Unlike most existing works in the literature, we study this problem for the first time, in which the communication topology of agents is described by a directed graph containing a spanning tree. This is a more general and new scenario due to the interplay between the eigenvalues of the Laplacian matrix and the controller gains, which renders the positivity analysis fairly challenging. Based on the existing results in spectral graph theory, fractional-order systems (FOSs) theory, and positive systems theory, we derive several necessary and/or sufficient conditions on the positive consensus of fractional-order multiagent systems (PCFMAS). It is shown that the protocol, which is designed for a specific graph, can solve the positive consensus problem of agents over an additional set of directed graphs. Finally, a comprehensive comparison study of different approaches is carried out, which shows that the proposed approaches have advantages over the existing ones.

Automated summary

This article investigates the positive consensus problem of a special kind of interconnected positive systems over directed graphs. Based on the results in spectral graph theory, fractional-order systems (FOSs) theory, and positive systems theory, several necessary and/or sufficient conditions on the positive consensus of fractional-order multiagent systems (PCFMAS) are derived. A comprehensive comparison study shows that the proposed approaches have advantages over the existing ones.