澳门新葡平台网址8883入口机器人与信息自动化研究所 天津市智能机器人技术重点实验室
Institute of Robotics and Automatic Information System

Tianjin Key Laboratory of Intelligent Robotics
 2017年秋季先进机器人与MEMS技术系列学术讲座 (第98期)
Seminar Series：Advanced Robotics & MEMS

题目：Consensus Control over Time-Varying Graphs
时间： 10月17日 9:30
地点： 计控楼329室
报告人：Guoxiang Gu(顾国祥)
研究方向：System identification and model validation for robust control; Modeling and control of nonlinear uncertain systems with industrial applications; Nonlinear bifurcations and compressor control for aeroengines; Digital signal processing and wireless data communications
单位：Louisiana State University,路易斯安那州立大学
简介：Guoxiang Gu received the Ph.D. degree in electrical engineering from the University of Minnesota, Minneapolis, in 1988. From 1988 to 1990, he was with the Department of Electrical Engineering, Wright State University, Dayton, Ohio, as a Visiting Assistant Professor. Since 1990, he joined Louisiana State University (LSU), Baton Rouge, where he is currently a Professor of Electrical and Computer Engineering. His research interests include networked control systems, system identification, and statistical signal processing. He authored two books, and published over 70 archive journal papers, plus numerous book chapters, and conference papers. He has held visiting positions at Wright-Patterson Air Force Base, in Hong Kong University of Science and Technology, and in Southwest Jiaotong University of P.R. China. He served as an associate editor for the IEEE Transactions on Automatic Control from 1999 to 2001, SIAM Journal on Control and Optimization from 2006 to 2009, and Automatica from 2006 to 2012, and will serve again as an associate editor for IEEE Transactions on Automatic Control from 2018-2010. He is presently the F. Hugh Coughlin/CLECO distinguished professor of electrical engineering at LSU, and Fellow of IEEE.
内容简介：
We study state consensus control over time-varying graphs for discrete-time multi-agent systems. The agent dynamics are assumed to have poles only on the unit circle and time-varying graphs can be directed, assumed to satisfy an inequality condition, and be uniformly connected. It will be shown that the state consensus can be achieved asymptotically under some mild conditions. Our results are illustrated by two numerical examples.