2022
DOI: 10.3390/s22103652
|View full text |Cite
|
Sign up to set email alerts
|

Underwater Submarine Path Planning Based on Artificial Potential Field Ant Colony Algorithm and Velocity Obstacle Method

Abstract: Navigating safely in complex marine environments is a challenge for submarines because proper path planning underwater is difficult. This paper decomposes the submarine path planning problem into global path planning and local dynamic obstacle avoidance. Firstly, an artificial potential field ant colony algorithm (APF-ACO) based on an improved artificial potential field algorithm and improved ant colony algorithm is proposed to solve the problem of submarine underwater global path planning. Compared with the O… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
7
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 17 publications
(8 citation statements)
references
References 26 publications
0
7
0
Order By: Relevance
“…For example, it is easy for the robot to fall into the local optimum and sometimes cannot reach the target point. When the integrated potential field of the target point is not the minimum value in the whole integrated potential field, the case of an unreachable target point will be generated [ 39 ]. The motion of the robot in the scene is affected by the resultant force formed by the superposition of attractive forces and repulsive forces, and the robot determines the direction and magnitude of the next movement under the action of the resultant force.…”
Section: Methodsmentioning
confidence: 99%
“…For example, it is easy for the robot to fall into the local optimum and sometimes cannot reach the target point. When the integrated potential field of the target point is not the minimum value in the whole integrated potential field, the case of an unreachable target point will be generated [ 39 ]. The motion of the robot in the scene is affected by the resultant force formed by the superposition of attractive forces and repulsive forces, and the robot determines the direction and magnitude of the next movement under the action of the resultant force.…”
Section: Methodsmentioning
confidence: 99%
“…Furthermore, our decision to use the ACO meta-heuristic for solving the traffic routing problem is supported by experimental results and studies from other researchers in the field. For instance, authors (Bedi et al ., 2007; Di Caprio et al ., 2022; SS et al ., 2020; Jiao et al ., 2018), recommended ACO as the most suitable algorithm to fix traffic routing problems, like the Traveling Salesman Problem (TSP) (Zukhri and Paputungan, 2013; Le and Peechatt, 2019), Vehicle Routing Problem VRP (Bell and McMullen, 2004; Jiang et al ., 2021), path planning and avoiding obstacles for automated vehicles (Wang et al ., 2019), for robots (Liu et al ., 2017; Cong and Ponnambalam, 2009), for Unmanned Aerial Vehicles UAV (Duan et al ., 2009; Chen et al ., 2022), for Autonomous Underwater Vehicle AUV (Mirjalili et al ., 2020) and for submarines (Fu et al ., 2022; Ma et al ., 2020).…”
Section: Related Workmentioning
confidence: 99%
“…Swarm algorithms and evolutionary algorithms are widely adopted for solving the optimal path planning algorithms with multiple constraints [ 40 , 41 , 42 , 43 , 44 ]. Whale optimization (WO) based path planning for an underwater robot is mentioned in [ 45 ], where the optimization techniques are used for generating a path with safe and minimal fuel consumption.…”
Section: Related Workmentioning
confidence: 99%