Proceedings of the 2022 2nd International Conference on Control and Intelligent Robotics 2022
DOI: 10.1145/3548608.3559208
|View full text |Cite
|
Sign up to set email alerts
|

Research on Thrust Distribution Algorithm of Power Positioning Ship Based on Optimal Energy Consumption

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 2 publications
0
2
0
Order By: Relevance
“…In this study, SVD decomposition is used to decompose and estimate the covariance matrix based on the CKF algorithm. Its estimation accuracy is improved by up to 37.4% over three degrees of freedom compared with Cholesky decomposition [23]. In numerical matrix decomposition, the SVD method reduces the dimensionality by retaining only the most important singular values and vectors and estimates the pure signal by removing the noisy signal vector components that fall in the noise space.…”
Section: Svd Methods Decomposes Estimated Covariance Arraymentioning
confidence: 99%
“…In this study, SVD decomposition is used to decompose and estimate the covariance matrix based on the CKF algorithm. Its estimation accuracy is improved by up to 37.4% over three degrees of freedom compared with Cholesky decomposition [23]. In numerical matrix decomposition, the SVD method reduces the dimensionality by retaining only the most important singular values and vectors and estimates the pure signal by removing the noisy signal vector components that fall in the noise space.…”
Section: Svd Methods Decomposes Estimated Covariance Arraymentioning
confidence: 99%
“…After updating and optimizing each individual need to determine whether the number of attempts on the set value (can be set to m), if the individual's fitness value still does not reach the optimum after m attempts, it is necessary to execute the random operator and retain the current optimum individual fitness value; if the optimum is reached after m attempts then end the individual evolution, and then update the global optimum [7].…”
Section: Algorithm Execution Stepsmentioning
confidence: 99%