The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Greedy sensor selection: Leveraging submodularity
Abstract
We consider the problem of sensor selection in resource constrained sensor networks. The fusion center selects a subset of k sensors from an available pool of m sensors according to the maximum a posteriori or the maximum likelihood rule. We cast the sensor selection problem as the maximization of a submodular function over uniform matroids, and demonstrate that a greedy sensor selection algorithm achieves performance within (1 - 1/e ) of the optimal solution. The greedy algorithm has a complexity of O(n3mk), where n is the dimension of the measurement space. The complexity of the algorithm is further reduced to O(n2mk) by exploiting certain structural features of the problem. An application to the sensor selection in linear dynamical systems where the fusion center employs Kalman filtering for state estimation is considered. Simulation results demonstrate the superior performance of the greedy sensor selection algorithm over competing techniques based on convex relaxation.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Horn, R. A., & Johnson, C. R. (1985) · Cited by 22,203
Sensor Selection via Convex Optimization
Joshi, S., & Boyd, S. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2007095 · Cited by 1,311
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
Calinescu, G., Chekuri, C., Pál, M., & Vondrák, J. (2011) · SIAM Journal on Computing · doi:10.1137/080733991 · Cited by 795
Best Algorithms for Approximating the Maximum of a Submodular Set Function
Nemhauser, G. L., & Wolsey, L. A. (1978) · Mathematics of Operations Research · doi:10.1287/moor.3.3.177 · Cited by 538
Near-optimal observation selection using submodular functions
Krause, A., & Guestrin, C. (2007) · Cited by 281
Optimal sensor selection strategy for discrete-time state estimators
Oshman, Y. (1994) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/7.272256 · Cited by 88
Cited by
Sparsity-Promoting Sensor Selection for Non-Linear Measurement Models
Chepuri, S. P., & Leus, G. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2379662 · Cited by 288
Metadata
- Authors
- Shamaiah, M., Banerjee, S., & Vikalo, H.
- Venue
- 49th IEEE Conference on Decision and Control (CDC)
- Publisher
- IEEE
- Published
- 2010-12
- Pages
- 2572-2577
- ISSN
- 0191-2216 (ISSN-L)
- OpenAlex
- W2100729440
- Cited by
- 298
- References
- 7
- FWCI
- 4.34
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Greedy sensor selection: Leveraging submodularity. https://app.cochat.ai/papers/10.1109/cdc.2010.5717225
- The paper
- Shamaiah, M., Banerjee, S., & Vikalo, H. (2010). Greedy sensor selection: Leveraging submodularity. 49th IEEE Conference on Decision and Control (CDC). https://doi.org/10.1109/cdc.2010.5717225
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.