Dynamic action spaces for information gain maximization in search and exploration

Proceedings of the American Control Conference

Volumn 2006, Issue , 2006, Pages 1631-1636

  Roy, Nicholas ^a   Earnest, Caleb ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; MOBILE AGENTS; MOTION PLANNING; ONLINE SEARCHING; OPTIMIZATION; PROBABILITY DISTRIBUTIONS;

DYNAMIC ACTION SPACES; INFORMATION GAIN; INFORMATIVE SENSING; MOVING TARGETS;

AUTONOMOUS AGENTS;

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

References (18)

1. E. Sondik, "The optimal control of partially observable Markov decision processes," Ph.D. dissertation, Stanford University, Stanford, California, 1971.
2. S. Thrun, D. Fox, and W. Burgard, Probabilistic Robotics. Cambridge, MA: MIT Press, 2005.
3. R. E. Kalman, "A new approach to linear filtering and prediction problems," Transactions of the ASME-Journal of Basic Engineering, vol. 82, no. Series D, pp. 35-45, 1960.
4. A. Smith and A. Gelfand, "Bayesian statistics without tears: a sampling-resampling perspective," American Statistician, vol. 46, pp. 84-88, 1992.
5. R. Neal, "Probabilistic inference using markov chain monte carlo methods," Dept. of Computer Science, University of Toronto, Tech. Rep. CRG-TR-93-1, 1993.
6. D. MacKay, "Information-based objective functions for active data selection." Neural Computation, vol. 4, no. 4, pp. 590-604, 1992.
7. H. J. S. Feder, J. J. Leonard, and C. M. Smith, "Adaptive mobile robot navigation and mapping," Inter. J. of Robotics Research, Special Issue on Field and Service Robotics, vol. 18, no. 7, pp. 650-668, July 1999.
8. L. P. Kaelbling, M. L. Littman, and A. R. Cassandra, "Planning and acting in partially observable stochastic domains," Artificial Intelligence, vol. 101, pp. 99-134, 1998.
9. M. L. Littman, "Algorithms for sequential decision making," Ph.D. dissertation, Brown University, Providence, RI, March 1996.
10. N. Roy, G. Gordon, and S. Thrun, "Finding approximate pomdp solutions through belief compression," Journal of Artificial Intelligence Research, vol. 23, pp. 1-40, 2005.
11. P. Poupart and C. Boutilier, "Value-directed compression of POMDPs," in Advances in Neural Information Processing Systems 15 (NIPS), S. Becker, S. Thrun, and K. Obermayer, Eds., 2002.
12. H.-T. Cheng, "Algorithms for partially observable Markov decision processes," Ph.D. dissertation, University of British Columbia, 1988.
13. P. Poupart and C. Boutilier, "Vdcbpi: an approximate scalable algorithm for large scale pomdps," in Advances in Neural Information Processing Systems 17 (NIPS), Vancouver, BC, 2004, pp. 1081-1088.
14. T. Smith and R. Simmons, "Point-based POMDP algorithms: Improved analysis and implementation," in Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence (UAI), 2005.
15. M. T. J. Spaan and N. Vlassis, "Perseus: Randomized point-based value iteration for POMDPs," Journal of Artificial Intelligence Research, vol. 24, pp. 195-220, 2005.
16. J. Pineau, G. Gordon, and S. Thrun, "Point-based value iteration: An anytime algorithm for POMDPs," in Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI), 2003.
17. J. Pineau and S. Thrun, "An integrated approach to hierarchy and abstraction for POMDPs," Carnegie Mellon University, Pittsburgh, PA, Tech. Rep. CMU-RI-TR-02-21, August 2002.
18. E. Wan and R. van der Merwe, "The unscented kalman filter for nonlinear estimation," in Proc. of IEEE Symposium 2000 (AS-SPCC), 2000.