Nonmyopic informative path planning in spatio-temporal models

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2007, Pages 602-607

  Meliou, Alexandra ^a   Krause, Andreas ^b   Guestrin, Carlos ^b   Hellerstein, Joseph M ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CMU ^*

Author keywords

[No Author keywords available]

Indexed keywords

NONMYOPIC PLANNING; SENSING APPLICATIONS;

CONSTRAINT THEORY; DATA ACQUISITION; INFORMATION RETRIEVAL; MATHEMATICAL MODELS; OPTIMIZATION; PACKET NETWORKS; REMOTE SENSING; WIRELESS SENSOR NETWORKS;

MOTION PLANNING;

EID: 36348939268     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. Caselton, W., and Zidek, J. 1984. Optimal monitoring network design. Statistics and Probability Letters.
3. Chao, I.-M.; Golden, B. L.; and Wasil, E. A. 1996. A fast and effective heuristic for the orienteering problem. Eur J Op Res.
4. Chekuri, C., and Pal, M. 2005. A recursive greedy algorithm for walks in directed graphs. In FOCS.
5. Das, A., and Kempe, D. 2007. Algorithms for subset selection in linear regression. In under review for STOC.
6. Deshpande, A.; Guestrin, C.; Madden, S.; Hellerstein, J.; and Hong, W. 2004. Model-driven data acquisition in sensor networks. In VLDB.
7. Feige, U. 1998. A threshold of In n for approximating set cover. J. ACM 45(4).
8. Feillet, D.; Dejax, P.; and Gendreau, M. 2005. Traveling salesman problems with profits. Transportation Science 39(2).
9. Guestrin, C.; Krause, A.; and Singh, A. P. 2005. Near-optimal sensor placements in gaussian processes. In ICML.
10. Laporte, G., and Martello, S. 1990. The selective travelling salesman problem. Discrete Appl. Math. 26(2-3).
11. Liu, J.; Petrovic, D.; and Zhao, F. 2003. Multi-step information-directed sensor querying in distributed sensor networks. In ICASSP.
12. Meliou, A.; Chu, D.; Guestrin, C.; Hellerstein, J.; and Hong, W. 2006. Data gathering tours in sensor networks. In IPSN.
13. Meliou, A.; Krause, A.; Guestrin, C.; and Hellerstein, J. M. 2007. Nonmyopic informative path planning in spatio-temporal models. Technical Report UCB/EECS-2007-44, EECS, UC Berkeley.
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. Rasmussen, C. E., and Williams, C. K. 2006. Gaussian Processes for Machine Learning. Adaptive Computation and Machine Learning. The MIT Press.
16. Shewry, M., and Wynn, H. 1987. Maximum entropy sampling. J Appl Statist 14.
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. Stachniss, C.; Grisetti, C.; and Burgard, W. 2005. Information gain-based exploration using Rao-Blackwellized particle filters. In RSS.
20. Widmann, M., and Bretherton, C. S. 1999. 50km resolution daily precipitation for the pacific northwest. http://www.jisao.washington.edu/ data_sets/widmann/.