Sensor Selection via Convex Optimization

被引:906
|
作者
Joshi, Siddharth [1 ]
Boyd, Stephen [1 ]
机构
[1] Stanford Univ, Dept Elect Engn, Stanford, CA 94305 USA
关键词
Convex optimization; experiment design; sensor selection; ORBIT MODAL IDENTIFICATION; PLACEMENT; DESIGNS;
D O I
10.1109/TSP.2008.2007095
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We consider the problem of choosing a set of k sensor measurements, from a set or m possible or potential sensor measurements, that minimizes the error in estimating some parameters. Solving this problem by evaluating the performance for each of the ((m)(k)) possible choices or sensor measurements is not practical unless m and k are small. In this paper, we describe a heuristic, based on convex optimization, for approximately solving this problem. Our heuristic gives a subset selection as well as a bound on the best performance that can be achieved by any selection of k sensor measurements. There is no guarantee that the gal) between the performance of the chosen subset and the performance bound is always small, but numerical experiments suggest that the gap is small in many cases. Our heuristic method requires on the order of m(3) operations; for m = 1000 possible sensors, we can carry out sensor selection in a few seconds on a 2-GHz personal computer.
引用
收藏
页码:451 / 462
页数:12
相关论文
共 50 条
  • [1] Sensor Selection via Convex Optimization in Remote Contact-free Measurement of Currents
    Ghasemifard, Fatemeh
    Norgren, Martin
    [J]. 2017 INTERNATIONAL APPLIED COMPUTATIONAL ELECTROMAGNETICS SOCIETY SYMPOSIUM - ITALY (ACES), 2017,
  • [2] Strategies for Distributed Sensor Selection Using Convex Optimization
    Altenbach, Fabian
    Corroy, Steven
    Boecherer, Georg
    Mathar, Rudolf
    [J]. 2012 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2012,
  • [3] Beam-pattern synthesis for circular arrays with sensor selection for WBAN via convex optimization
    Du, Yu
    Hu, Fengye
    Xiong, Wei
    Liu, Xiaolan
    [J]. 2016 IEEE 83RD VEHICULAR TECHNOLOGY CONFERENCE (VTC SPRING), 2016,
  • [4] Stochastic sensor scheduling via distributed convex optimization
    Li, Chong
    Elia, Nicola
    [J]. AUTOMATICA, 2015, 58 : 173 - 182
  • [5] SLOPE-ADAPTIVE VARIABLE SELECTION VIA CONVEX OPTIMIZATION
    Bogdan, Malgorzata
    van den Berg, Ewout
    Sabatti, Chiara
    Su, Weijie
    Candes, Emmanuel J.
    [J]. ANNALS OF APPLIED STATISTICS, 2015, 9 (03): : 1103 - 1140
  • [6] LATENT VARIABLE GRAPHICAL MODEL SELECTION VIA CONVEX OPTIMIZATION
    Chandrasekaran, Venkat
    Parrilo, Pablo A.
    Willsky, Alan S.
    [J]. ANNALS OF STATISTICS, 2012, 40 (04): : 1935 - 1967
  • [7] A Convex Optimization Approach to Worst-Case Optimal Sensor Selection
    Wang, Yin
    Sznaier, Mario
    Dabbene, Fabrizio
    [J]. 2013 IEEE 52ND ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC), 2013, : 6353 - 6358
  • [8] Optimal sensor selection via proximal optimization algorithms
    Zare, Armin
    Jovanovic, Mihailo R.
    [J]. 2018 IEEE CONFERENCE ON DECISION AND CONTROL (CDC), 2018, : 6514 - 6519
  • [9] LARGE-SCALE REGULARIZED PORTFOLIO SELECTION VIA CONVEX OPTIMIZATION
    Zhao, Ziping
    Palomar, Daniel P.
    [J]. 2019 7TH IEEE GLOBAL CONFERENCE ON SIGNAL AND INFORMATION PROCESSING (IEEE GLOBALSIP), 2019,
  • [10] Key Nodes Selection in Controlling Complex Networks via Convex Optimization
    Ding, Jie
    Wen, Changyun
    Li, Guoqi
    Chen, Zhenghua
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2021, 51 (01) : 52 - 63