首页  |  English  |  中国科学院
  • 学术报告
多个体系统能控性的图论刻画
主讲:纪志坚
举办时间:2016.1.28;10:00am    地点:N514
摘 要:Recently, graphical characterization of multi-agent controllability has been studied extensively. A major effort in the study is to determine controllability directly from topology structures of communication graphs. In the presentation, we proposed the concept of controllability destructive nodes, which indicates that the difficulty in graphical characterization turns out to be the identification of topology structures of controllability destructive nodes. It is shown that each kind of double and triple controllability destructive nodes happens to have a uniform topology structure which can be defined similarly. The definition, however, is verified not to be applicable to the topology structures of quadruple controllability destructive (QCD) nodes. Even so, a design method is proposed to uncover topology structures of QCD nodes for graphs with any size, and a complete graphical characterization is presented for the graphs consisting of five vertices. One advantage of the established complete graphical characterization is that the controllability of any graph with any selection of leaders can be determined directly from the identified/defined destructive topology structures. The results generate several necessary and sufficient graphical conditions for controllability. A key step of arriving at these results is the discovery of a relationship between the topology structure of the controllability destructive nodes and a corresponding eigenvector of the Laplacian matrix. In addition, for multi-agent systems with each node containing generic linear dynamics, a neighbor-based control protocol is proposed, under which it is shown that the controllability of a multi-agent system is solely decided by its communication topology structure. We then further consider the effects of communication topology on the controllability from a graph theory point of view by explicitly constructing topologies. The construction exhibits a partition of the designed graph with identified leaders under which the system is shown to be uncontrollable.
 
简 介:

纪志坚, 男, 19736月生,博士教授博士生导师山东省杰出青年科学基金获得者山东省有突出贡献的中青年专家。1998年硕士毕业于中国海洋大学,2005年博士毕业于北京大学。先后出访过加拿大阿尔伯塔大学、美国圣母大学、英国布鲁内耳大学、香港城市大学、新加坡国立大学等国内外知名高校。是中国自动化学会控制理论专业委员会委员国家自然科学基金的特约评审员是首界国家优秀青年基金的会议评审专家。研究方向为多智能体网络系统、多机器人系统的分布式协调控制复杂网络的分析与控制等。是国内外二十多个期刊及会议的编委和审稿人,获得了国际控制界权威期刊《IEEE Transactions on Automatic Control》授予的2012年杰出审稿人称号,2006年入围中国控制界的重要奖项《关肇直奖》。 

主持国家自然科学基金三项,山东省杰出青年基金一项。以第二负责人的身份与他人合作主持国家自然科学基金一项、山东省自然科学基金二项、博士后基金二项、横向项目三项。以第一位次先后获得山东省自然科学奖三等奖一项、山东省高等学校优秀科研成果奖一等奖一项、三等奖二项;两次获得青岛大学优秀研究生指导教师称号、一次教育先锋称号。指导研究生获得全国机器鱼比赛的一等奖等多个奖项。
 
 
 
附件下载:
中国科学院系统科学研究所 2013 版权所有 京ICP备05002810号-1
北京市海淀区中关村东路55号 邮政编码:100190, 中国科学院系统科学研究所
电话:86-10-82541881  网址:http://iss.amss.cas.cn/