Efficient optimization of information-theoretic exploration in SLAM

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2008, Pages 1369-1375

  Kollar, Thomas ^a   Roy, Nicholas ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTONOMOUS EXPLORATIONS; CONSTRAINED OPTIMIZATION PROBLEMS; GRADIENT ASCENTS; INFORMATION GAINS; MINIMUM ENTROPIES; NOVEL METHODS; POSTE-RIORS;

ARTIFICIAL INTELLIGENCE; BIONICS; CONSTRAINT THEORY; INFORMATION THEORY; OPTIMIZATION;

CONSTRAINED OPTIMIZATION;

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

References (15)

1. Bagnell, J.; Kakade, S.; Ng, A.; and Schneider, J. 2003. Policy search by dynamic programming. In Neural Information Processing Systems, volume 16. MIT Press.
2. Blum, H. 1967. A Transformation for Extraction New Descriptors of Shape, Models for the Perception of Speech and Visual Form. Cambridge: MIT Press.
3. Coeurjolly, D.; Hulin, J.; and Sivignon, I. 2007. Finding a Minimum Medial Axis of a Discrete Shape is NP-hard. Technical Report RR-LIRIS-2007-026, LIRIS UMR 5205 CNRS/INSA de Lyon/Universit Claude Bernard Lyon 1/Universit Lumire Lyon 2/Ecole Centrale de Lyon.
4. Cornea, N. D.; Silver, D.; and Min, P. 2005. Curve-skeleton applications. In Proceedings IEEE Visualization, 95-102.
5. Darbellay, G. A., and Vajda, I. 2000. Entropy expressions for multivariate continuous distributions. IEEE Transactions on Information Theory 46(2):709-712.
6. Feder, H. J. S.; Leonard, J. J.; and Smith, C. M. 1999. Adaptive mobile robot navigation and mapping. International Journal of Robotics Research, Special Issue on Field and Service Robotics 18(7):650-668.
7. Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability : A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences. W. H. Freeman.
8. Kollar, T., and Roy, N. 2008. Trajectory optimization using reinforcement learning for map exploration. The International Journal of Robotics Research 27(2): 175-196.
9. Makarenko, A.; Williams, S.; Bourgault, F; and Durrant-Whyte, H. 2002. An experiment in integrated exploration. Proc. Of the IEEE/RSJ Intl. Conf. on Intelligent Robots and Systems (IROS).
10. Prentice, S., and Roy, N. 2007. The belief roadmap: Efficient planning in linear pomdps by factoring the covariance. In Proceedings of the 13th International Symposium of Robotics Research (ISRR).
11. Rosenkrantz, D.; Stearns, R.; and Lewis, P. 1977. An analysis of several heuristics for the traveling salesman problem. SIAM Journal on Computing 6:563.
12. Sim, R., and Roy, N. 2005. Global a-optimal robot exploration in slam. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA).
13. Stachniss, C., and Burgard, W. 2003. Exploring unknown environments with mobile robots using coverage maps. In Proc. of the International Conference on Artificial Intelligence (IJCAI).
14. Stachniss, C. 2006. Exploration and Mapping with Mobile Robots. Ph.D. Dissertation, University of Freiburg, Department of Computer Science.
15. Yamauchi, B. 1997. A frontier-based approach for autonomous exploration. Proceedings of the IEEE International Symposium on Computational Intelligence in Robotics and Automation 146-151.