Efficient planning of informative paths for multiple robots

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 2204-2211

  Singh, Amarjeet ^a   Kaiser, William ^a   Batalin, Maxim ^a   Krause, Andreas ^b   Guestrin, Carlos ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AMOUNT OF INFORMATION; EFFICIENT PATH PLANNING; ENVIRONMENTAL MONITORING; GAUSSIAN PROCESSES; MUTUAL INFORMATIONS; RESOURCE CONSTRAINT; SENSING APPLICATIONS; THEORETICAL APPROXIMATIONS;

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; INDUSTRIAL ROBOTS; LINEAR PROGRAMMING;

APPROXIMATION ALGORITHMS;

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

References (17)

1. Avrim Blum, Shuchi Chawla, David R. Karger, Terran Lane, Adam Meyerson, and Maria Minkoff. Approximation algorithms for orienteering and discounted-reward tsp. In FOCS, page 46, 2003.
2. I-Ming Chao, Bruce L. Golden, and Edward A. Wasil. A fast and effective heuristic for the orienteering problem. Eur. Jour. of Op. Research, 88:475-489, 1996.
3. Chandra Chekuri and Martin Pal. A recursive greedy algorithm for walks in directed graphs. In FOCS, pages 245-253, 2005.
4. N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Tech report, CMU, 1976.
5. Amit Dhariwal, Bin Zhang, Beth Stauffer, Carl Oberg, Gaurav S. Sukhatme, David A. Caron, and Aristides A. Requicha. Networked aquatic microbial observing system. In IEEE ICRA, 2006.
6. Dominique Feillet, Pierre Dejax, and Michel Gendreau. Traveling salesman problem with profits. Trans Sci, 39(2):188-205, '05.
7. Carlos Guestrin, Andreas Krause, and Ajit Paul Singh. Near-optimal sensor placements in gaussian processes. In ICML, 2005.
8. C. I-Ming, B.L. Golden, and E.A. Wasil. The team orienteering problem. Eur. Jour. of Op. Res., 88:464-474, 1996.
9. David S. Johnson, Maria Minkoff, and Steven Phillips. The prize collecting steiner tree problem: theory and practice. In Symp. on Disc. Algorithms, pages 760-769, 2000.
10. Andreas Krause, Carlos Guestrin, Anupam Gupta, and Jon Kleinberg. Near-optimal sensor placements: Maximizing information while minimizing communication cost. In IPSN, 2006.
11. Gilbert Laporte and Silvano Martello. The selective travelling salesman problem. Disc. App. Math, 26:193-207, 1990.
12. Yun-Chia Liang, Sadan Kulturel-Konak, and Alice E. Smith. Meta heuristics for the orienteering problem. In Proc. of CEC, 2002.
13. G. Nemhauser, L.Wolsey, and M. Fisher. An analysis of the approximations for maximizing submodular set functions. Mathematical Programming, 14:265-294, 1978.
14. Carl Edward Rasmussen and Christopher K.I. Williams. Gaussian Process for Machine Learning. Adaptive Computation and Machine Learning. MIT Press, 2006.
15. R. Sim and N. Roy. Global a-optimal robot exploration in slam. In ICRA, 2005.
16. Amarjeet Singh, Andreas Krause, Carlos Guestrin, William Kaiser, and Maxim Batalin. Efficient planning of informative paths for multiple robots. Technical Report CMU-ML-06-112, 2006.
17. C. Stachniss, G. Grisetti, and W. Burgard. Information gain-based exploration using rao-blackwellized particle filters. In RSS, 2005.