Indefinite-horizon POMDPs with action-based termination

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2007, Pages 1237-1242

  Hansen, Eric A ^a  

^a MISSISSIPPI STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PLAN EXECUTION; PLANNING PROBLEMS;

MATHEMATICAL MODELS; MOTION PLANNING; PROBLEM SOLVING; PUBLIC POLICY; RANDOM PROCESSES;

DECISION THEORY;

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

References (24)

1. Alur, R.; Courcoubetis, C.; and Yannakakis, M. 1995. Distinguishing tests for nondeterministic and probabilistic machines. In Proc. of 27th ACM Symp. on Theory of Computing, 363-372.
2. Bertsekas, D., and Tsitsiklis, J. 1991. Analysis of stochastic shortest path problems. Mathematics of Operations Research 16(3):580-595.
3. Bertsekas, D. 1987. Dynamic Programming: Deterministic and Stochastic Models. Englewood, NJ: Prentice-Hall.
4. Boutilier, C. 2002. A POMDP formulation of preference elicitation problems. In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI-02), 239-246.
5. Derman, C. 1970. Finite State Markovian Decision Processes. New York: Academic Press.
6. Eagle, J. 1984. The optimal search for a moving target when the search path is constrained. Operations Res. 32(5): 1107-1115.
7. Eaton, J., and Zadeh, L. 1962. Optimal pursuit strategies in discrete-state probabilistic systems. Journal of Basic Engineering (formerly Transactions of the ASME, Series D) 84:23-29.
8. Feng, Z., and Zilberstein, S. 2004. Region-based incremental pruning for POMDPs. In Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence, 146-153.
9. Hansen, E., and Zhou, R. 2003. Synthesis of hierarchical finite-state controllers for POMDPs. In Proc. of the 13th International Conference on Automated Planning and Scheduling, 113-122.
10. Hansen, E. 1998. Solving POMDPs by searching in policy space. In Proc. of the 14th Conf. on Uncertainty in AI, 211-219.
11. Hespana, J., and Prandini, M. 2002. Optimal pursuit under partial information. In Proceedings of the 10th Mediterranian Conference on Control and Automation.
12. Joshi, K.; Sanders, W.; Hiltunen, M.; and Schlichting, R. 2006. Automatic recovery using bounded partially observable Markov decision processes. In Proceedings of the International Conference on Dependable Systems and Networks (DSN'06), 445 - 456.
13. Kaelbling, L.; Littman, M.; and Cassandra, A. 1998. Planning and acting in partially observable stochastic domains. Artificial Intelligence 101:99-134.
14. Littman, M.; Cassandra, A.; and Kaelbling, L. 1995. Learning policies for partially observable environments: Scaling up. In Proc. of the 12th Int. Conf. on Machine Learning, 157-163.
15. Liu, Y., and Koenig, S. 2005. Existence and finiteness conditions for risk-sensitive planning: Results and conjectures. In Proc. of the 21st Conference on Uncertainty in Artificial Intelligence.
16. Madani, O.; Hanks, S.; and Condon, A. 2003. On the undecidability of probabilistic planning and related stochastic optimization problems. Artificial Intelligence 147:5 - 34.
17. Patek, S. 2001. On partially observed stochastic shortest path problems. In Proceedings of the 40th IEEE Conference on Decision and Control, 5050-5055.
18. Pineau, J.; Gordon, G.; and Thrun, S. 2003. Point-based value iteration: An anytime algorithm for POMDPs. In Proc. of the 19th International Joint Conf. on Artificial Intelligence, 1025-1032.
19. Poupart, P., and Boutilier, C. 2004. Bounded finite state controllers. In Advances in Neural Information Processing Systems 16: Proceedings of the 2003 Conference, 823-830. MIT Press.
20. Schesvold, D.; Tang, J.; Ahmed, B.; Altenburg, F.; and Nygard, K. 2003. POMDP planning for high level UAV decisions: Search vs. strike. In Proceedings of the 16th International Conference on Computer Applications in Industry and Engineering.
21. Simmons, R., and Koenig, S. 1995. Probabilistic robot navigation in partially observable environments. In Proc. of the 14th International Joint Conference on Artificial Intelligence, 1080-1087.
22. Singh, S., and Krishnamurthy, V. 2001. Partially observed stochastic shortest-path problem - Application to sequential paging in cellular networks. In Proceedings of the 40th IEEE Conference on Decision and Control, 1053 - 1058.
23. Smallwood, R., and Sondik, E. 1973. The optimal control of partially observable Markov processes over a finite horizon. Operations Research 21:1071-1088.
24. Yost, K., and Washburn, A. 2000. Optimizing assignments of air-to-ground assets and BDA sensors. Military Operations Research 5:77-91.