Hunting Task Allocation for Heterogeneous Multi-AUV Formation Target Hunting in IoUT: A Game Theoretic Approach
As one of the important tools for exploring the ocean, multiple Autonomous Underwater Vehicles (multi-AUV) system can complete complex tasks in complex Internet of underwater Things. Collaborative target search, as a typical application of multiple AUV systems, has been applied in the fields of terr...
Gespeichert in:
Veröffentlicht in: | IEEE internet of things journal 2024-03, Vol.11 (5), p.1-1 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | As one of the important tools for exploring the ocean, multiple Autonomous Underwater Vehicles (multi-AUV) system can complete complex tasks in complex Internet of underwater Things. Collaborative target search, as a typical application of multiple AUV systems, has been applied in the fields of territorial sea security and marine biology research. Among them, hunting task allocation is a key issue determining the effective application of multiple AUV systems. Therefore, this paper proposes a hunting task assignment framework based on Contract Network (CN) to assign hunting tasks. In the investigated framework, the Tenderee AUV (TAUV in short) is responsible for setting the task reward and assigning hunting tasks, while Bidder AUVs (BAUVs in short) set the working time as bidding information. Combining the mobile energy consumption and communication energy consumption of hunter AUVs, we establish the revenue optimization model of BAUVs and the TAUV. Based on the above model, we model the interaction process of hunting task allocation process between BAUVs and the TAUV as a Stackelberg game, and use the backward induction method to prove that there is a unique Stackelberg Equilibrium (SE in short) in the game. In addition, this paper proposes a Strategy Search Algorithm based on Steepest Descent Method (SSA_SDM) to obtain the optimal strategy of BAUVs and the TAUV, which can achieve SE. Finally, experimental results show that SSA_SDM can reach the SE and outperform other algorithms. |
---|---|
ISSN: | 2327-4662 2327-4662 |
DOI: | 10.1109/JIOT.2023.3322197 |