Efficient Informative Sensing using Multiple Robots

Journal of Artificial Intelligence Research

Volumn 34, Issue , 2009, Pages 707-755

  Singh, Amarjeet ^a   Krause, Andreas ^a   Guestrin, Carlos ^a   Kaiser, William J ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; INDUSTRIAL ROBOTS; INFORMATION USE; LAKES; MOTION PLANNING; MULTIPURPOSE ROBOTS; OPTIMIZATION; SENSOR NETWORKS; WATER QUALITY;

AMOUNT OF INFORMATION; EFFICIENT MONITORING; ENVIRONMENTAL APPLICATIONS; ENVIRONMENTAL SENSING; OPTIMIZATION PROBLEMS; SEQUENTIAL ALLOCATIONS; SPATIO-TEMPORAL DYNAMICS; WATER QUALITY MONITORING;

ROBOT PROGRAMMING;

EID: 70349321453     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.2674     Document Type: Article

References (61)

1. Arkin, E. M., Mitchell, J. S. B., & Narasimhan, G. (1998). Resource-constrained geometric network optimization. In Symposium on Computational Geometry, pp. 307–316.
2. Bai, X., Kumar, S., Xua, D., Yun, Z., & Lai, T. H. (2006). Deploying wireless sensors to achieve both coverage and connectivity. In Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing, pp. 131–142.
3. Batalin, M. A., Rahimi, M., Yu, Y., Liu, D., Kansal, A., Sukhatme, G. S., Kaiser, W. J., Hansen, M., Pottie, G. J., Srivastava, M., & Estrin, D. (2004). Call and response: experiments in sampling the environment. In Proceedings of the 2nd international conference on Embedded networked sensor systems, pp. 25–38.
4. Blum, A., Chawla, S., Karger, D. R., Lane, T., Meyerson, A., & Minkoff, M. (2003). Approximation algorithms for orienteering and discounted-reward tsp. In Annual Symposium on Foundation of Computer Science (FOCS), p. 46.
5. Blum, A. L., & Furst, M. L. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90, 1636–1642.
6. Borgstrom, P. H., Stealey, M. J., Batalin, M. A., & Kaiser, W. J. (2006). NIMS3D: A novel rapidly deployable robot for 3-dimensional applications. In IEEE/RSJ International Conference on Intelligent Robots and Systems, Beijing, China.
7. Bourgault, F., Makarenko, A., Williams, S., Grocholsky, B., & Durrant-Whyte, H. (2002). Information based adaptive robotic exploration. In IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 540–545.
8. Brekke, L. D., Miller, N. L., Bashford, K. E., Quinn, N. W., & Dracup, J. A. (2004). Climate change impacts uncertainty for water resources in the san joaquin river basin, california. Journal of the American water resource association, 40, 149–164.
9. Briel, M. V. D., Sanchez, R., Do, M. B., & Kambhampati, S. (2004). Effective approaches for partial satisfaction (over-subscription) planning. In In AAAI, pp. 562–569. AAAI Press.
10. Butt, S. E., & Ryan, D. M. (1999). An optimal solution procedure for the multiple tour maximum collection problem using column generation. Computers and Operations Research, 26, 427–441.
11. Calinescu, G., Chekuri, C., Pl, M., & Vondrk, J. (2007). Maximizing a submodular set function subject to a matroid constraint (extended abstract). In Integer Programming and Combinatorial Optimization (IPCO), Vol. 4513 of Lecture Notes in Computer Science, pp. 182–196.
12. Caselton, W., & Zidek, J. (1984). Optimal monitoring network design. Statistics and Probability Letters.
13. Chao, I.-M., Golden, B. L., & Wasil, E. A. (1996). A fast and effective heuristic for the orienteering problem. European Journal of Operations Research, 88, 475–489.
14. Chekuri, C., Korula, N., & Pál, M. (2008). Improved algorithms for orienteering and related problems. In Proc. 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’08). SIAM. To appear.
15. Chekuri, C., & Pal, M. (2005). A recursive greedy algorithm for walks in directed graphs. In Annual Symposium on Foundation of Computer Science (FOCS), pp. 245–253.
16. Christofides, N. (1976). Worst-case analysis of a new heuristic for the traveling salesman problem. Tech report,CMU.
17. Cressie, N. A. C. (1991). Statistics for Spatial Data. Wiley.
18. Dhariwal, A., Zhang, B., Stauffer, B., Oberg, C., Sukhatme, G. S., Caron, D. A., & Requicha, A. A. (2006). Networked aquatic microbial observing system. In IEEE International Conference on Robotics and Automation (ICRA).
19. Feillet, D., Dejax, P., & Gendreau, M. (2005). Traveling salesman problem with profits. Transportation Science, 39(2), 188–205.
20. Garg, N. (2005). Saving an epsilon: a 2-approximation for the k-mst problem in graphs. In ACM Symposium on Theory of Computing (STOC), pp. 396–402.
21. Golden, B., Levy, L., & Vohra, R. (1987). The orienteering problem. Naval Research Logistics, 34, 307–318.
22. Goundan, P. R., & Schulz, A. S. (2008). Revisiting the greedy approach to submodular set function maximization.. Working paper, MIT.
23. Guestrin, C., Krause, A., & Singh, A. P. (2005). Near-optimal sensor placements in gaussian processes. In International Conference on Machine Learning (ICML).
24. Harmon, T. C., Ambrose, R. F., Gilbert, R. M., Fisher, J. C., Stealey, M., & Kaiser, W. J. (2007). High-resolution river hydraulic and water quality characterization using rapidly deployable networked infomechanical systems (NIMS RD). Environmental Engineering Science, 24(2), 151–159.
25. I-Ming, C., Golden, B., & Wasil, E. (1996). The team orienteering problem. European Journal of Operation Research, 88, 464–474.
26. Ibaraki, T., Muro, S., Murakami, T., & Hasegawa, T. (1983). Using branch-and-bound algorithms to obtain suboptimal solutions. Mathematical Methods of Operations Research, 27(1), 177–202.
27. Ishikawa, T., & Tanaka, M. (1993). Diurnal stratification and its effects on wind-induced currents and water qualities in lake kasumigaura, japan. Journal of Hydraulic Research, 31(3), 307–322.
28. Johnson, D. S., Minkoff, M., & Phillips, S. (2000). The prize collecting steiner tree problem: theory and practice. In Symposium on Discrete Algorithms (SODA), pp. 760–769.
29. Jordan, B. L., Batalin, M. A., & Kaiser, W. J. (2007). NIMS RD: A rapidly deployable cable based robot. In IEEE International Conference on Robotics and Automation (ICRA), Rome, Italy.
30. Kataoka, S., & Morito, S. (1988). An algorithm for the single constraint maximum collection problem. Journal of the Operational Research Society of Japan, 31, 515–530.
31. Ko, C.-W., Lee, J., & Queyranne, M. (1995). An exact algorithm for maximum entropy sampling. Operations Research, 43(4), 684–691.
32. Krause, A., & Guestrin, C. (2007). Near-optimal observation selection using submodular functions. In AAAI Nectar track.
33. Krause, A., Singh, A., & Guestrin, C. (2008). Near-optimal sensor placements in Gaussian processes: Theory, efficient algorithms and empirical studies. In Journal of Machine Learning and Research (JMLR), Vol. 9, pp. 235–284.
34. Krause, A., & Guestrin, C. (2007). Nonmyopic active learning of gaussian processes: an exploration-exploitation approach. In International Conference on Machine Learning (ICML), pp. 449–456.
35. Krause, A., Guestrin, C., Gupta, A., & Kleinberg, J. (2006). Near-optimal sensor placements: Maximizing information while minimizing communication cost. In Proceedings of the fifth international conference on Information processing in sensor networks (IPSN), pp. 2–10.
36. Laporte, G., & Martello, S. (1990). The selective travelling salesman problem. Discrete Applied Mathematics, 26, 193–207.
37. Lau, H., Huang, S., & Dissanayake, G. (2006). Probabilistic search for a moving target in an indoor environment. In IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 3393–3398.
38. Lin, S. (1965). Computer solutions of the traveling salesman problem. Bell System Technical Journal, 44, 2245–2269.
39. MacIntyre, S. (1993). Vertical mixing in a shallow, eutrophic lake: Possible consequences for the light climate of phytoplankton. Limnology and Oceanography, 38(4), 798–817.
40. MacIntyre, S., Romero, J. R., & Kling, G. W. (2002). Spatial-temporal variability in surface layer deepening and lateral advection in an embayment of lake victoria, east africa. Limnology and Oceanography, 47(3), 656–671.
41. Meliou, A., Krause, A., Guestrin, C., & Hellerstein, J. M. (2007). Nonmyopic informative path planning in spatio-temporal models. In Association for Advancement of Artificial Intelligence (AAAI), pp. 602–607.
42. Nagarajan, V., & Ravi, R. (2007). Poly-logarithmic approximation algorithms for directed vehicle routing problems. In Proc. 10th Internat. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX’07), Vol. 4627 of LNCS, pp. 257–270. Springer.
43. Nemhauser, G., Wolsey, L., & Fisher, M. (1978). An analysis of the approximations for maximizing submodular set functions. Mathematical Programming, 14, 265–294.
44. Pon, R., Batalin, M., Gordon, J., Rahimi, M., Kaiser, W., Sukhatme, G., Srivastava, M., & Estrin, D. (2005). Networked infomechanical systems: A mobile wireless sensor network platform. In Proceedings of the fifth international conference on Information processing in sensor networks (IPSN), pp. 376–381.
45. Rahimi, M., Pon, R., Kaiser, W., Sukhatme, G., Estrin, D., & Srivastava, M. (2004). Adaptive sampling for environmental robotics. In IEEE International Conference on Robotics and Automation (ICRA).
46. Rasmussen, C. E., & Williams, C. K. (2006). Gaussian Process for Machine Learning. Adaptive Computation and Machine Learning. MIT Press.
47. Reynolds-Fleming, J. V., Fleming, J. G., & Luettich, R. A. (2004). Portable autonomous vertical profiler for estuarine applications. Estuaries, 25, 142–147.
48. Roy, N., & Earnest, C. (2006). Dynamic action spaces for information gain maximization in search and exploration. In American Control Conference.
49. Ryan, M. R. K. (2008). Exploiting subgraph structure in multi-robot path planning. In Journal of Artificial Intelligence and Research (JAIR), Vol. 31, pp. 497–542.
50. Sim, R., & Roy, N. (2005). Global a-optimal robot exploration in slam. In IEEE International Conference on Robotics and Automation (ICRA).
51. Simmons, R. G., Apfelbaum, D., Burgard, W., Fox, D., Moors, M., Thrun, S., & Younes, H. (2000). Coordination for multi-robot exploration and mapping. In Association for Advancement of Artificial Intelligence (AAAI), pp. 852–858.
52. Singh, A., Nowak, R., & Ramanathan, P. (2006). Active learning for adaptive mobile sensing networks. In Proceedings of the fifth international conference on Information processing in sensor networks (IPSN), pp. 60–68.
53. Singh, A., Batalin, M. A., Chen, V., Stealey, M. J., Jordan, B., Fisher, J., Harmon, T., Hansen, M., & Kaiser, W. J. (2007a). Autonomous robotic sensing experiments at san joaquin river. In IEEE International Conference on Robotics and Automation (ICRA), pp. 4987–4993, Rome, Italy.
54. Singh, A., Krause, A., Guestrin, C., Kaiser, W. J., & Batalin, M. A. (2007b). Efficient planning of informative paths for multiple robots. In International Joint Conference on Artificial Intelligence (IJCAI), pp. 2204–2211, Hyderabad, India.
55. Smith, D. E. (2004). Choosing objectives in over-subscription planning. In International Conference on Automated Planning and Scheduling (ICAPS).
56. Somasundara, A. A., Ramamoorthy, A., & Srivastava, M. B. (2007). Mobile element scheduling with dynamic deadlines. In IEEE Transactions on Mobile Computing, Vol. 6, pp. 395–410.
57. Stachniss, C., Grisetti, G., & Burgard, W. (2005). Information gain-based exploration using rao-blackwellized particle filters. In Robotics Science and Systems (RSS).
58. Tang, L., & Wang, X. (2006). Iterated local search algorithm based on very large-scale neighborhood for prize-collecting vehicle routing problem. The International Journal of Advanced Manufacturing Technology, 1–13.
59. Thompson, D. R., & Wettergreen, D. (2008). Intelligent maps for autonomous kilometer-scale science survey. In International Symposium on Artificial Intelligence, Robotics and Automation in Space (iSAIRAS).
60. Trummel, K. E., & Weisinger, J. R. (1986). The complexity of the optimal searcher path problem. Operations Research, 34(2), 324–327.
61. Zhang, W., & Korf, R. E. (1995). Performance of linear-space search algorithms. Artificial Intelligence, 79(2), 241–292.