Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  is concerned with the H ∞ consensus tracking control problem for linear leader-follor systems with switching directed networks and exogenous disturbances, where the condition of zero control input for leader node is not assumed. Suppose the interaction network of all subsystems may switch among finite digraphs, which contains some non-identical directed spanning trees. Based only on the state information of neighboring agents, a design procedure for constructing the distributed consensus protocol is developed. By employing the topology-dependent multiple Lyapunov functions (MLFs) method and algebraic graph theory, the criteria of consensus protocol design is given in terms of linear matrix inequalities (LMIs). It is proved that the H ∞ consensus tracking problem for multi-agent systems (MASs) under dynamic directed topologies can be solvable if the topology average dll time satisfies a certain switching condition. Finally, a network system of F-18 aircraft is given as an example to verify the effectiveness of the proposed design method.
['Xin Wang', 'Guang-Hong Yang']
I am writing a research paper on a idea Distributed H ∞ consensus tracking control for multi-agent networks with switching directed topologies
[{"from": "human", "value": "I am writing a research paper on a idea Distributed H \u221e consensus tracking control for multi-agent networks with switching directed topologies"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  is concerned with the H \u221e consensus tracking control problem for linear leader-follor systems with switching directed networks and exogenous disturbances, where the condition of zero control input for leader node is not assumed. Suppose the interaction network of all subsystems may switch among finite digraphs, which contains some non-identical directed spanning trees. Based only on the state information of neighboring agents, a design procedure for constructing the distributed consensus protocol is developed. By employing the topology-dependent multiple Lyapunov functions (MLFs) method and algebraic graph theory, the criteria of consensus protocol design is given in terms of linear matrix inequalities (LMIs). It is proved that the H \u221e consensus tracking problem for multi-agent systems (MASs) under dynamic directed topologies can be solvable if the topology average dll time satisfies a certain switching condition. Finally, a network system of F-18 aircraft is given as an example to verify the effectiveness of the proposed design method."}]