Replanning in domains with partial information and sensing actions

Journal of Artificial Intelligence Research

Volumn 45, Issue , 2012, Pages 565-600

  Brafman, Ronen I ^a   Shani, Guy ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BENCH-MARK PROBLEMS; CLASSICAL PLANNING; CONFORMANT PLANNING; EXPERIMENTAL EVALUATION; ON-LINE PLANNING; PARTIAL INFORMATION; SAMPLING TECHNIQUE; THEORETICAL GUARANTEES;

ARTIFICIAL INTELLIGENCE;

EID: 84875158562     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.3711     Document Type: Article

References (27)

1. Albore, A., Palacios, H., & Geffner, H. (2009). A translation-based approach to contingent planning. In IJCAI, pp. 1623-1628.
2. Bonet, B., & Geffner, H. (2011). Planning under partial observability by classical replanning: Theory and experiments. In IJCAI, pp. 1936-1941.
3. Brafman, R. I., & Tennenholtz, M. (2003). Learning to coordinate efficiently: A model-based approach. Journal of Artificial Intelligence Research (JAIR), 19, 11-23.
4. Bryce, D., Kambhampati, S., & Smith, D. E. (2006). Planning graph heuristics for belief space search. JOURNAL OF AI RESEARCH, 26, 35-99.
5. Eén, N., & Sörensson, N. (2003). An extensible sat-solver. In SAT, pp. 502-518.
6. Hoffmann, J., & Brafman, R. I. (2005). Contingent planning via heuristic forward search with implicit belief states. In ICAPS, pp. 71-80.
7. Hoffmann, J., & Brafman, R. I. (2006). Conformant planning via heuristic forward search: A new approach. Artif. Intell., 170(6-7), 507-541.
8. Hoffmann, J., & Nebel, B. (2001). The FF planning system: Fast plan generation through heuristic search. JAIR, 14, 253-302.
9. Kearns, M. J., & Singh, S. P. (2002). Near-optimal reinforcement learning in polynomial time. Machine Learning, 49(2-3), 209-232.
10. Kocsis, L., & Szepesvári, C. (2006). Bandit based monte-carlo planning. In ECML, pp. 282-293.
11. Kolobov, A., Mausam, & Weld, D. S. (2010). Classical planning in MDP heuristics: with a little help from generalization. In ICAPS, pp. 97-104.
12. Koyama, M., & Lai, T. (1993). Circumscription: A form of non-monotonic reasoning. Journal of Recreational Mathematics, 25, 251256.
13. Little, I., & Thiebaux, S. (2007). Probabilistic planning vs. replanning. In ICAPS Workshop on IPC: Past, Present and Future.
14. McCarthy, J., & Hayes, P. J. (1969). Some philosophical problems from the standpoint of artificial intelligence. In Meltzer, B., & Michie, D. (Eds.), Machine Intelligence, Vol. 4, pp. 463-502.
15. Palacios, H., & Geffner, H. (2009). Compiling uncertainty away in conformant planning problems with bounded width. JAIR, 35, 623-675.
16. Reiter, R. (1991). The frame problem in the situation calculus: a simple solution (sometimes) and a completeness result for goal regression. In Lifshitz, V. (Ed.), AI and Mathematical Theory of Computation: papers in honour of John McCarthy, pp. 359-380.
17. Smith, T., & Simmons, R. (2004). Heuristic search value iteration for POMDPs. In UAI 2004, Banff, Alberta.
18. To, S. T. (2011). On the impact of belief state representation in planning under uncertainty. In IJCAI, pp. 2856-2857.
19. To, S. T., Pontelli, E., & Son, T. C. (2009). A conformant planner with explicit disjunctive representation of belief states. In ICAPS.
20. To, S. T., Pontelli, E., & Son, T. C. (2011). On the effectiveness of cnf and dnf representations in contingent planning. In IJCAI, pp. 2033-2038.
21. To, S. T., Son, T. C., & Pontelli, E. (2010). On the use of prime implicates in conformant planning. In AAAI.
22. To, S. T., Son, T. C., & Pontelli, E. (2011a). Conjunctive representations in contingent planning: Prime implicates versus minimal cnf formula. In AAAI.
23. To, S. T., Son, T. C., & Pontelli, E. (2011b). On the effectiveness of belief state representation in contingent planning. In AAAI.
24. Yoon, S. W., Fern, A., & Givan, R. (2007). FF-Replan: A baseline for probabilistic planning. In ICAPS.
25. Yoon, S. W., Fern, A., Givan, R., & Kambhampati, S. (2008). Probabilistic planning via determinization in hindsight. In AAAI, pp. 1010-1016.
26. Yoon, S.W., Ruml, W., Benton, J., & Do, M. B. (2010). Improving determinization in hindsight for on-line probabilistic planning. In ICAPS, pp. 209-217.
27. Zelinsky, A. (1992). A mobile robot exploration algorithm. IEEE Trans. on Robotics and Automation, 8(6).