Open this publication in new window or tab >>Show others...
2024 (English)In: Peer-to-Peer Networking and Applications, ISSN 1936-6442, E-ISSN 1936-6450, Vol. 17, no 4, p. 2491-2506Article in journal (Refereed) Published
Abstract [en]
Due to the high mobility of Unmanned Aerial Vehicle (UAV), it can be an effective method for pollution detection of vessels on the sea. How to optimize the flight path of the UAV so that the visited energy consumption is minimized is a problem that remains to be solved. In this paper, the Lin-Kernighan-Helsgaun-based trajectory planning method (LKH-TPM) is used to solve the UAV scheduling problem to minimize the UAV visit path length and compare it with the ant colony (ACO) algorithm, simulated annealing (SA) algorithm and tabu search (TS) algorithm. The experiments are carried out under different ship numbers, different sea areas, and different base station numbers, and it is verified that LKH-TPM is a more effective solution for the problem under study.
Place, publisher, year, edition, pages
Springer, 2024
Keywords
UAV, Heuristic algorithm, Lin-Kernighan-Helsgaun, Pollution detection, Trajectory planning
National Category
Control Engineering
Identifiers
urn:nbn:se:mau:diva-70019 (URN)10.1007/s12083-024-01730-x (DOI)001229249200002 ()2-s2.0-85193809754 (Scopus ID)
2024-08-012024-08-012024-08-01Bibliographically approved