High-Level Planning and Control with Incomplete Information Using POMDP's

AAAI Fall Symposium - Technical Report

Volumn FS-98-02, Issue , 1998, Pages 52-60

  Geffner, Héctor ^a   Bonet, Blai ^a  

^a UNIVERSIDAD SIMÓN BOLÍVAR   (Venezuela)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; HIGH LEVEL LANGUAGES;

AGENT BELIEFS; HIGH-LEVEL LANGUAGE; HIGHER-LEVEL LANGUAGES; INCOMPLETE INFORMATION; PERFORMANCE; PLANNING AND CONTROL; PLANNING WITH INCOMPLETE INFORMATION; REAL-TIME DYNAMICS;

CONTROLLERS;

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

References (27)

1. Barto, A.; Bradtke, S.; and Singh, S. 1995. Learning to act using real-time dynamic programming. Artificial Intelligence 72:81-138.
2. Bellman, R.. 1957. DynamicProgramming. Princeton University Press.
3. Bertsekas, D., and Tsitsiklis, J. 1996. Neuro-Dynamic Programming. Athena Scientific.
4. Boner, B., and Geffner, H. 1998. Planning and control with incomplete information using POMDPs:Experimental results. Submitted.
5. Boutilier, C.; Dean, T.; and Hanks, S. 1995. Planning under uncertainty: structural assumptions and computational leverage. In Proceedings of EWSP-95.
6. Boutilier, C.; Dearden, R.; and Goldszmidt, M. 1995. Exploiting structure in policy construction. In Proceedings of IJCAI-95.
7. Cassandra, A.; Kaebling, L.; and Littman, M. 1994. Acting optimally in partially observable stochastic domains. In Proceedings AAAI9J, 1023-1028.
8. Cassandra, A.; Kaebling, L.; and Littman, M. 1995. Learning policies for partially observable environments: Scaling up. In Proc. of the 12th Int. Conf. on Machine Learning.
9. Cassandra, A.; Littman, M.; and Zhang, N. 1997. Incremental pruning: A simple, fast, exact algorithm for Partially Observable MarkovDecision Processes. In, ed., Proceedings UAI-97, Morgan Kaufmann.
10. Collins, G., and Pryor, L. 1995. Planning under uncertainty: Somekey issues. In Proceedings IJCAI95.
11. Dean, T., and Kanazawa, K. 1989. A model for reasoning about persistence and causation. Computational Intelligence 5(3):142-150.
12. Draper, D.; Hanks, S.; and Weld, D. 1994. Probabilistic planning with information gathering and contingent execution. In Proceedings of the SecondInt. Conference on Artificial Intelligence Planning Systems, 31-36. AAAIPress.
13. Etzioni, O.; Hanks, S.; Draper, D.; Lesh, N.; and Williamson, M. 1992. An approach to planning with incomplete information. In Proceedings of the Third Int. Conference on Principles of Knowledge Representation and Reasoning, 115-125. Morgan Kaufmann.
14. Fikes, R., and Nilsson, N. 1971. STRIPS: A new approach to the application of theorem proving to problemsolving. Artificial Intelligence 1:27-120.
15. Geffner, H., and Boner, B. 1998. Solving large pomdp's using real time dynamic programming. Submitted.
16. Gelfond, M., and Lifschitz, V. 1993. Representing action and change by logic programs. J. of Lwic Programming 17:301-322.
17. Korf, R. 1990. Real-time heuristic search. Artificial Intelligence 42:189-211.
18. Kripke, S. 1971. Semantical considerations on modal logic. In Linsky, L., ed., Reference and Modality. Oxford University Press. 63-72.
19. Kushmerick, N.; Hanks, S.; and Weld, D. 1995. An algorithm for probabilistic planning. Artificial Intelligence 76:239-286.
20. Levesque, H. 1996. What is planning in the presence of sensing. In Proceedings AAAI-96, 1139-1146. Portland, Oregon: MITPress.
21. Moore, R. 1985. A formal theory of knowledge and action. In Hobbs, J., and Moore, R., eds., Formal Theories of the CommonsenseWorld. Norwood, N.J.: Ablex Publishing Co.
22. Puterman, M. 1994. Markov Decision Processes - Discrete Stochastic DynamicProgramming. John Wiley and Sons, Inc.
23. Reiter, R. 1991. The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression. In Lifschitz, V., ed., Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy. Academic Press. 359-380.
24. Russell, S., and Norvig, P. 1994. Artificial Intelligence: A ModernApproach. Prentice Hall.
25. Sandewal, E. 1991. Features and fluents. Technical Report R-91-29, Linkoping University, Sweden.
26. Scherl, R., and Levesque, H. 1993. The frame problem and knowledge producing actions. In Proceedings of AAAI-9$, 689-695. MITPress.
27. Sondik, E. 1971. The Optimal Control of Partially Observable Markov Processes. Ph.D. Dissertation, Stanford University.