基于有向图的信息拓扑独立的二阶系统一致性判据(英文)  

Information Topology-independent Consensus Criteria for Second-order Systems under Directed Graph

作　　者：CAO Xi-Bin GUO Hai-Bo ZHANG Shi-Jie 

机构地区：[1]Research Center of Satellite Technology,Harbin Institute of Technology

出　　处：《自动化学报》2013年第7期995-1002,共8页Acta Automatica Sinica

基　　金：Supported by National Natural Science Foundation of China(60904051);Royal Academy of Engineering-Research Exchanges with China and India Awards

摘　　要：In this paper,consensus seeking of second-order systems without leaders is investigated under possibly switching directed graphs.Two consensus algorithms using different cooperative schemes are proposed and some information topology-independent criteria are obtained.For the first one,an eigenvalue-based analysis is taken to attain a sufficient and necessary condition for consensus seeking under fixed directed graph.For the second one,consensus can be achieved as long as the union of the switching graphs has a directed spanning tree frequently enough.Convergence analysis is presented,which is facilitated by an equivalent model transformation into a cascaded system.A novel sufficient and necessary condition for consensus seeking under switching undirected graph is also obtained using the same strategy.Moreover,robustness of both the algorithms to time-delays is studied under fixed directed graph.Illustrative examples are also provided to show the effectiveness of the theoretical results.In this paper,consensus seeking of second-order systems without leaders is investigated under possibly switching directed graphs.Two consensus algorithms using different cooperative schemes are proposed and some information topology-independent criteria are obtained.For the first one,an eigenvalue-based analysis is taken to attain a sufficient and necessary condition for consensus seeking under fixed directed graph.For the second one,consensus can be achieved as long as the union of the switching graphs has a directed spanning tree frequently enough.Convergence analysis is presented,which is facilitated by an equivalent model transformation into a cascaded system.A novel sufficient and necessary condition for consensus seeking under switching undirected graph is also obtained using the same strategy.Moreover,robustness of both the algorithms to time-delays is studied under fixed directed graph.Illustrative examples are also provided to show the effectiveness of the theoretical results.

关 键 词：二阶系统 标准 拓扑 信息 充分必要条件 特征值分析 收敛性分析 合作计划 

分 类 号：O157.5[理学—数学] O189[理学—基础数学]