Pages that link to "Item:Q900693"
From MaRDI portal
The following pages link to Submodularity and greedy algorithms in sensor scheduling for linear dynamical systems (Q900693):
Displaying 11 items.
- Sensor selection for Kalman filtering of linear dynamical systems: complexity, limitations and greedy algorithms (Q518316) (← links)
- Optimal sensor communications in presence of transmission delays and bandwidth limitations (Q1794169) (← links)
- Sensor scheduling for linear systems: A covariance tracking approach (Q2063846) (← links)
- Optimal sensor scheduling for multiple linear dynamical systems (Q2374498) (← links)
- A complete greedy algorithm for infinite-horizon sensor scheduling (Q2409254) (← links)
- A randomized approach to sensor placement with observability assurance (Q2662304) (← links)
- Multi-hop sensor network scheduling for optimal remote estimation (Q2664226) (← links)
- Maximization of nonsubmodular functions under multiple constraints with applications (Q6110009) (← links)
- Distributed strategy selection: a submodular set function maximization approach (Q6110260) (← links)
- Submodularity-based false data injection attack scheme in multi-agent dynamical systems (Q6192962) (← links)
- An exact solution approach for the mobile multi‐agent sensing problem (Q6194842) (← links)
