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

A. Blum and M. Furst, Fast planning through planning graph analysis, Artificial Intelligence, vol.90, issue.1-2, pp.1636-1642, 1997.
DOI : 10.1016/S0004-3702(96)00047-1

B. Bonet, G. Loerincs, and H. Geffner, A Robust and Fast Action Selection Mechanism for Planning, AAAI, pp.714-719, 1997.

A. Botea and A. Ciré, Incremental Heuristic Search for Planning with Temporally Extended Goals and Uncrontrollable Events, ICAPS, 2009.

V. Bulitko and G. Lee, Learning in Real-Time Search : A Unifying Framework, JAIR, vol.25, pp.119-157, 2006.

Y. Chen, Y. Xu, and G. Yao, Stratified Planning, ?CAI, 2009.

P. Fabiani, V. Fuertes, G. Besnerais, R. Mampey, A. Piquereau et al., The ReSSAC Autonomous Helicopter : Flying in a Non-Cooperative Uncertain World with embedded Vision and Decision Making, A.H.S Forum, 2007.

R. Finke and N. Nilsson, STRIPS : A new approach to the application of theorem proving to problem solving, Artif. Intell, issue.2, pp.3-4, 1971.

D. Furcy and S. Koenig, Speeding up the Convergence of Real-Time Search, AAAI, pp.891-897, 2000.

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

P. Hart, N. Nilsson, and B. Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Transactions on Systems Science and Cybernetics, vol.4, issue.2, pp.100-107, 1968.
DOI : 10.1109/TSSC.1968.300136

C. Hernández, S. Concepción, and P. Meseguer, Lookahead, Propagation and Moves in Real-Time Heuristic Search, International Symposium on Combinatorial Search, 2009.

J. Hoffmann and B. Nebel, The FF Planning System : Fast Plan Generation Through Heuristic Search, JAIR, vol.14, issue.1, pp.253-302, 2001.

J. Hoffmann, J. Porteous, and L. Sebastia, Ordered Landmarks in Planning, JAIR, vol.22, pp.215-278, 2004.

C. Hsu, B. Wah, and Y. Chen, SUBGOAL ORDERING AND GRANULARITY CONTROL FOR INCREMENTAL PLANNING, ICTAI, pp.507-514, 2005.
DOI : 10.1142/S0218213007003515

J. Koehler and J. Hoffmann, On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm, JAIR, vol.12, pp.339-386, 2000.

S. Koenig and X. Sun, Comparing real-time and incremental heuristic search for real-time situated agents, Autonomous Agents and Multi-Agent Systems, vol.37, issue.5, pp.313-341, 2009.
DOI : 10.1007/s10458-008-9061-x

R. Korf, Real-time heuristic search, Artificial Intelligence, vol.42, issue.2-3, pp.189-211, 1990.
DOI : 10.1016/0004-3702(90)90054-4

I. Pohl, Heuristic search viewed as path finding in a graph, Artificial Intelligence, vol.1, issue.3-4, 1970.
DOI : 10.1016/0004-3702(70)90007-X

S. Richter, M. Helmet, and M. Westphal, Landmarks Revisited, AAAI, pp.975-982, 2008.

S. Richter and M. Westphal, The LAMA Planner Using Landmark Counting in Heuristic Search, ICAPS, 2008.

M. Shimbo and T. Ishida, Controlling the learning process of real-time heuristic search, Artificial Intelligence, vol.146, issue.1, pp.1-41, 2003.
DOI : 10.1016/S0004-3702(03)00012-2