M. Baioletti, S. Marcugini, and A. Milani, Dpplan: An algorithm for fast solutions extraction from a planning graph, AIPS, pp.13-21, 2000.

A. Blum and M. Furst, Fast planning through planning graph analysis, IJCAI, pp.1636-1642, 1995.

M. Büttner and J. Rintanen, Improving parallel planning with constraints on the number of operators, ICAPS, pp.292-299, 2005.

M. B. Do and S. Kambhampati, Planning as constraint satisfaction: Solving the planning graph by compiling it into csp, Artificial Intelligence, vol.132, issue.2, pp.151-182, 2001.

S. Grandcolas and C. Pain-barre, Filtering, decomposition and search space reduction for optimal sequential planning, AAAI, pp.993-998, 2007.
URL : https://hal.archives-ouvertes.fr/hal-02471078

P. Haslum and H. Geffner, Admissible heuristics for optimal planning, AIPS, pp.140-149, 2000.

H. A. Kautz and B. Selman, Unifying sat-based and graph-based planning, IJCAI, pp.318-325, 1999.

R. Korf, Macro-operators: A weak method for learning, Artificial Intelligence, vol.26, issue.1, pp.35-77, 1985.

A. Mackworth, Consistency in networks of relations, Artificial Intelligence, vol.8, pp.99-118, 1977.

S. M. Majercik and M. L. Littman, Maxplan: A new approach to probabilistic planning, AAAI, pp.86-93, 1998.

J. Rintanen, A planning algorithm not based on directional search, KR, pp.617-625, 1998.