.png){kind=icon}
.png){kind=icon}
Return
Distributed Time-Varying Nash Equilibrium Searching for Nonlinear Placement of Multicluster Autonomous Aerial Vehicle Formations
.png){kind=icon}
PRE
AI
T
Y
Y
L
DOI：10.1109/tcns.2026.3673624.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This article investigates the nonlinear placement problem for multicluster autonomous aerial vehicles (AAVs) formations. The AAVs in each cluster are positioned to achieve the target configuration while minimizing the sum of the squares Euclidean space distances between each center and its corresponding members of the cluster. The problem is reformulated as a time-varying noncooperative game. First, considering the external disturbances of AAVs, a fast terminal sliding mode observer is developed to estimate the disturbance, and the convergence of the observer is proved by the Lyapunov stability theorem. Then, to search Nash equilibrium for the time-varying noncooperative game problems, a distributed algorithm based on an adaptive connectivity maintenance mechanism and gradient descent method is designed. The algorithm achieves asymptotic convergence for Nash equilibrium, which is proved by means of an iterative approach. Finally, the algorithm’s effectiveness is demonstrated through a simulation example.
Keywords:
Autonomous aerial vehicles
distributed algorithm
Nash equilibrium (NE) searching
nonlinear placement
Journal
IF:
5
Papers:
1.6K
Citations:
5.8K
Organization
Cited Papers