2022
DOI: 10.1109/tmc.2020.3035511
|View full text |Cite
|
Sign up to set email alerts
|

Network Localization and Navigation With Scalable Inference and Efficient Operation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4
4

Relationship

3
5

Authors

Journals

citations
Cited by 20 publications
(8 citation statements)
references
References 73 publications
0
7
0
Order By: Relevance
“…In particular, by performing local operations ("messages") on the factor graph, accurate approximations ("beliefs") of the marginal posterior pdfs of unknown states [14] are computed. SPA-based methods are versatile and have been successfully applied to a variety of applications, including cooperative localization [15]- [18], simultaneous localization and mapping (SLAM) [19]- [21], and focalization for underwater localization [22].…”
Section: A State-of-the-artmentioning
confidence: 99%
“…In particular, by performing local operations ("messages") on the factor graph, accurate approximations ("beliefs") of the marginal posterior pdfs of unknown states [14] are computed. SPA-based methods are versatile and have been successfully applied to a variety of applications, including cooperative localization [15]- [18], simultaneous localization and mapping (SLAM) [19]- [21], and focalization for underwater localization [22].…”
Section: A State-of-the-artmentioning
confidence: 99%
“…In [25], the authors propose a framework designed for scalable indoor localization and implement it using UWB radios. The work in [25] is focused on the software, which enables cooperation between both fixed and mobile nodes in order to achieve seamless localization. In comparison, we focus on the specific TDOA localization algorithm, which enables scalable and accurate localization.…”
Section: A Scalable Uwb Localizationmentioning
confidence: 99%
“…where each argument λ ( ) comprises certain parameter vectors λ d , and each λ d can appear in several λ ( ) . The factorization (28) can be represented by a factor graph, which is constructed as follows: each parameter variable λ d is represented by a variable node; each factor κ (•) is represented by a factor node; and variable node "λ d " and factor node "κ " are adjacent, i.e., connected by an edge, if λ d is an argument of κ (•).…”
Section: A Sum-product Algorithm: Overview and Notationmentioning
confidence: 99%
“…The SPA algorithm aims at computing the marginal posterior pdfs f (λ d |π) in an efficient way, and is based on the factor graph representing the factorization of f (λ|π) in (28). For each node in the factor graph, certain messages are calculated, each of which is then passed to one of the adjacent nodes.…”
Section: A Sum-product Algorithm: Overview and Notationmentioning
confidence: 99%