{"title":"基于粒子群算法的船舶航路规划","authors":"Yu Shen, Fuping Wang, Peimin Zhao, Xinchi Tong, Jinhui Huang, Kai Chen, Huajun Zhang","doi":"10.1109/YAC.2019.8787628","DOIUrl":null,"url":null,"abstract":"The ship route planning has two problems to solve. The first problem is how to model the environment of the navigation area, and the second one is how to use an optimal algorithm to search the global optimal route. This paper combines the particle swarm optimization (PSO) algorithm with the tangent graph method to search the optimal ship route. At first, it uses the tangent graph method to obtain the static obstacle information and establishes the static environment model of the navigation area. It designs a cost function evaluating the total distance from the start point to the terminal point. The PSO algorithm takes the minimum value of the cost function as its target to search the global shortest route. Based on the environment model, the PSO individuals are outside of the obstacle hull area, and the optimal results are feasible solutions satisfying the requirement. It designs the detail optimization operations according to the PSO principal. The results show that the proposed route planning method is effective to get the shortest route.","PeriodicalId":6669,"journal":{"name":"2019 34rd Youth Academic Annual Conference of Chinese Association of Automation (YAC)","volume":"46 1","pages":"211-215"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Ship Route Planning Based on Particle Swarm Optimization\",\"authors\":\"Yu Shen, Fuping Wang, Peimin Zhao, Xinchi Tong, Jinhui Huang, Kai Chen, Huajun Zhang\",\"doi\":\"10.1109/YAC.2019.8787628\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The ship route planning has two problems to solve. The first problem is how to model the environment of the navigation area, and the second one is how to use an optimal algorithm to search the global optimal route. This paper combines the particle swarm optimization (PSO) algorithm with the tangent graph method to search the optimal ship route. At first, it uses the tangent graph method to obtain the static obstacle information and establishes the static environment model of the navigation area. It designs a cost function evaluating the total distance from the start point to the terminal point. The PSO algorithm takes the minimum value of the cost function as its target to search the global shortest route. Based on the environment model, the PSO individuals are outside of the obstacle hull area, and the optimal results are feasible solutions satisfying the requirement. It designs the detail optimization operations according to the PSO principal. The results show that the proposed route planning method is effective to get the shortest route.\",\"PeriodicalId\":6669,\"journal\":{\"name\":\"2019 34rd Youth Academic Annual Conference of Chinese Association of Automation (YAC)\",\"volume\":\"46 1\",\"pages\":\"211-215\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 34rd Youth Academic Annual Conference of Chinese Association of Automation (YAC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/YAC.2019.8787628\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 34rd Youth Academic Annual Conference of Chinese Association of Automation (YAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/YAC.2019.8787628","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Ship Route Planning Based on Particle Swarm Optimization
The ship route planning has two problems to solve. The first problem is how to model the environment of the navigation area, and the second one is how to use an optimal algorithm to search the global optimal route. This paper combines the particle swarm optimization (PSO) algorithm with the tangent graph method to search the optimal ship route. At first, it uses the tangent graph method to obtain the static obstacle information and establishes the static environment model of the navigation area. It designs a cost function evaluating the total distance from the start point to the terminal point. The PSO algorithm takes the minimum value of the cost function as its target to search the global shortest route. Based on the environment model, the PSO individuals are outside of the obstacle hull area, and the optimal results are feasible solutions satisfying the requirement. It designs the detail optimization operations according to the PSO principal. The results show that the proposed route planning method is effective to get the shortest route.