2019
DOI: 10.1002/rob.21900
|View full text |Cite
|
Sign up to set email alerts
|

The branching‐course model predictive control algorithm for maritime collision avoidance

Abstract: This article presents a new algorithm for short-term maritime collision avoidance (COLAV) named the branching-course model predictive control (BC-MPC) algorithm. The algorithm is designed to be robust with respect to noise on obstacle estimates, which is a significant source of disturbance when using exteroceptive sensors such as, for example, radars for obstacle detection and tracking. Exteroceptive sensors do not require vesselto-vessel communication, which enables COLAV toward vessels not equipped with, for… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
34
0
1

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 58 publications
(39 citation statements)
references
References 37 publications
0
34
0
1
Order By: Relevance
“…The experimental setup was similar to the setup reported in Eriksen et al (2019b), using the Telemetron ASV from Maritime Robotics as the ownship and the Ocean Space Drone 1 (OSD1) from Kongsberg Seatex as the moving obstacle. In addition, virtual static obstacles, expanded with a padding radius, were used to emulate static obstacles.…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…The experimental setup was similar to the setup reported in Eriksen et al (2019b), using the Telemetron ASV from Maritime Robotics as the ownship and the Ocean Space Drone 1 (OSD1) from Kongsberg Seatex as the moving obstacle. In addition, virtual static obstacles, expanded with a padding radius, were used to emulate static obstacles.…”
Section: Methodsmentioning
confidence: 99%
“…In order to improve the robustness to noise on obstacle estimates, transitional cost is included in the objective function, which penalizes changing the planned trajectory from iteration to iteration. In Eriksen et al (2019b), a single transitional cost term is used, which introduces a cost if one selects a different speed and/or course than the one closest to the one selected in the previous iteration. Note that the trajectory prediction is based on sampling the possible acceleration of the vessel in the current iteration, which implies that the exact trajectory selected in the previous iteration may not exist in the current search space.…”
Section: Speed and Course Transitional Costsmentioning
confidence: 99%
See 1 more Smart Citation
“…Raw penalty (26) where x is the distance to the obstacle, θ is the vessel-relative angle (azimuth angle), and v y is the velocity component in the direction towards the vessel. The scaling factor ζ v is given as a function of the angle θ and the velocity v y , such that the reward efficiently guides the agent towards COLREGscompliant behavior.…”
Section: )mentioning
confidence: 99%
“…One issue to be considered is ship dynamics, which reflect real conditions. An interesting approach regarding ship dynamics is presented in [ 49 ], where the trajectory generation problem is divided into separate stages and ship dynamics are solved in the last stage. Our future research will concentrate on a method for incorporating ship dynamics in MBSA.…”
Section: Future Workmentioning
confidence: 99%