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

A path planning approach based on multi-direction A* algorithm for ships navigating within wind farm waters

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
32
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 90 publications
(32 citation statements)
references
References 32 publications
0
32
0
Order By: Relevance
“…The proportion of each component in F(P) can be changed by adjusting the values of β and γ. A feasible discrete trajectory for the eye-in-hand camera Γ = {P k |k = 0,1, � � � n} can be planned in Cartesian space by using F(P) and Eq (15). That is, a corresponding discrete trajectory in the image space X ¼ fs � k jk ¼ 0; 1; � � � ng is obtained.…”
Section: Trajectory Planning Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…The proportion of each component in F(P) can be changed by adjusting the values of β and γ. A feasible discrete trajectory for the eye-in-hand camera Γ = {P k |k = 0,1, � � � n} can be planned in Cartesian space by using F(P) and Eq (15). That is, a corresponding discrete trajectory in the image space X ¼ fs � k jk ¼ 0; 1; � � � ng is obtained.…”
Section: Trajectory Planning Methodsmentioning
confidence: 99%
“…The common methods in the trajectory planning include genetic algorithm [9][10], simulated annealing [11][12], artificial neural network [13][14], A � algorithm [15], vector field method [16], adaptive algorithm [17][18], particle swarm optimization algorithm [19][20], artificial potential field method [21][22], etc. Among these algorithms, the artificial potential field method has a simple structure, is convenient for real-time control on hardware entities, and can usually plan smoother and safer paths.…”
Section: Introductionmentioning
confidence: 99%
“…Path planning is typically divided into global and local path planning based on what type of environmental information is known [9]. A known environment indicates that all information about obstacles and targets is known prior to launching a USV, and the vehicle plans its path navigation based on this prior knowledge, which primarily includes the visual graph method, cell decomposition, the A* algorithm, and the grid method [10][11][12][13]. Conversely, in unknown environments, vehicles know nothing or only some information about their environment prior to launch, and local path planning is primarily performed by artificial potential field methods, genetic algorithms and simulated annealing [14][15][16].…”
Section: Introductionmentioning
confidence: 99%
“…The data compression time could be reduced [13]. Xie et al proposed a modified A-Star algorithm, in which a scalar artificial potential field is introduced to solve the obstacle avoidance and the penalty mode is utilized to realize the crossing time [14]. It is a pity that the factors of wind, current, visibility are not considered.…”
Section: Introductionmentioning
confidence: 99%