Adaptive Threshold Selection for Set Membership State Estimation with Quantized Measurements
State estimation for discrete-time linear systems with quantized measurements is addressed. By exploiting the set-theoretic nature of the information provided by the quantizer, the problem is cast in the set membership estimation setting. Motivated by the possibility of suitably tuning the quantizer thresholds in sensor networks, the optimal design of adaptive quantizers is formulated in terms of the minimization of the radius of information associated to the state estimation problem. The optimal solution is derived for first-order systems and the result is exploited to design adaptive quantizers for generic systems, minimizing the size of the feasible output signal set. Then, the minimum number of sensor thresholds for which the adaptive quantizers guarantee asymptotic boundedness of the state estimation uncertainty is established. Threshold adaptation mechanisms based on several types of outer approximations of the feasible state set are also proposed. The effectiveness of the designed adaptive quantizers is demonstrated on numerical tests involving a specific case study and randomly generated systems, highlighting the trade off between the resulting estimation uncertainty and the computational burden required by recursive set approximations.
Code (0)
등록된 구현이 없습니다.
Tasks
State EstimationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Learning Boolean Halfspaces with Small Weights from Membership Queries
We consider the problem of proper learning a Boolean Halfspace with integer weights $\{0,1,\ldots,t\}$ from membership queries only. The best known algorithm for this problem is an adaptive algorithm that asks $n^{O(t^5)…
A useful criterion on studying consistent estimation in community detection
In network analysis, developing a unified theoretical framework that can compare methods under different models is an interesting problem. This paper proposes a partial solution to this problem. We summarize the idea of …
Community DetectionStochastic Block ModelCascading and Proxy Membership Inference Attacks
A Membership Inference Attack (MIA) assesses how much a trained machine learning model reveals about its training data by determining whether specific query instances were included in the dataset. We classify existing MI…
Null-Calibrated Conformal Selection via Target-Membership Scores
Conformal selection aims to identify test candidates whose unknown responses fall in a target region while controlling the false discovery rate. Existing methods often inherit prediction-oriented nonconformity scores, su…
Chameleon: Increasing Label-Only Membership Leakage with Adaptive Poisoning
The integration of machine learning (ML) in numerous critical applications introduces a range of privacy concerns for individuals who provide their datasets for model training. One such privacy risk is Membership Inferen…
Data Poisoning