Sensor selection for active information fusion

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2005, Pages 1229-1234

  Zhang, Yongmian ^a   Ji, Qiang ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH-THEORETIC APPROACH; INFORMATION GATHERING; SENSOR SELECTION; SUBSETS;

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER SCIENCE; COST EFFECTIVENESS; GRAPH THEORY; INFORMATION TECHNOLOGY; THEOREM PROVING;

SENSOR DATA FUSION;

EID: 29344436763     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Castanon, D. A. 1997. Approximate dynamic programming for sensor management. In Proc. of the 36th IEEE Conf. on Decision and Control, 1202-1207.
2. Cover, T. M., and Thomas, J. A. 1991. Elements of Information Theory. New York, NY, USA: John Wiley and Son.
3. Das, B. 1999. Representting uncertainties using bayesian networks. Technical Report DSTO-TR-0918, DSTO Electronics and Surveillance Research Laboratory, Salisbury South Australia 5108, Australia.
4. Denzler, J., and Brown, C. M. 2002. Information theoretic sensor data selection for active object recognition and state estimation. IEEE Trans. Pattern Anal. Machine Intell. 24(2):145-157.
5. Ertin, E.; Fisher, J.; and Potter, L. 2003. Maximum mutual information principle for dynamic sensor query. In Proc. IPSN'03.
6. Fassinut-Mombot, B., and Choquel, J.-B. 2004. A new probabilistic and entropy fusion approach for management of information sources. Information Fusion 5:35-47.
7. Heckerman, D.; Horvitz, E.; and Middleton, B. 1993. An approximate nonmyopic computation for value of information. IEEE Trans. on PAMI 15(3):292-298.
8. Kalandros, M.; Pao, L.; and Ho, Y.-C. 1999. Randomization and super-heuristics in choosing sensor sets for target tracking applications. 1803-1808.
9. Keeney, R. L., and Raiffa, H. 1993. Decision with Multiple Objectives: Preferences and Value Tradeoffs. Cambridge, United Kingdom: The University of Cambridge.
10. Krishnamurthy, V. 2002. Algorithms for optimal scheduling and management of Hidden Markov Model sensors. IEEE Trans. on Signal Processing 50(6):1382-1397.
11. Kristensen, S. 1997. Sensor planning with bayesian decision theory. Robotics and Autonomous Systems 19(3):273-286.
12. Liao, W.; Zhang, W.; and Ji, Q. 2004. A factor tree inference algorithm for bayesian networks and its application. In the 16th IEEE Intl Conf. on Tools with Artificial Intelligence.
13. Logothetis, A., and Isaksson, A. 1999. On sensor scheduling via information theoretic criteria. In Proc. the American Control Conf., 2402-2406.
14. Miller, B. M., and Runggaldier, W. J. 1997. Optimization of observations: a stochastic control approach. SIAM J. Control Optimal 35(5):1030-1052.
15. Oliver, N., and Horvitz, E. 2003. Selective perception policies for guiding sensing and computation in multimodal systems: A comparative analysis. In Proc. the 5th ICML.
16. Paletta, L., and Pinz, A. 2000. Active object recognition by view integration and reinforcement learning. Robotics and Autonomous System (31):71-86.
17. Waltz, E., and Llinas, J. 1990. Multisensor Data Fusion. Boston, USA: Artech House.
18. Zhao, F.; Shin, J.; and Reich, J. 2002. Information-driven dynamic sensor collaboration for tracking application. IEEE Signal Processing Magazine 19(1):61-72.