Multiautonomous underwater vehicle consistent collaborative hunting method based on generative adversarial network. (25th June 2020)

• Record Type: Journal Article
• Authors: Cai, Lei; Sun, Qiankun
• Is Part Of: International journal of advanced robotic systems. Volume 17:Number 3(2020:May/Jun.)
• Publication Date: 2020-06-25
• Subjects: Multi-AUV system -- generative adversarial network -- cooperative hunting -- time-varying ocean currents -- communication delay; Robotics -- Periodicals; Robotics; Periodicals; 629.892
• DOI: 10.1177/1729881420925233
• Languages: English
• ISSNs: 1729-8806

Abstract

The time-varying ocean currents and the delay of underwater acoustic communication have caused the uncertainty of single autonomous underwater vehicle (AUV) tracking target and the inconsistency of multi-AUV coordination, which make it difficult for multiple AUVs to form a hunting alliance. To solve the above problems, this article proposes the multi-AUV consistent collaborative hunting method based on generative adversarial network (GAN). Firstly, the three-dimensional (3D) kinematic model of AUV is established for the underwater 3D environment. Secondly, combined with the Laplacian matrix, the topology of the hunting alliance in the ideal environment is established, and the control rate of AUV is calculated. Finally, using the GAN network model, the control relationship after environmental interference is used as the input of the generative model. The control rate in the ideal environment is used as the comparison object of the discriminative model. Using the iterative training of GAN to generate a control rate that adapts to the current interference environment and combining multi-AUV topological hunting model to achieve successful hunting of noncooperative target, the experimental results show that the algorithm reduces the average hunting time to 62.53 s and the success rate of hunting is increased to 84.69%, which is 1.17% higher than the particle swarm optimization-constant modulus algorithm (PSO-CMA) algorithm.