水面无人艇因其成本低、速度快、体积小、运动灵活等优势，在军用和民用领域应用日益广泛，如何提高多无人艇在大范围水域协同警戒执行效率已成为该领域的研究重点。本文提出基于人工势场的多无人艇分布式算法，为多无人艇大区域巡逻警戒与跟踪监视问题提出解决方案，降低了无人艇受损后对任务执行产生的不利影响，也为多无人艇大范围水域灵活部署以及任务执行效率提高等应用提供参考。
Unmanned surface vehicle (USV) is now widely applied in the military and civil field for its advantages in low cost, high velocity, small volume and flexible movement. How to increase the execution efficiency of cooperative alert task is a focused issue. In this article, the author proposes a new multi-USV distributed algorithm based on artificial potential field, which brings forward a solution for the USVs' patrol, tracking, surveillance and guard in broad water areas. By applying the distributed algorithm in the multi-USV cooperative regional alert, the impact can be reduced when some of the USVs are damaged. The distributed algorithm provides a reference for the flexible deployment of multi-USV in broad water areas and can improve the task execution efficiency.
2022,44(7): 74-77 收稿日期：2021-11-17
DOI：10.3404/j.issn.1672-7649.2022.07.014
分类号：TP391
作者简介：赵海彬(2021-),男,本科,研究方向为环境工程
参考文献：
[1] LI M, CHENG W, LIU K, et al. Sweep coverage with mobile sensors[J]. IEEE Transactions on Mobile Computing, 2011, 10(11): 1534–1545
[2] GORAIN B, MANDAL PS. Approximation algorithm for sweep coverage on graph[J]. Information Processing Letters, 2015, 115(9): 712–718
[3] LIU C, DU H, YE Q. Sweep coverage with return time constraint[C]//2016 IEEE Global Communications Conference, 2016: 1–6.
[4] LARSON J, BRUCH M, EBKEN J. Autonomous navigation and obstacle avoidance for unmanned surface vehicles[C]//Proc eedings SPIE, 2006: 1–12.
[5] LIU Y and BUCKNALL R. Path planning algorithm for unmanned surface vehicle formations in a practical maritime environment[C]//Ocean Engineering, 2015(97): 126–144.
[6] NIU H, LU Y, SAVVARIS A, et al. Efficient path planning algorithms for unmanned surface vehicle[J]. IFAC-Papers On Line, 2016, 49(23) : 121–126.
[7] 闫军涛, 李御驰, 宋志华, 等. 基于改进人工势场方法的无人机覆盖航路规划算法研究[J]. 运筹与模糊学, 2019, 9(4): 264–270
[8] 王金龙, 无人艇航路规划的算法研究[D]. 长春: 吉林大学, 2019.
