Robot planning in partially observable continuous domains

Robotics: Science and Systems

Volumn 1, Issue , 2005, Pages 217-224

  Porta, Josep M ^a   Spaan, Matthijs T J ^b   Vlassis, Nikos ^b  

^a INSTITUT DE ROBÒTICA I INFORMÀTICA INDUSTRIAL CSIC UPC   (Spain)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84959528732     PISSN: 23307668     EISSN: 2330765X     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. M. L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley Series in Probability and Mathematical Statistics. John Wiley and Sons, Inc., 1994.
2. E. J. Sondik, "The Optimal Control of Partially Observable Markov Processes," Ph.D. dissertation, Stanford University, 1971.
3. G. E. Monahan, "A Survey of Partially Observable Markov Decision Processes: Theory, Models, and Algorithms," Management Science, vol. 28, no. 1, pp. 1-16, 1982.
4. H. T. Cheng, "Algorithms for Partially Observable Markov Decision Processes," Ph.D. dissertation, University of British Columbia, 1988.
5. A. R. Cassandra, M. L. Littman, and N. L. Zhang, "Incremental Pruning: A Simple, Fast, Exact Algorithm for Partially Observable Markov Decision Processes," in Proceedings of the Thirteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-97), 1997.
6. L. P. Kaelbling, M. L. Littman, and A. R. Cassandra, "Planning and Acting in Partially Observable Stochastic Domains," Artificial Intelligence, vol. 101, no. 1-2, pp. 99-134, 1998.
7. R. Simmons and S. Koenig, "Probabilistic Robot Navigation in Partially Observable Environments," in Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 1995.
8. A. R. Cassandra, L. P. Kaelbling, and J. A. Kurien, "Acting under Uncertainty: Discrete Bayesian Models for Mobile-Robot Navigation," in Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 1996, pp. 963-972.
9. G. Theocharous and S. Mahadevan, "Approximate Planning with Hierarchical Partially Observable Markov Decision Processes for Robot Navigation," in IEEE International Conference on Robotics and Automation, 2002, pp. 1347-1352.
10. J. Pineau, M. Montemerlo, M. Pollack, N. Roy, and S. Thrun, "Towards Robotic Assistants in Nursing Homes: Challenges and Results," in Robotics and Autonomous Systems, vol. 42, no. 3-4, 2003, pp. 271-281.
11. C. Papadimitriou and J. N. Tsisiklis, "The Complexity of Markov Decision Processes," Mathematical and Operations Research, vol. 12, no. 3, pp. 441-450, 1987.
12. O. Madani, S. Hanks, and A. Condon, "On the Undecidability of Probabilistic Planning and Infinite-Horizon Partially Observable Markov Decision Problems," in Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI), 1999, pp. 541-548.
13. J. Pineau, G. Gordon, and S. Thrun, "Point-based Value Iteration: An Anytime Algorithm for POMDPs," in International Joint Conference on Artificial Intelligence (IJCAI), 2003.
14. N. Vlassis and M. T. J. Spaan, "A Fast Point-Based Algorithm for POMDPs," in In Proceedings of Annual Machine Learning Conference of Belgium and the Netherlands, Brussels, Belgium, 2004, pp. 170-176.
15. D. P. Bertsekas, Dynamic Programming and Optimal Control, 2nd ed. Belmont, MA: Athena Scientific cop, 2001.
16. A. Y. Ng and M. Jordan, "PEGASUS: A Policy Search Method for Large MDPs and POMDPs," in Proceedings of the 16th Conference on Uncertainty in Artificial Inteligence (UAI), 2000, pp. 406-415.
17. D. Aberdeen and J. Baxter, "Scalable Internal-State Policy-Gradient Methods for POMDPs," in Proceedings of the International Conference on Machine Learning (ICML), 2002, pp. 3-10.
18. 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.
19. S. Thrun, "Monte Carlo POMDPs," in Advances in Neural Information Processing Systems (NIPS), S. Solla, T. Leen, and K.-R. Müller, Eds. MIT Press, 2000, pp. 1064-1070.
20. R. E. Bellman, Dynamic Programming. Princenton University Press, 1957.
21. M. Hauskrecht, "Value Function Approximations for Partially Observable Markov Decision Processes," Journal of Artificial Intelligence Research, vol. 13, pp. 33-95, 2000.
22. J. M. Porta, M. T. J. Spaan, and N. Vlassis, "Value Iteration for Continuous-State POMDPs," IAS Technical Report, University of Amsterdam, Tech. Rep. IAS-UVA-04-04, 2004.
23. J. J. Leonard and H. F. Durrant-Whyte, "Mobile Robot Localization by Tracking Geometric Beacons," IEEE Transactions on Robotics and Automation, vol. 7, no. 3, pp. 376-382, 1991.
24. P. Jensfelt and S. Kristensen, "Active Global Localization for a Mobile Robot Using Multiple Hypothesis Tracking," IEEE Transactions on Robotics and Automation, vol. 17, no. 5, pp. 748-760, 2001.
25. J. Julier and J. K. Uhlmann, "A New Extension of the Kalman Filter to Nonlinear Systems," in In Proceedings of AeroSense: The 11th International Symposium on Aerospace/Defence Sensing, Simulation and Controls, 1997, pp. 1628-1632.
26. M. T. J. Spaan and N. Vlassis, "Perseus: Randomized Point-based Value Iteration for POMDPs," Journal of Artificial Intelligence Research, 2005.
27. J. Goldberger and S. Roweis, "Hierarchical Clustering of a Mixture Model," in Advances in Neural Information Processing Systems (NIPS), 2005.
28. J. Hoey and P. Poupart, "Solving POMDPs with Continuous or Large Discrete Observation Spaces," in Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 2005.