Approximate optimal periodic scheduling of multiple sensors with constraints
From MaRDI portal
Publication:2445166
DOI10.1016/j.automatica.2013.01.024zbMath1285.93098OpenAlexW2036490610MaRDI QIDQ2445166
Publication date: 14 April 2014
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2013.01.024
dynamic programmingRiccati equationstraveling salesman problemKalman filterswireless sensor networks
Filtering in stochastic control theory (93E11) Dynamic programming in optimal control and differential games (49L20) Stochastic scheduling theory in operations research (90B36)
Related Items (8)
Optimal sensor scheduling for multiple linear dynamical systems ⋮ A complete greedy algorithm for infinite-horizon sensor scheduling ⋮ Optimal multiple-sensor scheduling for general scalar Gauss-Markov systems with the terminal error ⋮ Optimal capacity allocation for sampled networked systems ⋮ Sensor selection for remote state estimation with QoS requirement constraints ⋮ Multi-channel transmission scheduling with hopping scheme under uncertain channel states ⋮ An event-triggered approach to state estimation with multiple point- and set-valued measurements ⋮ On fractional derivatives and primitives of periodic functions
This page was built for publication: Approximate optimal periodic scheduling of multiple sensors with constraints