No abstract

The consensus optimal control problem for a class of linear multi-agent systems with directed communication networks is studied in this paper using adaptive dynamic programming. To overcome the restrictions of the agent's low processing capability and to extend the actuator's lifetime, consider the event-triggered. In the beginning, a dynamic event-triggered is provided, with several existing static event-triggered serving as special examples. When using the dynamic event-triggered, a longer interval can be shown between any two consecutive event-triggered. Designing a dynamic event-triggered control law becomes more challenging when implemented in directed networks. In addition, on the basis of dynamic event-triggered, a novel adaptive dynamic programming is used to construct a suitable dynamic event-triggered control law, which employs just the interaction information between agents and does not need model dynamics, overcoming the difficulty of solving the algebraic Riccati equation. Finally, the effectiveness of the proposed method is verified by simulation results, and no agent exhibits Zeno behavior.

The purpose of this paper is to utilize adaptive dynamic programming to solve an optimal consensus problem for double-integrator multi-agent systems with completely unknown dynamics. In double-integrator multi-agent systems, flocking algorithms that neglect agents’ inertial effect can cause unstable group behavior. Despite the fact that an inertias-independent protocol exists, the design of its control law is decided by dynamics and inertia. However, inertia in reality is difficult to measure accurately, therefore, the control gain in the consensus protocol was solved by developing adaptive dynamic programming to enable the double-integrator systems to ensure the consensus of the agents in the presence of entirely unknown dynamics. Firstly, we demonstrate in a typical example how flocking algorithms that ignore the inertial effect of agents can lead to unstable group behavior. And even though the protocol is independent of inertia, the control gain depends quite strongly on the inertia and dynamic of the agent. Then, to address these shortcomings, an online policy iteration-based adaptive dynamic programming is designed to tackle the challenge of double-integrator multi-agent systems without dynamics. Finally, simulation results are shown to prove how effective the proposed approach is.

The purpose of this article is to utilize adaptive dynamic programming to solve an optimal consensus problem for double‐integrator multiagent systems with completely unknown dynamics. In double‐integrator multiagent systems, flocking algorithms that neglect agents' inertial effect can cause unstable group behavior. Despite the fact that an inertias‐independent protocol exists, the design of its control law is decided by dynamics and inertia. However, inertia in reality is difficult to measure accurately, therefore, the control gain in the consensus protocol was solved by developing adaptive dynamic programming to enable the double‐integrator systems to ensure the consensus of the agents in the presence of entirely unknown dynamics. Firstly, we demonstrate in a typical example how flocking algorithms that ignore the inertial effect of agents can lead to unstable group behavior. And even though the protocol is independent of inertia, the control gain depends quite strongly on the inertia and dynamic of the agent. Then, to address these shortcomings, an online policy iteration‐based adaptive dynamic programming is designed to tackle the challenge of double‐integrator multiagent systems without dynamics. Finally, simulation results are shown to prove how effective the proposed approach is.