Optimal periodic scheduling of sensor networks: a branch and bound approach (Q2637590)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6257362
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal periodic scheduling of sensor networks: a branch and bound approach |
scientific article; zbMATH DE number 6257362 |
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
0 references
0 references
0.8356114625930786
0 references
0.8145192861557007
0 references
0.8095126748085022
0 references
0.8042532205581665
0 references
0.7930011749267578
0 references
