Answers are grounded in this paper and cite their sources.
Explores optimal control in multiagent systems, suggesting effective strategies for consensus.
This paper investigates the problem of optimal consensus control for continuous-time multiagent systems (MASs). The agent dynamics and control performance are thoroughly considered to formulate the problem into a differential graphical game. The minmax strategy is introduced as an alternative to the Nash equilibrium (NE) solution, providing distributed solutions in the presence of worst-case neighbour controls. Then, two distinct event-driven adaptive dynamic programming (ADP) methods are introduced to approximate the value function and optimal control policies in real time with single critic neural network (NN) structure. The corresponding event-triggering conditions are derived from the Lyapunov function, grounded in guaranteeing the uniformly ultimately bounded (UUB) of the weight estimation errors and local consensus error systems. Under the event-driven scheme, NN weights are updated solely at event-triggered instants determined by the event-triggering condition, exhibiting a non-periodic manner that conserves computational resources. Finally, numerical simulations are presented to validate the efficacy of the proposed methods.
No takes yet. Share an insight, caveat, or question.
Chen et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: