...
首页> 外文期刊>Neurocomputing >Optimal consensus of a class of discrete-time linear multi-agent systems via value iteration with guaranteed admissibility
【24h】

Optimal consensus of a class of discrete-time linear multi-agent systems via value iteration with guaranteed admissibility

机译:Optimal consensus of a class of discrete-time linear multi-agent systems via value iteration with guaranteed admissibility

获取原文
获取原文并翻译 | 示例
           

摘要

This paper investigates the optimal consensus problem for heterogeneous discrete-time(DT) linear multi-agent systems. The optimal consensus problem is formulated as finding a global Nash equilibrium solution subjected to the defined local performance index. A reinforcement learning(RL) value iteration (VI) algorithm is introduced to obtain the optimal policies in the sense of Nash equilibrium. To ensure the effectiveness of the VI algorithm, the admissibility of the iterative control policies for multi-agent sys-tems is considered. With theoretical analysis, a new termination criterion is established to guarantee the admissibility of the iterative control policies. Furthermore, an online learning framework is designed with an actor-critic neural network(NN) to implement the VI algorithm. Finally, two simulation examples are presented respectively for leader-follower and leaderless multi-agent systems to verify the effectiveness of the proposed method.(c) 2022 Elsevier B.V. All rights reserved.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号