Leader–Follower Formation Reconfiguration Control for Fixed-Wing UAVs Using Multiplayer Stackelberg–Nash Game
For the formation reconfiguration of fixed-wing unmanned aerial vehicles (UAVs), a hierarchical control decision-making method considering both convergence and optimality is studied. To begin with, the dynamic model of the fixed-wing UAVs is established, and the formation reconfiguration control pro...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-06-01
|
| Series: | Drones |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2504-446X/9/6/439 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | For the formation reconfiguration of fixed-wing unmanned aerial vehicles (UAVs), a hierarchical control decision-making method considering both convergence and optimality is studied. To begin with, the dynamic model of the fixed-wing UAVs is established, and the formation reconfiguration control problem formally constructed. Subsequently, based on information such as the initial positions of the UAVs and the expected geometric configuration, an integer programming issue is formulated to determine the destinations of the UAVs. After completing the aforementioned preparations, by incorporating the concept of hierarchical games, the formation guidance and control problem is consequently reformulated as a multiplayer Stackelberg–Nash game (SNG). Through rigorous analysis, the optimality of using the Stackelberg–Nash equilibrium solution as the UAV control commands was demonstrated. Furthermore, a novel policy iteration (PI) algorithm for solving this equilibrium based on fixed-point iteration is proposed. To guarantee the accurate execution of the control commands, an auxiliary control system is designed, thereby forming a closed-loop real-time control decision-making mechanism. The numerical simulation results illustrate that the UAVs can rapidly switch to the desired formation configuration, thus validating the effectiveness of the proposed method. |
|---|---|
| ISSN: | 2504-446X |