Sensor selection via convex optimization

IEEE Transactions on Signal Processing

Volumn 57, Issue 2, 2009, Pages 451-462

  Joshi, Siddharth ^a   Boyd, Stephen ^a  

^a Stanford University   (United States)

Author keywords

Convex optimization; Experiment design; Sensor selection

Indexed keywords

EXPERIMENTS; HEURISTIC METHODS; OPTIMIZATION; PARAMETER ESTIMATION; PERSONAL COMPUTERS; SENSORS;

EXPERIMENT DESIGN; NUMERICAL EXPERIMENTS; PERFORMANCE BOUNDS; POTENTIAL SENSORS; SENSOR MEASUREMENTS; SENSOR SELECTION; SUBSET SELECTIONS;

CONVEX OPTIMIZATION;

EID: 60549088916     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2008.2007095     Document Type: Article

References (45)

1. C. Guestrin, A. Krause, and A. Singh, "Near-optimal sensor placements in Gaussian processes," School of Computer Science, Carnegie Mellon Univ., Pittsburgh, PA, Tech. Rep., 2005.
2. G. Hovland and B. McCarragher, "Dynamic sensor selection for robotic systems," in Proc. IEEE Int. Conf. Robotics Automation, 1997, vol. 1, pp. 272-277.
3. D. Kammer, "Sensor placement for on-orbit modal identification and correlation of large space structures," J. Guid., Control, Dynam. vol. 14, pp. 251-259, 1991.
4. K. Kincaid and S. Padula, "D-optimal designs for sensor and actuator locations," Compute. Oper. Res., vol. 29, no. 6, pp. 701-713, 2002.
5. H. Wang, K. Yao, G. Pottie, and D. Estrin, "Entropy-based sensor selection heuristic for target localization," in Proc. 3rd Int. Symp. Information Processing in Sensor Networks, Berkeley, CA, 2004, pp. 36-45.
6. V. Isler and R. Bajcsy, "The sensor selection problem for bounded uncertainty sensing models," in Proc. 4th Int. Symp. Information Processing in Sensor Networks, Los Angeles, CA, 2005.
7. K. Kookos and J. Perkins, "A systematic method for optimum sensor selection in inferential control systems," Ind. Eng. Chem. Res., vol. 38, no. 11, pp. 4299-4308, 1999.
8. F. Zhao and L. Guibas, Wireless Sensor Networks: An Information Processing Approach. San Mateo, CA: Morgan Kaufmann, 2004.
9. V. Gupta, T. Chung, B. Hassibi, and R. Murray, "On a stochastic sensor selection algorithm with applications in sensor scheduling and sensor coverage," Automatica, vol. 42, no. 2, pp. 251-260, 2006.
10. M. Kalandros and L. Pao, "Controlling target estimate covariance in centralized multi-sensor systems," in Proc. Amer. Control Conf., 1998, vol. 5.
11. Y. Oshman, "Optimal sensor selection strategy for discrete-time state estimators," IEEE Trans. Aerosp. Electron. Syst., vol. 30, no. 2, pp. 307-314, Apr. 1994.
12. H. Rowaihy, S. Eswaran, M. Johnson, D. Verma, A. Bar-Noy, T. Brown, and T. L. Porta, "A survey of sensor selection schemes in wireless sensor networks," in Proc. SPIE, 2007, vol. 6562.
13. R. Debouk, S. Lafortune, and D. Teneketzis, "On an optimization problem in sensor selection," Discrete Event Dynam. Syst., vol. 12, no. 4, pp. 417-445, 2002.
14. S. Jiang, R. Kumar, and H. Garcia, "Optimal sensor selection for discrete-event systems with partial observation," IEEE Trans. Autom. Control, vol. 48, no. 3, pp. 369-381, Mar. 2003.
15. L. Yao, W. Sethares, and D. Kammer, "Sensor placement for on-orbit modal identification via a genetic algorithm," Amer. Inst. Aeronaut. Astronaut. J., vol. 31, no. 10, pp. 1922-1928, 1993.
16. M. Chu, H. Haussecker, and F. Zhao, "Scalable information-driven sensor querying and routing for ad hoc heterogeneous sensor networks," Int. J. High Perform. Comput. Appl., vol. 16, no. 3, p. 293, 2002.
17. J. Manyika and H. Durrant-Whyte, Data Fusion and Sensor Management: A Decentralized Information-Theoretic Approach. Upper Saddle River, NJ: Prentice-Hall PTR, 1995.
18. E. Ertin, J. Fisher, and L. Potter, "Maximum mutual information principle for dynamic sensor query problems," in Proc. IPSN, 2003, vol. 3.
19. F. Zhao, J. Shin, and J. Reich, "Information-driven dynamic sensor collaboration for tracking applications," IEEE Signal Process. Mag, vol. 19, no. 2, pp. 61-72, 2002.
20. S. Crary and Y. Jeong, "Bayesian optimal design of experiments for sensor calibration," in Proc. 8th Int. Conf. Solid-State Sensors Actuators and Eurosensors IX. Transducers, 1995, vol. 2.
21. C. Giraud and B. Jouvencel, "Sensor selection: A geometrical approach," in Proc. IEEE/RSJ Int. Conf. Intelligent Robots Systems 1995, vol. 2.
22. F. Bian, D. Kempe, and R. Govindan, "Utility based sensor selection," in Proc. 5th Int. Conf. Information Processing Sensor Networks, Nashville, TN, 2006, pp. 11-18.
23. W. Welch, "Branch-and-bound search for experimental designs based on D-optimality and other criteria," Technometrics, vol. 24, no. 1, pp. 41-48, 1982.
24. E. L. Lawler and D. E. Wood, "Branch-and-bound methods: A survey," Oper. Res., vol. 14, pp. 699-719, 1966.
25. N. Nguyen and A. Miller, "A review of some exchange algorithms for constructing discrete D-optimal designs," Comput. Statist. Data Anal., vol. 14, pp. 489-498, 1992.
26. R. John and N. Draper, "D-Optimality for regression designs: A review," Technometrics, vol. 17, no. 1, pp. 15-23, 1975.
27. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 1995.
28. F. Pukelsheim, Optimal Design of Experiments. Philadelphia, PA: SIAM, 2006.
29. V. Fedorov, Theory of Optimal Experiments. New York: Academic, 1972.
30. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
31. D. L. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1289-1306, Apr. 2006.
32. R. Tibshirani, "Regression shrinkage and selection via the lasso," J. Roy. Statist. Soc. Series B (Methodological), vol. 58, no. 1, pp. 267-288, 1996.
33. J. Tropp, "Just relax: Convex programming methods for identifying sparse signals in noise," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 1030-1051, Mar. 2006.
34. J. Feldman, D. Karger, and M. Wainwright, "LP decoding," in Proc. 41st Allerton Conf. Communications, Control, Computing, Oct. 2003, pp. 1-3.
35. M. Lobo, M. Fazel, and S. Boyd, "Portfolio optimization with linear and fixed transaction costs," Ann. Oper. Res., vol. 152, no. 1, pp. 341-365, 2007.
36. A. Hassibi, J. How, and S. Boyd, "Low-authority controller design via convex optimization," in Proc. 37th IEEE Confe. Decision Control, 1998, vol. 1.
37. L. Vandenberghe, S. Boyd, and A. E. Gamal, "Optimal wire and transistor sizing for circuits with non-tree topology," in Proc. 1997 IEEE/ACM Int. Conf. Computer Aided Design, 1997, pp. 252-259.
38. P. Sun and R. Freund, "Computation of minimum-volume covering ellipsoids," Oper. Res., vol. 52, no. 5, pp. 690-706, 2004.
39. A. Dolia, S. Page, N. White, and C. Harris, "D-optimality for minimum volume ellipsoid with outliers," in Proc. 7th Int. Conf. Signal/Image Processing Pattern Recognition, 2004, pp. 73-76.
40. A. Miller and J. Nguyen, "Algorithm AS 295: A Fedorov exchange algorithm for D-optimal design," Appl. Statist., vol. 43, no. 4, pp. 669-677, 1994.
41. H. Wynn, "Results in the theory and construction of D-optimum experimental designs," J. Roy. Statist. Soc. Series B (Methodological), vol. 34, no. 2, pp. 133-147, 1972.
42. R. Hettich and K. Kortanek, "Semi-infinite programming: Theory, methods, and applications," SIAM Rev., vol. 35, no. 5, pp. 380-429, 1993.
43. A. Mutapcic and S. Boyd, Cutting-Set Methods for Robust Convex Optimization With Worst-Case Oracles 2007 [Online.] Available: www.stanford.edu/~boyd/papers/prac robust.html
44. Z. Luo, J. Sturm, and S. Zhang, "Multivariate nonnegative quadratic mappings," SIAM J. Optim., vol. 14, no. 4, pp. 1140-1162, 2004.
45. M. Grant, S. Boyd, and Y. Ye, CVX Version 1.1. Matlab Software for Disciplined Convex Programming 2007 [Online]. Available: www.stanford.edu/~boyd/cvx/.