An Unmanned Vessel Path Planning Method for Floating-Waste Cleaning Based on an Improved Ant Colony Algorithm

• Published in: Journal of marine science and engineering Vol. 13; no. 8; p. 1579
• Main Authors: Li, Yong, Tang, Changjun, Yan, Sen, Wang, Ruichen, Gao, Dongxu
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.08.2025
• Subjects: Algorithms; Analysis; Ant colony optimization; ant colony optimization (ACO) algorithm; Cleaning; Datasets; Decision making; Efficiency; Floating; floating-waste collection; Genetic algorithms; Geospatial data; Heuristic; Inland waters; Iran; Management science; Methods; Modules; Optimization; Path planning; Pheromones; Sensors; Surface vehicles; Tracking; Travel; Traveling salesman problem; unmanned surface vessel; Unmanned vehicles; Water governance; Iran
• ISSN: 2077-1312; 2077-1312
• DOI: 10.3390/jmse13081579

Efficient cleaning of floating waste using an intelligent unmanned surface vehicle is an important development trend in inland water governance. Path planning is the core of the decision-making module for unmanned surface vehicle waste cleaning and is key to achieving autonomous operation of the unmanned surface vehicle. However, due to the complexity and dynamic changes of the water surface environment, unmanned surface vehicle path planning methods for floating waste face challenges such as small size, uncertainty, and uneven distribution of floating waste. In response to the above issues, this article studies the problem of insufficient integration and low efficiency between existing path planning algorithms and target-perception modules, and designs an efficient overall path planning method for floating-waste cleaning by an unmanned surface vehicle. This method transforms the path planning problem of floating-waste cleaning unmanned surface vehicle into a Traveling Salesman Problem by setting global patrol points and tracking local targets, and proposes an improved ant colony algorithm, IACO, to solve the Traveling Salesman Problem. This article is based on the TSPLIB dataset and practical applications for experiments. The experimental results show that the proposed method has average optimal path lengths of 75.930 m, 446.555 m, and 703.759 m on the Ulysses22, eil51, and st70 datasets, respectively, which are reduced by 0.355 m, 4.108 m, and 13.575 m compared to the benchmark.