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

Anticipation of ship behaviours in multi-vessel scenarios

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
6
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 12 publications
(7 citation statements)
references
References 12 publications
0
6
0
Order By: Relevance
“…When using KDE based methods the choice of bandwidth h is important and often more so than the choice of kernel, with several methods availble for choosing the best bandwidth including; grid-search with cross-validation and Silverman's rule of thumb [40]. Silverman's rule is a fast algorithm for estimating the correct bandwidth, however the rule assumes that the true underlying density is a Gaussian normal distribution, which does not apply for the data transformed through (32), (34) or (35). When dealing with non-normal data the Improved Sheather-Jones (ISJ) algorithm [41] can be used, as this algorithm does not assume an underlying normal distribution in the data, the trade-off is that it requires more data for a good estimate, thereby increasing the computational time.…”
Section: Kernel Density Estimationmentioning
confidence: 99%
See 4 more Smart Citations
“…When using KDE based methods the choice of bandwidth h is important and often more so than the choice of kernel, with several methods availble for choosing the best bandwidth including; grid-search with cross-validation and Silverman's rule of thumb [40]. Silverman's rule is a fast algorithm for estimating the correct bandwidth, however the rule assumes that the true underlying density is a Gaussian normal distribution, which does not apply for the data transformed through (32), (34) or (35). When dealing with non-normal data the Improved Sheather-Jones (ISJ) algorithm [41] can be used, as this algorithm does not assume an underlying normal distribution in the data, the trade-off is that it requires more data for a good estimate, thereby increasing the computational time.…”
Section: Kernel Density Estimationmentioning
confidence: 99%
“…The grid-search based method is inherently slow, and the example shown takes around 5 minutes running on a 48 core AMD Threadripper 3960X CPU, compared to the very fast FFTbased implementation of the ISJ in [42] which takes less than a second on the same hardware. One could argue that once the bandwidth is estimated through a grid-search, the value h grid could be used for all future evaluations, however, the high non-linearities in (32), (34) and (35) does not guarantee that this choice would be valid in any scenario. Comparing to the computational cost of drawing more samples for the ISJ algorithm and re-fitting the KDE every time, to the computational cost of having to run a grid-search, the ISJ algorithm is the favorable approach.…”
Section: Kernel Density Estimationmentioning
confidence: 99%
See 3 more Smart Citations