EM-based Batch Algorithm for Trajectory Estimation of Multiple Targets

This study investigates the trajectory clustering problem in the presence of multiple moving targets which are approximated by straight motion over the observation interval and monitored by a radar sensor network. The assumption is that the nodes in the network lack the knowledge of the measurements’ association with each target, causing challenging estimation and classification tasks. To solve this problem, a novel unsupervised classifier based on expectation-maximization algorithm is devised by exploiting the latent variable model combined with cyclic estimation methods to obtain closed-form updates for the unknown parameters and build up a maximum a posteriori rule allowing for target measurement clustering. Finally, we analyze the effectiveness of the proposed algorithm through simulation experiments in a scenario with trajectory intersections.

Authors

Institutions

Publication Details

Published
2024-11-22
DOI
https://doi.org/10.1109/icsidp62679.2024.10869112
Primary Topic
Autonomous Vehicle Technology and Safety
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

EM-based Batch Algorithm for Trajectory Estimation of Multiple Targets

Gaetano Giunta, Nicomino Fiscante, Danilo Orlando, Pia Addabbo et al.
Autonomous Vehicle Technology and Safety
article

EM-based Batch Algorithm for Trajectory Estimation of Multiple Targets

Gaetano Giunta, Nicomino Fiscante, Danilo Orlando, Pia Addabbo, Chengpeng Hao, Linjie Yan
article en

Abstract

This study investigates the trajectory clustering problem in the presence of multiple moving targets which are approximated by straight motion over the observation interval and monitored by a radar sensor network. The assumption is that the nodes in the network lack the knowledge of the measurements’ association with each target, causing challenging estimation and classification tasks. To solve this problem, a novel unsupervised classifier based on expectation-maximization algorithm is devised by exploiting the latent variable model combined with cyclic estimation methods to obtain closed-form updates for the unknown parameters and build up a maximum a posteriori rule allowing for target measurement clustering. Finally, we analyze the effectiveness of the proposed algorithm through simulation experiments in a scenario with trajectory intersections.

University of Pisa (IT), Roma Tre University (IT), Chinese Academy of Sciences (CN), Institute of Acoustics (CN), Giustino Fortunato University (IT)
Openalex Percentile: Top 70%
Autonomous Vehicle Technology and Safety
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.