Skip to main navigation Skip to search Skip to main content

Data-driven graph-based methods for in-port AIS vessel trajectory reconstruction

Research output: Contribution to journal › Article › peer-review

Abstract

AIS trajectories in and around ports are often incomplete because of transmission interruptions, reception failures, and infrastructure outages. In this paper, we investigate whether the Data-driven AIS Trajectory Interpolation method (DAISTIN), which reconstructs missing trajectory segments using a graph derived from historical AIS observations, can be improved by retaining local directional information that is otherwise discarded when observations are sampled to form the graph. To this end, we introduce two extensions, xDAISTIN and xDAISTOUT. The originality of the proposed approach lies in extending DAISTIN by enriching each sampled graph node with neighbourhood-level directional information from nearby historical AIS observations. Specifically, local vessel headings are encoded cyclically and modelled using kernel density estimators, allowing candidate graph transitions to be evaluated using local movement probabilities rather than only the heading of the sampled point. The methods are evaluated on real-world AIS data from the Port of Antwerp by introducing synthetic gaps into held-out trajectories and measuring how well they are reconstructed by the methods. Using 36,748 moving sub-trajectories from 5488 vessel trips, we compare the proposed methods against DAISTIN, linear interpolation, and several directed, undirected, probabilistic, and shortest-path graph variants. Across graph sizes from 100 k to 180 k nodes, DAISTIN and its undirected variant reconstructed (Formula presented.) – (Formula presented.) and (Formula presented.) – (Formula presented.) of missing segments, respectively, compared to (Formula presented.) – (Formula presented.) and (Formula presented.) – (Formula presented.) for xDAISTIN and its variants, and (Formula presented.) – (Formula presented.) and (Formula presented.) – (Formula presented.) for xDAISTOUT and its variants. Compared with undirected DAISTIN at 180 k nodes, undirected xDAISTIN at 180 k nodes achieved significantly lower mean SPD, DFD, and HD (all Holm-adjusted, (Formula presented.)), by approximately (Formula presented.), (Formula presented.), and (Formula presented.), respectively. These findings demonstrate that preserving neighbourhood-level directional behaviour during graph construction can substantially improve the interpolation completion rate and reconstruction accuracy in complex port environments.

Original languageEnglish
Article number692
Pages (from-to)1-32
Number of pages32
JournalAlgorithms
Volume19
Issue number8
DOIs
Publication statusPublished - 17 Aug 2026

Keywords

  • Antwerp
  • Automatic identification system
  • DAISTIN
  • Geometric sampling
  • Interpolation
  • Kernel density estimator

Fingerprint

Dive into the research topics of 'Data-driven graph-based methods for in-port AIS vessel trajectory reconstruction'. Together they form a unique fingerprint.

Cite this