2014
DOI: 10.1109/twc.2014.2314662
|View full text |Cite
|
Sign up to set email alerts
|

On the Trade-Off Between Accuracy and Delay in Cooperative UWB Localization: Performance Bounds and Scaling Laws

Abstract: Abstract-Ultra-wide bandwidth (UWB) systems allow for accurate positioning in environments where global navigation satellite systems may fail, especially when complemented with cooperative processing. While cooperative UWB has led to centimeter-level accuracies, the communication overhead is often neglected. We quantify how accuracy and delay trade off in a wide variety of operation conditions. We also derive the asymptotic scaling of accuracy and delay, indicating that in some conditions, standard cooperation… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
21
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
3
2
2

Relationship

3
4

Authors

Journals

citations
Cited by 22 publications
(21 citation statements)
references
References 33 publications
0
21
0
Order By: Relevance
“…This is a simple model for time-of-arrival distance measure ments [28]. We set 0" 5 = 50, K, = 2, and d o = 50.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…This is a simple model for time-of-arrival distance measure ments [28]. We set 0" 5 = 50, K, = 2, and d o = 50.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…So selecting the anchor nodes to determine position of node is a big task.The Cramer Rao bound (CRB) used to discard vain links [8]. Rather than depend on proximity as a criterion, [9] proposed to use a preset number of links that give lowest CRB. In [10][11] the authors proposed to use the CRB to select those anchors that would give the best positioning accuracy.…”
Section: Figure 1 Cooperative Networkmentioning
confidence: 99%
“…Note that constraints (8d)-(8f) should be met for all k, and that M k is a function of A (see (6)). Relaxing the integer constraint (8c) to the box constraint A ∈ [0, 1] M×N leads to a standard semi-definite program (SDP), which can be solved efficiently and optimally using standard tools.…”
Section: Theorem 1 (Lower Bound) Problem (3) Can Be Relaxed To Minimizementioning
confidence: 99%
“…Such situational awareness is generally achieved through simultaneous localization and mapping (SLAM) [3] and localization using heterogeneous sensor fusion [4]. While research on situational awareness has traditionally focused on improving the localization accuracy, the focus has now shifted to localization methods that are cognitive with respect to energy and communication constraints as well as the agent's higher-level task [5], [6]. For instance, a higher-level task may be the navigation/manipulation of the robot in the environment form its current position to its intended final position.…”
Section: Introductionmentioning
confidence: 99%