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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.809

R. Finke and N. Nilsson, STRIPS: A new approach to the application of theorem proving to problem solving, Artificial Intelligence, vol.34, issue.2, pp.189-208, 1971.

S. Koenig and R. Simmons, Real-time search in nondeterministic domains, Proceedings of the International Joint Conference on Artificifial Intelligence, pp.1660-1669, 1995.

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

B. Bonet, G. Loerincs, and H. Geffner, A Robust and Fast Action Selection Mechanism for Planning, Proceedings of the AAAI Conference on Artificial Intelligence, pp.714-719, 1997.

V. Bulitko and G. Lee, Learning in Real-Time Search: A Unifying Framework, Journal of Artificial Intelligence Research, vol.25, pp.119-157, 2006.

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

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

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

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

J. Hoffmann, J. Porteous, and L. Sebastia, Ordered Landmarks in Planning, Journal of Artificial Intelligence Research, vol.22, pp.215-278, 2004.

C. Hsu, B. Wah, and Y. Chen, SUBGOAL ORDERING AND GRANULARITY CONTROL FOR INCREMENTAL PLANNING, Proceedings of the International Conference on Tools with Artificial Intelligence, pp.507-514, 2005.
DOI : 10.1142/S0218213007003515

S. Richter and M. Westphal, The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks, Journal of Artificial Intelligence Research, vol.1, issue.39, pp.127-177, 2010.

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

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

L. Shue and R. Zamani, An admissible heuristic search algorithm, Proceedings of the International Syposium on Methodologies for Intelligent Systems, pp.69-75, 1993.
DOI : 10.1007/3-540-56804-2_7

V. Bulitko, M. Lustrek, J. Schaeffer, Y. Bjornsson, and S. Sigmundarson, Dynamic Control in Real-Time Heuristic Search, Journal of Artificial Intelligence Research, vol.32, issue.1, pp.419-452, 2008.

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

URL : http://doi.org/10.1016/s0004-3702(96)00047-1

A. Botea and A. Ciré, Incremental Heuristic Search for Planning with Temporally Extended Goals and Uncontrollable Events, Proceedings of the International Conference on Automated Planning and Scheduling, pp.1647-1652, 2009.

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

Y. Chen, Y. Xu, and G. Yao, Stratified Planning, Proceedings of the Internation Joint Conference on Artificifial Intelligence, pp.1665-1670, 2009.