2019
DOI: 10.1016/j.automatica.2019.108578
|View full text |Cite
|
Sign up to set email alerts
|

Scheduling networked state estimators based on Value of Information

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
35
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 28 publications
(36 citation statements)
references
References 14 publications
0
35
0
Order By: Relevance
“…determined from (17). Furthermore, the probability of successful transmission over each wireless link is known and timeinvariant.…”
Section: B Stability Analysismentioning
confidence: 99%
See 2 more Smart Citations
“…determined from (17). Furthermore, the probability of successful transmission over each wireless link is known and timeinvariant.…”
Section: B Stability Analysismentioning
confidence: 99%
“…Try-once-discard (TOD) is one of the most well-known schemes of this type which, at each frame, allocates the channels to the subsystems with the largest discrepancy between the true and estimated state values [15]. For the linear quadratic Gaussian (LQG) control problem, value of information (VoI), which contained the current observations for the network [16], was proposed as the priority measure and algorithms were provided for determining the priorities by using a rollout strategy [16], [17]. Equivalently, the term cost of information loss (CoIL) was coined in [18] for the cost of losing information for a general setup and, unlike the VoI in [16], [17], it is associated with the statistical properties of the observations.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Over the last two decades, there have been many attempts from the control and the communication communities to develop, evaluate, and improve such utility functions compared to the conventional fixed-period and randomized data coordination approaches. Notions such as Value-of-Information (VoI) [7,8], Age-of-Information (AoI) [9,10], and Event-Triggered (ET) [11,12], are metrics that have been separately shown to be capable of coordinating information distribution, taking into account the integrated and coupled context of NCSs. Traditionally, however, two rather distinct paths on addressing the NCS design have been followed: From the communication perspective, the focus mainly results in the design approaches that maximize the network throughput or minimize the end-to-end latency and jitter often ignoring the dynamics, requirements, and characteristics of the sending and receiving entities and the specific data that are being transmitted [13][14][15].…”
Section: Introductionmentioning
confidence: 99%
“…distributed observers can be consulted in [14]. Regarding to Kalman filters, in [15], a decentralized Kalman filter is used to address the localization of a multiple-robot problem; [16] discusses three distributed Kalman filter algorithms, one of them focused on a cooperative and recursive estimation that combines the consensus strategy and Kalman filtering; [17] focuses on the scheduling of data in a networked system; and [18] develops a method based on linear matrix inequalities (LMIs) to compute the Kalman filter, being this method implemented in [19] for multi-robot localization purposes. Note that LMIs have become a major way of formulating a vast variety of control and estimation problems [20].…”
mentioning
confidence: 99%