Improved Online Kalman Smoothing Method for Ship Maneuvering Motion Data Using Expectation-Maximization Algorithm

Despite the pivotal role of filtering and smoothing techniques in the preprocessing of ship maneuvering data for robust identification, persistent challenges in reconciling noise suppression with dynamic fidelity preservation have limited algorithmic advancements in recent decades. We propose an online smoothing method enhanced by the Expectation-Maximization (EM) algorithm framework that effectively extracts high-fidelity dynamic features from raw maneuvering data, thereby enhancing the fidelity of subsequent ship identification systems. Our method effectively addresses the challenges posed by heavy-tailed Student-t distributed noise and parameter uncertainty inherent in ship motion data, demonstrating robust parameter learning capabilities, even when initial ship motion system parameters deviate from real conditions. Through iterative data assimilation, the algorithm adaptively calibrates noise distribution parameters while preserving motion smoothness, achieving superior accuracy in velocity and heading estimation compared to conventional Rauch–Tung–Striebel (RTS) smoothers. By integrating parameter adaptation within the smoothing framework, the proposed method reduces motion prediction errors by 23.6% in irregular sea states, as validated using real ship motion data from autonomous navigation tests.

Authors

Institutions

Publication Details

Journal
Journal of Marine Science and Engineering
Published
2025-05-23
DOI
https://doi.org/10.3390/jmse13061018
Primary Topic
Inertial Sensor and Navigation
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Improved Online Kalman Smoothing Method for Ship Maneuvering Motion Data Using Expectation-Maximization Algorithm

Junsheng Ren, W. H. Yue
Journal of Marine Science and Engineering
Inertial Sensor and Navigation
article

Improved Online Kalman Smoothing Method for Ship Maneuvering Motion Data Using Expectation-Maximization Algorithm

Junsheng Ren, W. H. Yue
article en

Abstract

Despite the pivotal role of filtering and smoothing techniques in the preprocessing of ship maneuvering data for robust identification, persistent challenges in reconciling noise suppression with dynamic fidelity preservation have limited algorithmic advancements in recent decades. We propose an online smoothing method enhanced by the Expectation-Maximization (EM) algorithm framework that effectively extracts high-fidelity dynamic features from raw maneuvering data, thereby enhancing the fidelity of subsequent ship identification systems. Our method effectively addresses the challenges posed by heavy-tailed Student-t distributed noise and parameter uncertainty inherent in ship motion data, demonstrating robust parameter learning capabilities, even when initial ship motion system parameters deviate from real conditions. Through iterative data assimilation, the algorithm adaptively calibrates noise distribution parameters while preserving motion smoothness, achieving superior accuracy in velocity and heading estimation compared to conventional Rauch–Tung–Striebel (RTS) smoothers. By integrating parameter adaptation within the smoothing framework, the proposed method reduces motion prediction errors by 23.6% in irregular sea states, as validated using real ship motion data from autonomous navigation tests.

Journal of Marine Science and EngineeringVol. 13(6)
Dalian Maritime University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 85%
Inertial Sensor and Navigation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.