Optimal capacity allocation for sampled networked systems
From MaRDI portal
Abstract: We consider the problem of estimating the states of weakly coupled linear systems from sampled measurements. We assume that the total capacity available to the sensors to transmit their samples to a network manager in charge of the estimation is bounded above, and that each sample requires the same amount of communication. Our goal is then to find an optimal allocation of the capacity to the sensors so that the average estimation error is minimized. We show that when the total available channel capacity is large, this resource allocation problem can be recast as a strictly convex optimization problem, and hence there exists a unique optimal allocation of the capacity. We further investigate how this optimal allocation varies as the available capacity increases. In particular, we show that if the coupling among the subsystems is weak, then the sampling rate allocated to each sensor is nondecreasing in the total sampling rate, and is strictly increasing if and only if the total sampling rate exceeds a certain threshold.
Recommendations
- On controller \& capacity allocation co-design for networked control systems
- Optimal linear estimation for networked systems with communication constraints
- Optimal estimation for networked systems with communication constraints
- Switching and Learning in Feedback Systems
- Numerical approximation of the data-rate limit for state estimation under communication constraints
Cites work
- Analytic feedback control and the algebraic Riccati equation
- Approximate optimal periodic scheduling of multiple sensors with constraints
- Communication and control co-design for networked control systems
- Curvature properties of the algebraic Riccati equation
- Finite Dimensional Linear Systems
- Fundamental Limitations of Disturbance Attenuation in the Presence of Side Information
- scientific article; zbMATH DE number 44406 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- Kalman Filtering With Intermittent Observations
- Minimax estimation with intermittent observations
- On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage
- On efficient sensor scheduling for linear dynamical systems
- On the Use of Binary Programming for Sensor Scheduling
- Optimal control of LTI systems over unreliable communication links
- Optimal estimation with scheduled measurements
- Optimal Output Feedback Control Using Two Remote Sensors Over Erasure Channels
- Optimal periodic scheduling of sensor networks: a branch and bound approach
- Optimal sensor scheduling for multiple linear dynamical systems
- Optimal Sensor Scheduling in Nonlinear Filtering of Diffusion Processes
- Sensor Selection via Convex Optimization
- Simulation-based optimal sensor scheduling with application to observer trajectory planning
- Stochastic models, estimation, and control. Vol. 1
- Trade-off analysis of real-time control performance and schedulability
Cited in
(7)- Capacity allocation in generalized Jackson networks
- Perfect Sampling of Networks with Finite and Infinite Capacity Queues
- scientific article; zbMATH DE number 2088538 (Why is no real title available?)
- Optimal Sampling and Scheduling for Timely Status Updates in Multi-Source Networks
- Optimal sampling policy of multi-dimensional Wiener processes with random delivery time
- Steady state analysis for Kalman filters with Poisson-sampled observations
- Maximizing residual capacity in connection-oriented networks
This page was built for publication: Optimal capacity allocation for sampled networked systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1679839)
