Cooperative Control of Multi-Time-Scale Agent Networks Under Digraphs

Abstract

This paper addresses cooperative control for a class of multi-agent networks. An interesting feature of such network is that each agent possesses the characteristic of multi-time-scale. By developing the relative states or the relative outputs based consensus protocols, some well-conditioned consensus criteria in terms of linear matrix inequalities are derived successively based on the $\varepsilon $ -strict Lyapunov function. Compared with undirected graphs or strongly connected digraphs in existing works, a more general digraph that it contains at least a directed spanning tree is considered herein. Moreover, a fully distributed consensus protocol with time-varying coupling strength is proposed to avoid using global information. Finally, the obtained theoretical results are validated by two examples including standard and nonstandard agents.

Keywords

• Consensus
• directed graph
• fully distributed protocol
• multi-time-scale feature
• strict Lyapunov function