Scheduling Continuous-Time Kalman Filters
From MaRDI portal
Cited in
(6)- On periodic optimal solutions of persistent sensor planning for continuous-time linear systems
- Optimal policies for observing time series and related restless bandit problems
- A restless bandit model for resource allocation, competition, and reservation
- A verification theorem for threshold-indexability of real-state discounted restless bandits
- Two-armed restless bandits with imperfect information: stochastic control and indexability
- Stochastic sensor scheduling via distributed convex optimization
This page was built for publication: Scheduling Continuous-Time Kalman Filters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347741)