海洋自主航行器多海湾区域完全遍历路径规划

Complete coverage path planning for autonomous marine vehicle used in multi-bay areas

海洋自主航行器在对海底地形测绘和水文信息搜集过程中,简单锯齿形完全遍历路径规划算法对多海湾海底地形探测易出现重复区域和遗漏区域的问题。本文提出了遗漏海湾和重复海湾及其进入点、退出点和门户的路径规划环境表达概念,并将其应用在基于行为的锯齿形完全遍历路径规划改进算法中,有效地减少了海洋自主航行器全覆盖地形测绘的重复区域和遗漏区域。在网格化定常流场海域内,对某一阻力特性已知的自主水下机器人进行了完全遍历路径规划仿真,验证了基于重复和遗漏海湾搜索行为的完全遍历路径规划算法的遍历性和不重复性,并降低了区域全覆盖地形测绘任务的耗能。最终,通过小型无人艇湖试验证了算法在完全遍历路径规划中的节能性和实用性。

When using autonomous marine vehicles (AMVs) collecting seabed or hydrologicaldata, the algorithm of simple zigzag complete traversal path planning easily leads to repeated search regions and missed search regions in multi-bay ocean environment. This paper presents the environment expression concepts of repeated bay and missed bay with their points of entry, exit, and gateway. By modifying the simple zigzag complete traversal path planning algorithm using repeated-bay searching behavior and missed-bay searching behavior based on the those environment expression concepts, the new algorithm effectively reduces the area of the repeated search regions and the missed search regions for AMVs in complete traversal tasks. The efficiency and low energy consumption of the modified algorithms were tested for complete traversal path planning by computer simulation, which simulated an autonomous underwater vehicle (AUV) with known resistance characteristic in a gridding search area with a constant current velocity and flow distribution. Finally, the energy saving property and practicability of the modified algorithm were tested for complete traversal path planning on an unmanned surface vehicle (USV) in the lake.