\begin{thebibliography}{}

\bibitem[Bertoli et~al., 2001]{bertoli01}
Bertoli, P., Cimatti, A., and Roveri, M. (2001).
\newblock Heuristic search + symbolic model checking = efficient conformant
  planning.
\newblock In {\em Proceedings of Eighteenth International Joint Conference on
  Artificial Intelligence (IJCAI-01)}, pages 467--472.

\bibitem[Blum and Furst, 1997]{blum97}
Blum, A.~L. and Furst, M.~L. (1997).
\newblock Fast planning through planning graph analysis.
\newblock {\em Artificial Intelligence}, 90:281--300.

\bibitem[Bonet and Geffner, 2001]{bonet01}
Bonet, B. and Geffner, H. (2001).
\newblock Planning as heuristic search.
\newblock {\em Artificial Intelligence}, 129(1-2):5--33.

\bibitem[Bonet and Geffner, 2005]{bonet05}
Bonet, B. and Geffner, H. (2005).
\newblock {mGPT}: A probabilistic planner based on heuristic search.
\newblock {\em Journal of Artificial Intelligence Research}, 24:933--944.

\bibitem[Boutilier et~al., 1999]{boutilier99a}
Boutilier, C., Dean, T., and Hanks, S. (1999).
\newblock Decision theoretic planning: Structural assumptions and computational
  leverage.
\newblock {\em Journal of Artificial Intelligence Research}, 11:1--94.

\bibitem[Brafman and Hoffmann, 2004]{hoffmann04}
Brafman, R.~I. and Hoffmann, J. (2004).
\newblock Conformant planning via heuristic forward search: A new approach.
\newblock In {\em Proceedings of Fourteenth International Conference on
  Automated Planning \& Scheduling (ICAPS-04)}, pages 355--364.

\bibitem[Edelkamp, 2004]{edelkamp04b}
Edelkamp, S. (2004).
\newblock Extended critical paths in temporal planning.
\newblock In {\em Workshop on Integrating Planning Into Scheduling
  International Conference on Automated Planning and Scheduling (ICAPS-04)},
  pages 38--45.

\bibitem[Edelkamp et~al., 2004]{edelkamp04}
Edelkamp, S., Hoffman, J., Littman, M., and Younes, H. (2004).
\newblock International planning competition.
\newblock Proceedings of Fourteenth International Conference on Automated
  Planning \& Scheduling (ICAPS-04).

\bibitem[Fern et~al., 2006]{fern06}
Fern, A., Yoon, S., and Givan, R. (2006).
\newblock Approximate policy iteration with a policy language bias: Solving
  relational {Markov} decision processes.
\newblock {\em Journal of Artificial Intelligence Research}, 25.

\bibitem[Ferraris and Giunchiglia, 2000]{ferraris00}
Ferraris, P. and Giunchiglia, E. (2000).
\newblock Planning as satisfiability in nondeterministic domains.
\newblock In {\em Proceedings of the Seventeenth National Conference on
  Artificial Intelligence (AAAI-00)}, pages 748--754.

\bibitem[Hansen and Feng, 2000]{hansen00}
Hansen, E.~A. and Feng, Z. (2000).
\newblock Dynamic programming for {POMDP}s using a factored state
  representation.
\newblock In {\em Proceedings of the Fifth International Conference on
  Artificial Intelligence Planning \& Scheduling (AIPS-00)}, pages 130--139.

\bibitem[Hoffman and Nebel, 2001]{hoffman01}
Hoffman, J. and Nebel, B. (2001).
\newblock The {FF} planning system: Fast plan generation through heuristic
  search.
\newblock {\em Journal of Artificial Intelligence Research}, 14:253--302.

\bibitem[Hoffmann and Brafman, 2005]{hoffmann05}
Hoffmann, J. and Brafman, R.~I. (2005).
\newblock Contingent planning via heuristic forward search with implicit belief
  states.
\newblock In {\em Proceedings of Fifteenth International Conference on
  Automated Planning \& Scheduling (ICAPS-05)}, pages 71--80.

\bibitem[Hyafil and Bacchus, 2003]{hyafil03}
Hyafil, N. and Bacchus, F. (2003).
\newblock Conformant probabilistic planning via {CSPs}.
\newblock In {\em Proceedings of Thirteenth International Conference on
  Automated Planning \& Scheduling (ICAPS-03)}, pages 205--214.

\bibitem[Kaelbling et~al., 1998]{kaelbling98}
Kaelbling, L.~P., Littman, M.~L., and Cassandra, A.~R. (1998).
\newblock Planning and acting in partially observable stochastic domains.
\newblock {\em Artificial Intelligence}, 101:99--134.

