2021
DOI: 10.1109/tac.2020.2999022
|View full text |Cite
|
Sign up to set email alerts
|

A Probabilistic Framework for Moving-Horizon Estimation: Stability and Privacy Guarantees

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

2021
2021
2023
2023

Publication Types

Select...
3
3
1

Relationship

1
6

Authors

Journals

citations
Cited by 8 publications
(21 citation statements)
references
References 23 publications
0
21
0
Order By: Relevance
“…At each time step k, the system state is perturbed by a uniform distribution over [−0.001, 0.001] 2 . The distribution of initial conditions is given by a truncated Gaussian mixture with mean vector (5, 0, 0, 2.5) and such that diam(K 0 ) in Theorem 4 of [9] is 0.1.…”
Section: Methodsmentioning
confidence: 99%
See 3 more Smart Citations
“…At each time step k, the system state is perturbed by a uniform distribution over [−0.001, 0.001] 2 . The distribution of initial conditions is given by a truncated Gaussian mixture with mean vector (5, 0, 0, 2.5) and such that diam(K 0 ) in Theorem 4 of [9] is 0.1.…”
Section: Methodsmentioning
confidence: 99%
“…1) Obtain a tractable, numerical test procedure to evaluate the differential privacy of an estimator; while providing quantifiable performance guarantees of its correctness. 2) Verify numerically the differential-privacy guarantees of the W 2 -MHE filter of [9]; and compare its performance with that of an extended Kalman filter. 3) Evaluate the differences in privacy/estimation when the perturbations are directly applied to the sensor data before the filtering process is done.…”
Section: Problem Formulationmentioning
confidence: 99%
See 2 more Smart Citations
“…Finally, blowfish privacy [84,86], use a "policy graph" specifying which pairs of tuple values must be protected. Others use a "distance function" between datasets, and neighbors are defined as datasets a distance lower than a given threshold; this is the case for DP under a ∆-neighborhood, introduced in [63] and adjacent DP, introduced in [108]. This distance can also be defined as the sensitivity of the mechanism, like in sensitivity induced DP [142], or implicitly defined by a set of constraints, like in induced DP [105].…”
Section: Extensionsmentioning
confidence: 99%