Near-optimal observation selection using submodular functions

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2007, Pages 1650-1654

  Krause, Andreas ^a   Guestrin, Carlos ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MONITORING ENVIRONMENTAL PHENOMENA; NEAR OPTIMAL OBSERVATION; SUBMODULARITY PROPERTY; WATER DISTRIBUTION NETWORKS;

CONSTRAINT THEORY; COST REDUCTION; MOBILE ROBOTS; PROBLEM SOLVING; SENSOR NETWORKS; SET THEORY;

ROBOTICS;

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

References (20)

1. Bai, X.; Kumar, S.; Yun, Z.; Xuan, D.; and Lai, T. H. 2006. Deploying wireless sensors to achieve both coverage and connectivity. In MobiHoc.
2. Chekuri, C., and Pal, M. 2005. A recursive greedy algorithm for walks in directed graphs. In FOCS, 245-253.
3. Cressie, N. A. C. 1991. Statistics for Spatial Data. Wiley.
4. Dhariwal, A.; Zhang, B.; Stauffer, B.; Oberg, C.; Sukhatme, G. S.; Caron, D. A.; and Requicha, A. A. 2006. Networked aquatic microbial observing system. In ICRA.
5. Guestrin, C.; Krause, A.; and Singh, A. 2005. Near-optimal sensor placements in Gaussian processes. In ICML.
6. Hoi, S. C. H.; Jin, R.; Zhu, J.; and Lyu, M. R. 2006. Batch mode active learning and its application to medical image classification. In ICML.
7. Kempe, D.; Kleinberg, J.; and Tardos, E. 2003. Maximizing the spread of influence through a social network. In KDD.
8. Krause, A., and Guestrin, C. 2005a. A note on the budgeted maximization of submodular functions. Technical report, CMU-CALD-05-103.
9. Krause, A., and Guestrin, C. 2005b. Optimal nonmyopic value of information in graphical models - efficient algorithms and theoretical limits. In Proc. of IJCAI.
10. Krause, A., and Guestrin, C. 2005c. Near-optimal value of information in graphical models. In UAI.
11. Krause, A.; Guestrin, C.; Gupta, A.; and Kleinberg, J. 2006. Near-optimal sensor placements: Maximizing information while minimizing communication cost. In IPSN.
12. Krause, A.; Leskovec, J.; Guestrin, C.; VanBriesen, J.; and Faloutsos, C. 2007. Efficient sensor placement optimization for securing large water distribution networks. Submitted to the Journal of Water Resources Planning an Management.
13. Nemhauser, G. L., and Wolsey, L. A. 1981. Studies on Graphs and Discrete Programming. North-Holland, chapter Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms, 279-301.
14. Nemhauser, G.; Wolsey, L.; and Fisher, M. 1978. An analysis of the approximations for maximizing submodular set functions. Mathematical Programming 14:265-294.
15. Robertazzi, T. G., and Schwartz, S. C. 1989. An accelerated sequential algorithm for producing D-optimal designs. SIAM Journal of Scientific and Statistical Computing 10(2):341-358.
16. Rossman, L. A. 1999. The epanet programmer's toolkit for analysis of water distribution systems. In Annual Water Resources Planning and Management Conference.
17. Sim, R., and Roy, N. 2005. Global a-optimal robot exploration in slam. In ICRA.
18. Singh, A.; Krause, A.; Guestrin, C.; Kaiser, W.; and Batalin, M. 2007. Efficient planning of informative paths for multiple robots. In IJCAI.
19. Sviridenko, M. 2004. A note on maximizing a submodular set function subject to knapsack constraint. Ops Res Lett 32:41-43.
20. Zheng, A. X.; Rish, L; and Beygelzimer, A. 2005. Efficient test selection in active diagnosis via entropy approximation. In UAI.