\bibitem[Karlsson, 2001]{karlsson01}
Karlsson, L. (2001).
\newblock Conditional progressive planning under uncertainty.
\newblock In {\em Proceedings of Eighteenth International Joint Conference on
  Artificial Intelligence (IJCAI-01)}, pages 431--436.

\bibitem[Koehler and Hoffmann, 2000]{koehler00}
Koehler, J. and Hoffmann, J. (2000).
\newblock On reasonable and forced goal orderings and their use in an
  agenda-driven planning algorithm.
\newblock {\em Journal of Artificial Intelligence Research}, 12:339--386.

\bibitem[Kushmerick et~al., 1995]{kushmerick95}
Kushmerick, N., Hanks, S., and Weld, D.~S. (1995).
\newblock An algorithm for probabilistic planning.
\newblock {\em Artificial Intelligence}, 76:239--286.

\bibitem[Kuter and Nau, 2005]{kuter05}
Kuter, U. and Nau, D. (2005).
\newblock Using domain-configurable search control in probabilistic planners.
\newblock In {\em Proceedings of the Twentieth National Conference on
  Artificial Intelligence (AAAI-05)}.

\bibitem[Majercik and Littman, 1999]{majercik99}
Majercik, S.~M. and Littman, M.~L. (1999).
\newblock Contingent planning under uncertainty via stochastic satisfiability.
\newblock In {\em Proceedings of the Sixteenth National Conference on
  Artificial Intelligence (AAAI-99)}, pages 549--556.

\bibitem[McDermott, 1999]{mcdermott99}
McDermott, D. (1999).
\newblock Using regression-match graphs to control search in planning.
\newblock {\em Artificial Intelligence}, 109(1-2):111--159.

\bibitem[Nguyen and Kambhampati, 2001]{nguyen01}
Nguyen, X. and Kambhampati, S. (2001).
\newblock Reviving partial order planning.
\newblock In {\em Proceedings of Eighteenth International Joint Conference on
  Artificial Intelligence (IJCAI-01)}, pages 459--464.

\bibitem[Onder and Pollack, 1999]{onder99}
Onder, N. and Pollack, M.~E. (1999).
\newblock Conditional, probabilistic planning: A unifying algorithm and
  effective search control mechanisms.
\newblock In {\em Proceedings of the Sixteenth National Conference on
  Artificial Intelligence (AAAI-99)}, pages 577--584.

\bibitem[Penberthy and Weld, 1992]{penberthy92}
Penberthy, J.~S. and Weld, D.~S. (1992).
\newblock {UCPOP}: A sound, complete, partial order planner for {ADL}.
\newblock In {\em Proceedings of Third International Conference on Principles
  of Knowledge Representation \& Reasoning (KR-92)}, pages 103--114.

\bibitem[Peot and Smith, 1993]{peot93a}
Peot, M.~A. and Smith, D.~E. (1993).
\newblock Threat-removal strategies for partial order planning.
\newblock In {\em Proceedings of the Eleventh National Conference on Artificial
  Intelligence (AAAI-93)}, pages 492--499.

\bibitem[Pollack et~al., 1997]{pollack97}
Pollack, M.~E., Joslin, D., and Paolucci, M. (1997).
\newblock Flaw selection strategies for partial-order planning.
\newblock {\em Journal of Artificial Intelligence Research}, 6:223--262.

\bibitem[Russell and Norvig, 2003]{russell03}
Russell, S.~J. and Norvig, P. (2003).
\newblock {\em Artificial Intelligence: A Modern Approach, Second Edition}.
\newblock Pearson Education, Upper Saddle River, NJ.

\bibitem[Smith et~al., 2000]{smith00}
Smith, D.~E., Frank, J., and Jonsson, A.~K. (2000).
\newblock Bridging the gap between planning and scheduling.
\newblock {\em Knowledge Engineering Review}, 15(1):47--83.

\bibitem[Thiebaux et~al., 2006]{thiebaux06}
Thiebaux, S., Gretton, C., Slaney, J., Price, D., and Kabanza, F. (2006).
\newblock Decision-theoretic planning with non-{Markovian} rewards.
\newblock {\em Journal of Artificial Intelligence Research}, 25.

\bibitem[Younes and Simmons, 2003]{younes03}
Younes, H. and Simmons, R. (2003).
\newblock {VHPOP}: Versatile heuristic partial order planner.
\newblock {\em Journal of Artificial Intelligence Research}, 20:405--430.

\bibitem[Younes et~al., 2005]{younes05}
Younes, H.~L., Littman, M.~L., Weissman, D., and Asmuth, J. (2005).
\newblock The first probabilistic track of the international planning
  competition.
\newblock {\em Journal of Artificial Intelligence Research}, 24:851--887.

\end{thebibliography}
