{"title":"Multi-UUV Path Planning Study with Improved Ant Colony Algorithm and DDQN Algorithm","authors":"Lu YongZhou, Luo Guangyu, G. Xuan","doi":"10.1109/ICCSSE52761.2021.9545198","DOIUrl":null,"url":null,"abstract":"For the Unmanned Undersea Vehicle (UUV) path planning problem, an improved ant colony algorithm is proposed to solve the global static path planning and an improved DDQN algorithm is proposed to solve the local dynamic collision avoidance problem. The traditional ant colony algorithm is optimized by adding the constraints of collision avoidance among UUVs to improve the accuracy of the algorithm. The Q algorithm idea is introduced to improve the DDQN algorithm to realize the UUV’s anticipation of future environmental state changes. This algorithm can not only solve the local collision avoidance problem, but also realize the accurate prediction of future environment. Finally, the algorithm is validated with a real UUV. The experimental results show that the proposed method solves the problems of collision avoidance and path finding for multiple UUVs in complex environments, and can effectively avoid collisions for obstacles.","PeriodicalId":143697,"journal":{"name":"2021 IEEE 7th International Conference on Control Science and Systems Engineering (ICCSSE)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 7th International Conference on Control Science and Systems Engineering (ICCSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSSE52761.2021.9545198","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
For the Unmanned Undersea Vehicle (UUV) path planning problem, an improved ant colony algorithm is proposed to solve the global static path planning and an improved DDQN algorithm is proposed to solve the local dynamic collision avoidance problem. The traditional ant colony algorithm is optimized by adding the constraints of collision avoidance among UUVs to improve the accuracy of the algorithm. The Q algorithm idea is introduced to improve the DDQN algorithm to realize the UUV’s anticipation of future environmental state changes. This algorithm can not only solve the local collision avoidance problem, but also realize the accurate prediction of future environment. Finally, the algorithm is validated with a real UUV. The experimental results show that the proposed method solves the problems of collision avoidance and path finding for multiple UUVs in complex environments, and can effectively avoid collisions for obstacles.