2019
DOI: 10.1109/tsp.2019.2946017
|View full text |Cite
|
Sign up to set email alerts
|

Decentralized Gaussian Filters for Cooperative Self-Localization and Multi-Target Tracking

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
32
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 49 publications
(32 citation statements)
references
References 36 publications
0
32
0
Order By: Relevance
“…The proposed solution considers the localization of cooperative agents and the multi-target tracking as two integrated tasks. Compared to state-of-the-art solutions [15][16][17][18][19], the developed methodology integrates the uncertainties of agents (coming from the need of localizing them) with the tracking of unknown and arbitrary number of targets, and fruitfully exploits target localization as a mean to improve agent self-localization. The idea can be conceptualized as a dual layer mutually-connected graph (see Fig.…”
Section: Cooperative Localization: Methodologymentioning
confidence: 99%
“…The proposed solution considers the localization of cooperative agents and the multi-target tracking as two integrated tasks. Compared to state-of-the-art solutions [15][16][17][18][19], the developed methodology integrates the uncertainties of agents (coming from the need of localizing them) with the tracking of unknown and arbitrary number of targets, and fruitfully exploits target localization as a mean to improve agent self-localization. The idea can be conceptualized as a dual layer mutually-connected graph (see Fig.…”
Section: Cooperative Localization: Methodologymentioning
confidence: 99%
“…In cases where positional states follow a linear evolution and both SFI and SCI are Gaussian functions, the inference can be performed in a closed form as in Kalman filters [11]. Otherwise, its implementation emploies approximations which account for a trade-off between complexity and accuracy [12]. Compared to existing works which rely on predefined measurement models, such as those in the field of multi-sensor multi-target tracking [13], SI-based approaches do not require specific measurement models.…”
Section: Soft Information For Location Awarenessmentioning
confidence: 99%
“…We propose a SPAbased technique that extends the state-of-the-art methods by combining cooperative self-localization and multitarget tracking in a unified framework such that agents are capable of jointly localizing themselves and, at the same time, detecting and tracking an unknown, unlimited, and time-varying number of targets in presence of clutter, miss detection and association uncertainty. A fully distributed approach based on consensus strategies [50], [54]- [58] can be adopted and customized for the proposed scheme; this study is not included here and left to future works. We focus the attention on the holistic approach for cooperative self-localization and multitarget tracking, and on the real world experimentation.…”
Section: B Contributions and Paper Organizationmentioning
confidence: 99%
“…However, not all of them handle typical multitarget tracking challenges like the presence of clutter generated measurements (i.e., false alarms), missed detections, and measurement origin uncertainty [52], i.e., the problem of unknown association between targets and measurements. Focusing on multitarget tracking algorithms with mobile sensors, the cited works are affected by the following limitations: in [49] sensors do not localize themselves cooperatively; in [50] the maximum number of targets that can be tracked simultaneously is limited and needs to be set a priori; in [16] and [51] the number of targets is time-invariant and known, and, in addition, in [16] neither false alarms nor missed detections are considered, and in [51] the association between targets and measurements is assumed known. Moreover, the solutions proposed in these works are not suitable for a full multistatic network configuration, and do not consider the case of signal reflections from agents, thus easing the data association problem.…”
Section: Introduction a Background And Motivationmentioning
confidence: 99%