摘要
We consider multi-agent systems with time-varying delays and switching interconnection topologies. By con- structing a suitable Lyapunov-Krasovskii functional and using the reciprocally convex approach, new delay-dependent consensus criteria for the systems are established in terms of linear matrix inequalities （LMIs）, which can be easily solved by using various effective optimization algorithms. Two numerical examples are given to illustrate the effectiveness of the proposed methods.
We consider multi-agent systems with time-varying delays and switching interconnection topologies. By con- structing a suitable Lyapunov-Krasovskii functional and using the reciprocally convex approach, new delay-dependent consensus criteria for the systems are established in terms of linear matrix inequalities （LMIs）, which can be easily solved by using various effective optimization algorithms. Two numerical examples are given to illustrate the effectiveness of the proposed methods.
基金
Project supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF)
the Ministry of Education,Science and Technology,Korean (Grant Nos. 2012-0000479 and 2011-0009273)
the Korea Healthcare Technology R & D Project,Ministry of Health & Welfare,Republic of Korea (Grant No. A100054)
