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

Path planning algorithm for unmanned surface vehicle formations in a practical maritime environment

Abstract: a b s t r a c tUnmanned surface vehicles (USVs) have been deployed over the past decade. Current USV platforms are generally of small size with low payload capacity and short endurance times. To improve effectiveness there is a trend to deploy multiple USVs as a formation fleet. This paper presents a novel computer based algorithm that solves the problem of USV formation path planning. The algorithm is based upon the fast marching (FM) method and has been specifically designed for operation in dynamic environm… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
99
0
1

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
3
2

Relationship

2
8

Authors

Journals

citations
Cited by 212 publications
(105 citation statements)
references
References 34 publications
0
99
0
1
Order By: Relevance
“…The heuristic is a weighted distance that remains to be marched to the goal point. A parameter λ, ranging from 0 to 100%, is introduced in the cost function as represented in (11) to represent the weight of heuristic influence.…”
Section: B Fm* Methodsmentioning
confidence: 99%
“…The heuristic is a weighted distance that remains to be marched to the goal point. A parameter λ, ranging from 0 to 100%, is introduced in the cost function as represented in (11) to represent the weight of heuristic influence.…”
Section: B Fm* Methodsmentioning
confidence: 99%
“…Modelling of dynamic obstacles on a map for maritime path planning is defined in terms of the velocity of the moving obstacle in the maritime environment. [20] has suggested a circular shape for slow-moving obstacles and elliptical shapes for fast moving obstacles to incorporate the uncertainty of the moving obstacle in graph-based heuristic approaches. Therefore, an elliptical shape has been adopted in the current study as shown in Fig.8(b).…”
Section: B Constrained Dijkstra Approach With Partially Dynamic Envimentioning
confidence: 99%
“…Also some popular graph search algorithms like A* (Al-Hasan and Vachtsevanos 2002;Pereira et al 2013) and Dijkstra (Eichhorn 2015) have been applied to determine a grid or cell-based route from the start to the destination point. Liu and Bucknall (2015) proposed a threelayer structure to facilitate multiple unmanned surface vehicles to accomplish task management and formation path planning in a maritime environment, in which the mission is divided between vehicles according to general mission requirement. Eichhorn (2015) implemented graph-based methods for the AUV ''SLOCUM Glider'' motion planning in a dynamic environment.…”
Section: Vehicle Task Assignment-routingmentioning
confidence: 99%