Pages that link to "Item:Q2409254"

The following pages link to A complete greedy algorithm for infinite-horizon sensor scheduling (Q2409254):

Displaying 11 items.

• On efficient sensor scheduling for linear dynamical systems (Q361004) (← links)
• Sensor selection for Kalman filtering of linear dynamical systems: complexity, limitations and greedy algorithms (Q518316) (← links)
• Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems (Q900693) (← links)
• Sensor scheduling for linear systems: A covariance tracking approach (Q2063846) (← links)
• A separation theorem for joint sensor and actuator scheduling with guaranteed performance bounds (Q2207184) (← links)
• A risk-based multisensor optimization scheduling method for target threat assessment (Q2298150) (← links)
• On infinite-horizon sensor scheduling (Q2454152) (← links)
• On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage (Q2491909) (← links)
• (Q4630509) (← links)
• Sensor selection for remote state estimation with QoS requirement constraints (Q6073042) (← links)
• Control and communication scheduling co-design for networked control systems: a survey (Q6099275) (← links)