学术报告第201516期

报告题目：Decentralised  minimum-time consensus（IEEE  控制系统学会武汉分会系列报告）

报告人:   袁烨博士（剑桥大学 达尔文学院）

报告地点：南一楼  中311室

报告时间：2015年4月14日上午10：00

Abstract：

Fuelled  by applications in a variety of fields, there has been a recent surge of  interest in consensus dynamics. This talk considers the discrete-time dynamics  of a network of agents that exchange information according to the nearest-  neighbour protocol under which all agents are guaranteed to reach consensus  asymptotically. We present a fully decentralised algorithm that allows any agent  to compute the consensus value of the whole network in finite time using only  the minimum number of successive values of its own state history.  Furthermore, we shall show other potential applications for this newly proposed  algorithm, e.g., how to apply this algorithm to Google pagerank computation.

Speaker’s  Short Bio:

Ye  Yuan received  his B.Eng. degree (Valedictorian) from the Department of Automation, Shanghai  Jiao Tong University in 9.2008 under the supervision of Prof. Yugeng Xi, M.  Phil. and Ph.D. from the Department of Engineering, Cambridge University under  the supervision of Prof. Jorge Goncalves in 10.2009 and 2.2012 respectively. He  is now a Research Fellow in Darwin College, University of Cambridge and has been  holding visiting researcher positions in Caltech (2011, 2014, 2015), MIT (2013)  and Imperial College London (2011-2015).

His  research interests include the unification system identification and machine  learning with applications to natural and engineering systems. He is the  recipient of Dorothy Hodgkin Postgraduate Awards, Microsoft Research PhD  Scholarship, Cambridge Overseas Scholarship, Chinese Government Award for  Outstanding Students Abroad and Henry Lester Scholarship, Best Paper Finalist in  IEEE ICIA.