2021
DOI: 10.1016/j.oceaneng.2021.109355
|View full text |Cite
|
Sign up to set email alerts
|

Path planning and obstacle avoidance for AUV: A review

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
58
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 154 publications
(58 citation statements)
references
References 83 publications
0
58
0
Order By: Relevance
“…This on-line planner creates the initial mission similar to its offline counterpart (with fixed mission parameters and goals), but is fed selected sensor data which enables it to react to mission-relevant information and alter or re-plan the mission. A very basic example would be the case of obstacle-avoidance [118], where a sensor (e.g. forward-looking sonar) detects an obstacle in the vehicle's path and reports this to the on-line planning system.…”
Section: Perception and Navigationmentioning
confidence: 99%
“…This on-line planner creates the initial mission similar to its offline counterpart (with fixed mission parameters and goals), but is fed selected sensor data which enables it to react to mission-relevant information and alter or re-plan the mission. A very basic example would be the case of obstacle-avoidance [118], where a sensor (e.g. forward-looking sonar) detects an obstacle in the vehicle's path and reports this to the on-line planning system.…”
Section: Perception and Navigationmentioning
confidence: 99%
“…The x init is the starting node and x rand is the target node. By collision detection of random sampling points in the state space, the nearest node x near to the target node can be found, expanding the node x new into the open undetected area [33].…”
Section: Rapid-exploring Random Treesmentioning
confidence: 99%
“…The G best is called the global extremum, that is, the optimal solution in the whole swarm of particles. The whole process of the particle swarm optimization algorithm is to use the particles' velocity, V, current position X, P best and G best information iterate until an optimal solution is found [33]. Particle swarm algorithm is widely used in UAV PP problem.…”
Section: Particle Swarm Optimizationmentioning
confidence: 99%
“…Global planning depends heavily on the information of the current navigation plane that the agent currently navigating. This information is used for precalculation for path planning which is unsuitable for the dynamic environment in evacuation scenarios, where obstacles and agents' positions are constantly on move [3], [7], [10]- [19]. Global planning is only viable as long as the information of navigation space is available for the navigating agents.…”
Section: Introductionmentioning
confidence: 99%