{"title":"Random Patrol Path Planning for Unmanned Surface Vehicles in Shallow Waters","authors":"Xiyang Xie, Yunliang Wang, Yanjuan Wu, Mankun You, Shuangyang Zhang","doi":"10.1109/ICMA54519.2022.9856340","DOIUrl":null,"url":null,"abstract":"To solve the problem of surface patrol in small and medium-sized shallow waters, a multi-point path planning scheme for unmanned surface vehicle (USV) is proposed. The random patrol path planning method is designed as follows: 1) randomly select target points 2) combine genetic algorithm to solve Traveling Salesman Problem (TSP) 3) use Rapidly-exploring Random Trees Star algorithm (RRT*) and Dynamic Window Approach algorithm (DWA) to plan the path. Through the cooperation of global path planning and local path planning, under the premise of ensuring the safety of the USV, the random search of the water surface can be more efficiently carried out. Through simulation experiments, it is proved that the path planning algorithm designed in this paper can complete the patrol task of the water surface under the condition that the USV is safe in shallow waters.","PeriodicalId":120073,"journal":{"name":"2022 IEEE International Conference on Mechatronics and Automation (ICMA)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE International Conference on Mechatronics and Automation (ICMA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMA54519.2022.9856340","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
To solve the problem of surface patrol in small and medium-sized shallow waters, a multi-point path planning scheme for unmanned surface vehicle (USV) is proposed. The random patrol path planning method is designed as follows: 1) randomly select target points 2) combine genetic algorithm to solve Traveling Salesman Problem (TSP) 3) use Rapidly-exploring Random Trees Star algorithm (RRT*) and Dynamic Window Approach algorithm (DWA) to plan the path. Through the cooperation of global path planning and local path planning, under the premise of ensuring the safety of the USV, the random search of the water surface can be more efficiently carried out. Through simulation experiments, it is proved that the path planning algorithm designed in this paper can complete the patrol task of the water surface under the condition that the USV is safe in shallow waters.