E. Altman, Constrained Markov Decision Processes, 1999.
URL : https://hal.archives-ouvertes.fr/inria-00074109

A. G. Barto, S. J. Bradtke, and S. P. Singh, Learning to act using real-time dynamic programming, Artificial Intelligence, vol.72, issue.1-2, 1995.
DOI : 10.1016/0004-3702(94)00011-O
URL : http://doi.org/10.1016/0004-3702(94)00011-o

D. Bertsekas, Dynamic Programming and Optimal Control Volumes), 1995.

B. Bonet and H. Geffner, Planning as heuristic search, Artificial Intelligence, vol.129, issue.1-2, 2001.
DOI : 10.1016/S0004-3702(01)00108-4

B. Bonet and H. Geffner, Labeled RTDP: Improving the convergence of real-time dynamic programming, p.3, 2003.

B. Bonet and H. Geffner, Learning depth-first search: A unified approach to heuristic search in deterministic and non-deterministic settings, and its application to MDPs, p.6, 2006.

A. Camacho, C. Muise, and S. A. Mcilraith, From FOND to robust probabilistic planning: Computing compact policies that bypass avoidable deadends, p.16, 2016.

L. López, C. Sanner, S. Yoon, and S. , A survey of the 7th international planning competition. AI Magazine. Coles, A. J. 2012. Opportunistic branched plans to maximise utility in the presence of resource uncertainty, ECAI'12, 2012.

P. Dai, . Mausam, D. S. Weld, and J. Goldsmith, Topological value iteration algorithms, 2011.

T. L. Dean and R. Givan, Model minimization in markov decision processes, p.97, 1997.

C. Domshlak and V. Mirkis, Deterministic oversubscription planning as heuristic search: Abstractions and reformulations, 2015.

R. Givan, S. M. Leach, and T. Dean, Boundedparameter Markov decision processes, 2000.

E. A. Hansen and S. Zilberstein, LAO???: A heuristic search algorithm that finds solutions with loops, Artificial Intelligence, vol.129, issue.1-2, 2001.
DOI : 10.1016/S0004-3702(01)00106-0
URL : http://doi.org/10.1016/s0004-3702(01)00106-0

M. Helmert and C. Domshlak, Landmarks, critical paths and abstractions: What's the difference anyway?, 2009.

M. Helmert, The Fast Downward planning system, 2006.

J. Hoffmann and B. Nebel, The FF planning system: Fast plan generation through heuristic search, 2001.

J. Hoffmann, Simulated penetration testing: From " Dijkstra " to " Turing Test++, p.15, 2015.

P. Hou, W. Yeoh, and P. Varakantham, Revisiting risk-sensitive MDPs: New algorithms and results, p.14, 2014.

A. Kolobov, . Mausam, D. S. Weld, and H. Geffner, Heuristic search for generalized stochastic shortest path MDPs ICAPS'11. Kolobov, A.; Mausam; and Weld Sixthsense: Fast and reliable recognition of dead ends in MDPs. AAAI'10. Kolobov, A.; Mausam; and Weld, D. S. 2012. A theory of goal-oriented MDPs with dead ends, SARSOP: Efficient point-based POMDP planning by approximating optimally reachable belief spaces. Robotics: Science and Systems IV, 2008.

J. Marecki, M. Tambe, H. B. Mcmahan, M. Likhachev, and G. J. Gordon, Towards faster planning with continuous resources in stochastic domains AAAI-08 Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees, ICML'05, 2005.

N. Meuleau, E. Benazera, R. I. Brafman, E. A. Hansen, and M. Mausam, A heuristic search approach to planning with continuous resources in stochastic domains, 2009.

C. J. Muise, S. A. Mcilraith, and J. C. Beck, Improved non-deterministic planning by exploiting state relevance, p.12, 2012.

H. Nakhost, J. Hoffmann, and M. Müller, Resourceconstrained planning: A monte carlo random walk approach, p.12, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00765030

C. Sarraute, O. Buffet, J. Hoffmann, T. Smith, R. G. Simmons et al., POMDPs make better hackers: Accounting for uncertainty in penetration testing AAAI'12 Focused real-time dynamic programming for MDPs: Squeezing more out of a heuristic Revisiting goal probability analysis in probabilistic planning (technical report) Saarland University, AAAI'06. Steinmetz, 2006.

F. Teichteil-königsbuch, U. Kuter, and G. Infantes, Incremental plan aggregation for generating policies in MDPs, p.10, 2010.

F. Teichteil-königsbuch, Stochastic safest and shortest path problems, 2012.

S. W. Yoon, A. Fern, R. Givan, H. L. Younes, M. L. Littman et al., FF-Replan: a baseline for probabilistic planning The first probabilistic track of the international planning competition, 2005.