博彩公司-真人在线博彩公司大全_百家乐园首选去澳_全讯网赢足一世 (中国)·官方网站

網站頁面已加載完成

由于您當前的瀏覽器版本過低,存在安全隱患。建議您盡快更新,以便獲取更好的體驗。推薦使用最新版Chrome、Firefox、Opera、Edge

Chrome

Firefox

Opera

Edge

ENG

當前位置: 首頁 · 學術交流 · 正文

學術交流

【學術講座】荷蘭格羅寧根大學曹明教授學術講座通知

發布時間:2017年08月14日 來源: 點擊數:

報告題目:不相容測量誤差下的移動機器人編隊控制、網絡演化博弈的最優控制

報告人:曹明教授

報告時間:

8月18日 上午8:30-10:00

《Controlling formations of mobile robots under inconsistent measurements》

(不相容測量誤差下的移動機器人編隊控制)

8月18日 下午15:30-17:00

《Towards Optimal Control of Evolutionary Games on Networks》

(網絡演化博弈的最優控制)。

報告地點:航海學院主樓201會議室

承辦學院:航海學院

報告簡介:

Talk 1:

Title: Controlling formations of mobile robots under inconsistent measurements

Abstract: Teams of autonomous robots that work cooperatively are used more and more widely for a range of robotic tasks such as environmental monitoring and coordinated transportation. Robots have been deployed in formations with different shapes in order to facilitate the adaptive sampling of an unknown environment or to achieve better cooperation efficiency. As a result, considerable research efforts have been made in the past few years on designing distributed control laws to stabilize the shapes of formations of autonomous robots. In particular, within the research area of developing cooperative control theory for multi-agent systems, a sequence of theoretical investigations have been made to design formation control laws using the notion of graph rigidity, and such control laws are usually based on the gradients of the potential functions. However, it has been recently reported that for such gradient control laws, if agents disagree with their neighboring peers on the measured or prescribed distances between them, undesirable formation motion might appear. In this talk, I will demonstrate how local estimators can be exploited to stabilize robotic formations even under inconsistent measurements.

Talk 2:

Title: Towards Optimal Control of Evolutionary Games on Networks

Abstract: We investigate the control of evolutionary games on networks, in which each edge represents a two-player repeated game between neighboring agents. After each round of games, agents can update their strategies based on local payoff and strategy information, while a subset of agents can be assigned strategies and thus serve as control inputs. We seek here the smallest set of control agents needed to drive the network to a desired strategy state. After presenting an exact solution that is practical only for small networks due to its computational complexity, we design a fast algorithm for approximating the solution to a simplified problem on tree networks. We then show how to extend this approach to the general problem on arbitrary networks using a weighted minimum spanning tree and strategy propagation algorithm. We show that the resulting approximation is exact for certain classes of games on complete, ring, and star networks. Finally, simulations demonstrate that the algorithm yields near-optimal solutions for a wide range of cases.

報告人簡介:

曹明教授

Short Biography:

Ming Cao is currently chair professor of networks and robotics with the Engineering and Technology Institute (ENTEG) at the University of Groningen, the Netherlands, where he started as a tenure-track assistant professor in 2008. He received the Bachelor degree in 1999 and the Master degree in 2002 from Tsinghua University, Beijing, China, and the PhD degree in 2007 from Yale University, New Haven, CT, USA, all in electrical engineering. From September 2007 to August 2008, he was a postdoctoral research associate with the Department of Mechanical and Aerospace Engineering at Princeton University, Princeton, NJ, USA. He worked as a research intern during the summer of 2006 with the Mathematical Sciences Department at the IBM T. J. Watson Research Center, NY, USA. He is the 2017 and inaugural recipient of the Manfred Thoma Medal from the International Federation of Automatic Control (IFAC) for his outstanding contribution to the field of systems and control as a young researcher under 40 years old. He is the 2016 recipient of the European Control Award sponsored by the European Control Association (EUCA) for his fundamental contributions to distributed and cooperative control of multi-agent systems and complex networks. He is an associate editor for IEEE Transactions on Automatic Control, IEEE Transactions on Circuits and Systems and Systems and Control Letters. He is also a member of the IFAC Technical Committee on Networked Systems. His main research interest is in autonomous agents and multi-agent systems, mobile sensor networks and complex networks.

澳门百家乐娱乐城送体验金| 百家乐外挂程式| 大佬百家乐官网的玩法技巧和规则 | 大发888真钱游戏注册| 利来网站| 澳门百家乐官网玩法| 威尼斯人娱乐网注册送38元彩金| 大发888真人游戏| 澳门百家乐官网必胜看路| 宾利百家乐游戏| 大发888娱乐城官网| 太阳城百家乐官网群| 百家乐官网娱乐网77scs| 百家乐澳门路规则算法| 中华德州扑克论坛| 大佬百家乐官网现金网| 澳门百家乐官网娱乐场开户注册 | 大发888 打法888 大发官网| 哪个百家乐官网玩法平台信誉好| 百家乐官网园试玩| 大发888游戏网址| 游戏厅百家乐官网软件| 百家乐是咋玩法| 众发国际娱乐| 百家乐赌博网址| 百家乐官网新注册送彩金| 百家乐乐百家娱乐场| 百家乐官网和抽水官网| 大发888我发财官网| 百家乐官网技巧下载| 百家乐是真人发牌吗| 太阳城百家乐官网怎样开户| 大发888客户端de 软件| 百家乐官网娱乐网77scs| 百家乐官网会骗人吗| 大佬百家乐娱乐城| 大发百家乐现金网| 忻州市| 百家乐最新的投注方法| 百家乐官网视频桌球| 百家乐官网平台哪个比较安全|