Certainty Equivalent Principle and Cooperative Control of Multi-agent Systems

来源 :第八届工业与应用数学国际大会 | 被引量 : 0次 | 上传用户:yuhuipin1
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  In this talk,we will present a unified framework for handling several cooperative control problems of multi-agent systems such as consensus,formation,flocking,and rendezvous by distributed control laws.Based on the certainty equivalent principle,the distributed control law will be synthesized by combining a purely decentralized control law and a distributed observer.The approach works for linear multi-agent systems and some typical nonlinear multi-agent systems such as multiple Euler-Lagrange systems and multiple rigid-body systems.
其他文献
  We show that constant-depth polynomial-size exact quantum circuits with unbounded fan-out gates,called QNCof circuits,are powerful.More concretely,we first
会议
  We provide a strong evidence for strong monogamy inequality of multi-qubit entanglement.We consider a large class of multi-qubit generalized W-class states,
会议
  We consider robust optimization techniques for PDE-constrained problems involving uncertain parameters.The parameters are assumed to be contained in a given
会议
  Quantum information science and technology is a new multidisciplinary research field among mathematics,physics,computer science and engineering.This minisym
会议
  Alternating directions method of multipliers(ADMM)is recognized as a powerful approach for the structured convex optimization with two separable operators.W
会议
  We present a proximal gradient method to solve the ensemble density functional theory(EDFT)model for electronic structure calculations.The EDFT model is esp
会议
  We present a limited memory steepest descent method for solving large-scale optimization problems.Building off of well-known Barzilai-Borwein methods and a
会议
  In this talk,a constrained consensus problem is studied for multiagent systems in unbalanced networks in the presence of communication delays.Here each agen
会议
  A vector space structure of the set of finite non-cooperative games is proposed.By providing bases of the subspace of potential games and the subspace of no
会议
  The price of anarchy(POA)quantifies the efficiency losses of dynamic networks due to selfish behaviors.We consider a repeated noncooperative congestion game
会议