Optimal periodic scheduling of sensor networks: a branch and bound approach (Q2637590): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.sysconle.2013.04.012 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1994980584 / rank | |||
Normal rank | |||
Revision as of 01:33, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal periodic scheduling of sensor networks: a branch and bound approach |
scientific article |
Statements
Optimal periodic scheduling of sensor networks: a branch and bound approach (English)
0 references
12 February 2014
0 references
wireless sensor networks
0 references
Riccati equations
0 references
Kalman filters
0 references
branch and bound
0 references
optimal periodic scheduling
0 references
approximate cost function
0 references
arbitrary nonzero suboptimality specification
0 references
notion of periodic detectability
0 references
average prediction error variance
0 references
approximation error
0 references
state estimation
0 references
communication constraints
0 references
manageable computation effort
0 references
symmetric periodic positive-semidefinite
0 references
SPPS solutions
0 references
