Adaptive sampling for linear state estimation
From MaRDI portal
Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15) Estimation and detection in stochastic control theory (93E10) Least squares and related methods for stochastic control systems (93E24) Sampling theory in information and communication theory (94A20) Source coding (94A29)
Abstract: When a sensor has continuous measurements but sends limited messages over a data network to a supervisor which estimates the state, the available packet rate fixes the achievable quality of state estimation. When such rate limits turn stringent, the sensor's messaging policy should be designed anew. What are the good causal messaging policies ? What should message packets contain ? What is the lowest possible distortion in a causal estimate at the supervisor ? Is Delta sampling better than periodic sampling ? We answer these questions under an idealized model of the network and the assumption of perfect measurements at the sensor. For a scalar, linear diffusion process, we study the problem of choosing the causal sampling times that will give the lowest aggregate squared error distortion. We stick to finite-horizons and impose a hard upper bound on the number of allowed samples. We cast the design as a problem of choosing an optimal sequence of stopping times. We reduce this to a nested sequence of problems each asking for a single optimal stopping time. Under an unproven but natural assumption about the least-square estimate at the supervisor, each of these single stopping problems are of standard form. The optimal stopping times are random times when the estimation error exceeds designed envelopes. For the case where the state is a Brownian motion, we give analytically: the shape of the optimal sampling envelopes, the shape of the envelopes under optimal Delta sampling, and their performances. Surprisingly, we find that Delta sampling performs badly. Hence, when the rate constraint is a hard limit on the number of samples over a finite horizon, we should should not use Delta sampling.
Recommendations
- State estimation with remote sensors and intermittent transmissions
- A Constant Factor Approximation Algorithm for Event-Based Sampling
- Sensor scheduling over a packet-delaying network
- Remote state estimation with usage-dependent Markovian packet losses
- State estimation over a communication network: measurement or estimate communication?
Cited in
(15)- Adaptive high-gain -tracking with variable sampling rate
- Global sampling for sequential filtering over discrete state space
- Asymptotically optimal parameter estimation under communication constraints
- Event-triggered robust state estimation for systems with unknown exogenous inputs
- On signalling and estimation limits for molecular birth-processes
- On time-triggered and event-based control of integrator systems over a shared communication system
- Event-based state estimation of linear dynamic systems with unknown exogenous inputs
- Measure-adaptive state-space construction
- An event-triggered approach to state estimation with multiple point- and set-valued measurements
- A bi-level approach for the design of event-triggered control systems over a shared network
- Event-triggered maximum likelihood state estimation
- Event-triggered distributed estimation with decaying communication rate
- Try-once-discard scheduling for stochastic networked control systems
- Optimal sampling policy of multi-dimensional Wiener processes with random delivery time
- Event-based state estimation of discrete-state hidden Markov models
This page was built for publication: Adaptive sampling for linear state estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2903499)
