PlumX Metrics
Embed PlumX Metrics

Optimal antisynchronization control for unknown multiagent systems with deep deterministic policy gradient approach

Information Sciences, ISSN: 0020-0255, Vol: 622, Page: 946-961
2023
  • 7
    Citations
  • 0
    Usage
  • 4
    Captures
  • 1
    Mentions
  • 0
    Social Media
Metric Options:   Counts1 Year3 Year

Metrics Details

  • Citations
    7
  • Captures
    4
  • Mentions
    1
    • News Mentions
      1
      • 1

Most Recent News

Researchers at Chongqing University of Posts and Telecommunications Have Reported New Data on Mathematics (Optimal Antisynchronization Control for Unknown Multiagent Systems With Deep Deterministic Policy Gradient Approach)

2023 APR 04 (NewsRx) -- By a News Reporter-Staff News Editor at Math Daily News -- Research findings on Mathematics are discussed in a new

Article Description

The topic of optimal antisynchronization control for unknown multiagent systems (MASs) with cooperative-competitive (i.e.,coopetition) interaction is challenging because of the complex connection characteristics and the coupling among agents. This paper proposes a reinforcement learning Algorithm based on coopetition strength (CS) to achieve optimal antisynchronization in unknown MASs. Firstly, an innovative CS function is explored, and the local state error information of the agents can be redefined. Furthermore, we propose a novel strategy iteration method to approximate the agent’s optimal control policy. Meanwhile, the proposed algorithm’s convergence analysis is presented, which is based on the Lyapunov stability and functional theorem. In the implementation of a data-based control policy, a network structure of actor-critic (AC) is designed. To improve the robustness of the control policy, the target network and experience replay (ER) are introduced in the training process. Finally, the algorithm’s effectiveness is validated using comparable numerical simulations.

Provide Feedback

Have ideas for a new metric? Would you like to see something else here?Let us know