2003
DOI: 10.1017/s0373463303002418
|View full text |Cite
|
Sign up to set email alerts
|

A Method for Searching Optimal Routes with Collision Avoidance on Raster Charts

Abstract: Collision avoidance is an intensive discussion issue for navigation safety. This article introduces a new routing algorithm for finding optimal routes with collision detection and avoidance on raster charts or planes. After the required data structure of the raster chart is initialized, the maze routing algorithm is applied to obtain the particular route of each ship. Those ships that have potential to collide will be detected by simulating the particular routes with ship domains. The collision avoidance schem… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
34
0

Year Published

2009
2009
2022
2022

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 49 publications
(34 citation statements)
references
References 25 publications
0
34
0
Order By: Relevance
“…Unfortunately, a simple deterministic algorithm cannot deal with that. Although there are deterministic methods for finding paths in an environment containing obstacles and barriers (e.g., maze routing algorithms or methods based on graph theory), their computational complexity is a squared function of a geographical distance (Chang et al, 2003), which translates to a high computational time. What is more, basic versions of these methods handle only eight moving directions and the computational time additionally rises when higher resolutions of course alterations are taken into account.…”
Section: E Vo L U T I O N a R Y S H I P T R Ac K S I N R E S T R I C mentioning
confidence: 99%
“…Unfortunately, a simple deterministic algorithm cannot deal with that. Although there are deterministic methods for finding paths in an environment containing obstacles and barriers (e.g., maze routing algorithms or methods based on graph theory), their computational complexity is a squared function of a geographical distance (Chang et al, 2003), which translates to a high computational time. What is more, basic versions of these methods handle only eight moving directions and the computational time additionally rises when higher resolutions of course alterations are taken into account.…”
Section: E Vo L U T I O N a R Y S H I P T R Ac K S I N R E S T R I C mentioning
confidence: 99%
“…However, the low computational efficiency puts into question the practical application of such approach. Inspired by the maze route algorithm [18], a practical model was proposed by Chang et al [19] to transform the decision-making problem in collision avoidance into a route distance optimization problem. Szlapczynski [20] improved this model by accounting for ship maneuvering characteristics, for the COLREGS (The International Regulations for Preventing Collisions at Sea) and by introducing other operational constraints (e.g., speed reduction capability).…”
Section: Introductionmentioning
confidence: 99%
“…The route of a commercial ship is usually immovable, but an optimal route is still an important factor for improving the competitive capacity of a company managing ships (Rafal 2006;Vlachos 2004;Chang et al 2003). It is especially necessary to search for a shortest time route in an emergency, such as seeking a refuge or a rescue at sea (Zhang et al 2008a).…”
Section: Introductionmentioning
confidence: 99%
“…One is the shortest distance method. The shortest distance route is acquired and then regarded as the approximate shortest time route (Zhang et al 2008a;Rafal 2006;Wang 2004;Chang et al 2003). The other is the route determined by the weather.…”
Section: Introductionmentioning
confidence: 99%