Accelerated finite-time surrounding control for multiple moving targets
Le Zhao
Electronic Research Archive ›› 2026, Vol. 34 ›› Issue (12) : 9138 -9168.
Finite-time surrounding control possesses superior performance in terms of tracking accuracy and rapidity. Nevertheless, most existing finite-time surrounding algorithms are only applicable to integrator systems, restricted to single-target scenarios, and fail to maintain rapid dynamic responses throughout the entire convergence process. To address these limitations, this paper extends the framework to multiple moving targets and generalizes integrators to nonlinear systems with unknown control coefficients. Meanwhile, an accelerated distributed control scheme is developed to improve the convergence performance of each agent throughout the entire process. Specifically, dynamic high-gain distributed observers are constructed for each follower, which achieve target state estimation merely using local relative information. Combined with adaptive techniques, a novel accelerated distributed surrounding protocol based on high-gain is proposed, which realizes finite- time multi-target encirclement and significantly improves global convergence rapidity compared with existing finite-time strategies. The embedded dynamic high-gain mechanism effectively compensates the unknown control coefficients while strictly preserving the fully distributed feature of the protocol, which guarantees strong operational robustness. Numerical simulations further verify the feasibility and effectiveness of the developed control scheme, demonstrating its promising application potential in practical multi-agent cooperative surrounding missions.
multi-agent systems / accelerated finite-time surrounding / multiple moving targets / distributed protocol / adaptive technique
| [1] |
|
| [2] |
|
| [3] |
|
| [4] |
|
| [5] |
|
| [6] |
|
| [7] |
|
| [8] |
|
| [9] |
|
| [10] |
|
| [11] |
|
| [12] |
|
| [13] |
|
| [14] |
|
| [15] |
|
| [16] |
|
| [17] |
|
| [18] |
|
| [19] |
|
| [20] |
|
| [21] |
|
| [22] |
|
| [23] |
|
| [24] |
|
| [25] |
|
| [26] |
|
| [27] |
|
| [28] |
|
| [29] |
|
| [30] |
|
| [31] |
|
| [32] |
|
| [33] |
|
/
| 〈 |
|
〉 |