Geometrically-informed sequential Monte Carlo method for dynamic swarm tracking

This paper introduces a novel approach for dynamic tracking of swarms of autonomous moving agents (such as UAVs) by leveraging the inherent geometric properties of swarm formations. The method treats the entire swarm as a single target, streamlining the tracking process. The state of the swarm is characterized by the location and velocity of its center, as well as the orientation and geometric parameters of the swarm, which are estimated using the sequential Monte Carlo method. One significant aspect of this paper is the formulation of the likelihood function, which incorporates the geometric information of the swarm and is tolerant of the high rate of false alarms, significantly enhancing the robustness of the filter against common sensor-based challenges in swarm tracking. Likelihood functions are proposed for different swarm formation patterns. Our proposed method is also capable of addressing scenarios where the swarm undergoes multiple time-varying formation patterns. The performance of the proposed methods has been numerically tested. The results indicate that the proposed methods accurately estimate swarm movement, formation, and shape in situations with time-varying formation patterns, even in the presence of high false alarms and missed detections, better than the conventional particle filter.

Authors

Institutions

Publication Details

Journal
ISA Transactions
Published
2025-05-27
DOI
https://doi.org/10.1016/j.isatra.2025.05.034
Citations
2
Primary Topic
Target Tracking and Data Fusion in Sensor Networks
Type
article
Field-Weighted Citation Impact
4.96
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Geometrically-informed sequential Monte Carlo method for dynamic swarm tracking

Reza Hoseinnezhad, Amirali Khodadadian Gostar, Thilini Rajapaksha
2 citations
ISA Transactions
Target Tracking and Data Fusion in Sensor Networks
4.96
article

Geometrically-informed sequential Monte Carlo method for dynamic swarm tracking

Reza Hoseinnezhad, Amirali Khodadadian Gostar, Thilini Rajapaksha
article en
2 citations

Abstract

This paper introduces a novel approach for dynamic tracking of swarms of autonomous moving agents (such as UAVs) by leveraging the inherent geometric properties of swarm formations. The method treats the entire swarm as a single target, streamlining the tracking process. The state of the swarm is characterized by the location and velocity of its center, as well as the orientation and geometric parameters of the swarm, which are estimated using the sequential Monte Carlo method. One significant aspect of this paper is the formulation of the likelihood function, which incorporates the geometric information of the swarm and is tolerant of the high rate of false alarms, significantly enhancing the robustness of the filter against common sensor-based challenges in swarm tracking. Likelihood functions are proposed for different swarm formation patterns. Our proposed method is also capable of addressing scenarios where the swarm undergoes multiple time-varying formation patterns. The performance of the proposed methods has been numerically tested. The results indicate that the proposed methods accurately estimate swarm movement, formation, and shape in situations with time-varying formation patterns, even in the presence of high false alarms and missed detections, better than the conventional particle filter.

ISA TransactionsVol. 164
MIT University (MK), RMIT University (AU)
Openalex Percentile: Top 5%
Target Tracking and Data Fusion in Sensor Networks
4.96
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.