Obstacle Avoidance for Ship Navigation Safety Combining Heuristic Search Algorithm and Improved ACO Algorithm
The safety of ship navigation has always been a focus of attention in the field of maritime transport and navigation. In the complex marine environment, ships face a variety of obstacles, such as other ships, reefs, buoys, etc., which may pose a threat to navigation safety. Traditional obstacle avo...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Faculty of Transport, Warsaw University of Technology
2024-12-01
|
| Series: | Archives of Transport |
| Subjects: | |
| Online Access: | https://www.archivesoftransport.com/index.php/aot/article/view/606 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832595608961024000 |
|---|---|
| author | Dan Wang Yan Jing |
| author_facet | Dan Wang Yan Jing |
| author_sort | Dan Wang |
| collection | DOAJ |
| description |
The safety of ship navigation has always been a focus of attention in the field of maritime transport and navigation. In the complex marine environment, ships face a variety of obstacles, such as other ships, reefs, buoys, etc., which may pose a threat to navigation safety. Traditional obstacle avoidance methods mainly rely on the navigator's empirical judgement, but there are limitations and risks associated with this method. The standard ant colony optimisation algorithm tends to fall into local optimal solutions during path search, while the A* algorithm is easily limited by the search space when dealing with large-scale problems. Therefore, the study proposes a method that combines a heuristic search algorithm and an improved ACO algorithm to improve the efficiency of obstacle avoidance for vessel navigation safety. Firstly, the standard ant colony optimisation algorithm is improved and applied to the study of obstacle avoidance paths for vessel navigation, and then the A* algorithm is effectively combined with the improved ACO algorithm to improve the performance of planning obstacle avoidance paths. Through simulation experiments and practical applications, the study verifies the capability of the obstacle avoidance planning model. The experimental results show that in simple environments, the hybrid algorithm reduces the path length by 3.8 and 5.5, and the number of iterations by 13.2 and 30.7 compared to Line-of-Sight and Particle Swarm Optimisation algorithms respectively. In moderately complex environments, the proposed algorithm reduces the average path length by 6.51 and 3.93 compared to Particle Swarm Optimisation and Line-of-Sight algorithms respectively. In complex environments, the proposed algorithm reduces the average path length by 15.7 and 12.4 compared to Particle Swarm Optimisation and Line-of-Sight algorithms, and reduces the number of iterations by 49 and 22.2, respectively. The study proposes a novel obstacle avoidance path planning method by effectively integrating the improved ant colony algorithm with the A* algorithm, which significantly improves the efficiency and accuracy of vessel navigation safety. The results show that the hybrid algorithm exhibits superior path planning capability in environments of varying complexity, and is able to quickly adapt to dynamically changing marine environments. This method not only provides a new solution for navigation safety, but also provides a theoretical basis and practical guidance for future autonomous navigation and decision-making of intelligent ships, which has important application value and promotion potential.
|
| format | Article |
| id | doaj-art-48894daa24454d4ebc1d57b03b020ce2 |
| institution | Kabale University |
| issn | 0866-9546 2300-8830 |
| language | English |
| publishDate | 2024-12-01 |
| publisher | Faculty of Transport, Warsaw University of Technology |
| record_format | Article |
| series | Archives of Transport |
| spelling | doaj-art-48894daa24454d4ebc1d57b03b020ce22025-01-18T12:15:37ZengFaculty of Transport, Warsaw University of TechnologyArchives of Transport0866-95462300-88302024-12-0172410.61089/aot2024.0ycg1622Obstacle Avoidance for Ship Navigation Safety Combining Heuristic Search Algorithm and Improved ACO AlgorithmDan Wang0https://orcid.org/0009-0006-1475-5131Yan Jing1https://orcid.org/0009-0008-2876-4607College of Maritime, Beibu Gulf University, Qinzhou, China College of Maritime, Beibu Gulf University, Qinzhou, China The safety of ship navigation has always been a focus of attention in the field of maritime transport and navigation. In the complex marine environment, ships face a variety of obstacles, such as other ships, reefs, buoys, etc., which may pose a threat to navigation safety. Traditional obstacle avoidance methods mainly rely on the navigator's empirical judgement, but there are limitations and risks associated with this method. The standard ant colony optimisation algorithm tends to fall into local optimal solutions during path search, while the A* algorithm is easily limited by the search space when dealing with large-scale problems. Therefore, the study proposes a method that combines a heuristic search algorithm and an improved ACO algorithm to improve the efficiency of obstacle avoidance for vessel navigation safety. Firstly, the standard ant colony optimisation algorithm is improved and applied to the study of obstacle avoidance paths for vessel navigation, and then the A* algorithm is effectively combined with the improved ACO algorithm to improve the performance of planning obstacle avoidance paths. Through simulation experiments and practical applications, the study verifies the capability of the obstacle avoidance planning model. The experimental results show that in simple environments, the hybrid algorithm reduces the path length by 3.8 and 5.5, and the number of iterations by 13.2 and 30.7 compared to Line-of-Sight and Particle Swarm Optimisation algorithms respectively. In moderately complex environments, the proposed algorithm reduces the average path length by 6.51 and 3.93 compared to Particle Swarm Optimisation and Line-of-Sight algorithms respectively. In complex environments, the proposed algorithm reduces the average path length by 15.7 and 12.4 compared to Particle Swarm Optimisation and Line-of-Sight algorithms, and reduces the number of iterations by 49 and 22.2, respectively. The study proposes a novel obstacle avoidance path planning method by effectively integrating the improved ant colony algorithm with the A* algorithm, which significantly improves the efficiency and accuracy of vessel navigation safety. The results show that the hybrid algorithm exhibits superior path planning capability in environments of varying complexity, and is able to quickly adapt to dynamically changing marine environments. This method not only provides a new solution for navigation safety, but also provides a theoretical basis and practical guidance for future autonomous navigation and decision-making of intelligent ships, which has important application value and promotion potential. https://www.archivesoftransport.com/index.php/aot/article/view/606ACO algorithma* algorithmship navigationobstaclespath planning |
| spellingShingle | Dan Wang Yan Jing Obstacle Avoidance for Ship Navigation Safety Combining Heuristic Search Algorithm and Improved ACO Algorithm Archives of Transport ACO algorithm a* algorithm ship navigation obstacles path planning |
| title | Obstacle Avoidance for Ship Navigation Safety Combining Heuristic Search Algorithm and Improved ACO Algorithm |
| title_full | Obstacle Avoidance for Ship Navigation Safety Combining Heuristic Search Algorithm and Improved ACO Algorithm |
| title_fullStr | Obstacle Avoidance for Ship Navigation Safety Combining Heuristic Search Algorithm and Improved ACO Algorithm |
| title_full_unstemmed | Obstacle Avoidance for Ship Navigation Safety Combining Heuristic Search Algorithm and Improved ACO Algorithm |
| title_short | Obstacle Avoidance for Ship Navigation Safety Combining Heuristic Search Algorithm and Improved ACO Algorithm |
| title_sort | obstacle avoidance for ship navigation safety combining heuristic search algorithm and improved aco algorithm |
| topic | ACO algorithm a* algorithm ship navigation obstacles path planning |
| url | https://www.archivesoftransport.com/index.php/aot/article/view/606 |
| work_keys_str_mv | AT danwang obstacleavoidanceforshipnavigationsafetycombiningheuristicsearchalgorithmandimprovedacoalgorithm AT yanjing obstacleavoidanceforshipnavigationsafetycombiningheuristicsearchalgorithmandimprovedacoalgorithm |