Ghallab, M., & Laruelle, H. (1994). Representation and control in IxTeT, a temporal planner. In Hammond, K. (Ed.), **Proceedings of the Second International Conference** on Artificial Intelligence Planning Systems**, pp. 61–67, Chicago, IL. AAAI Press.**
Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. **IEEE Transactions on Systems Science and Cybernetics**,
SSC-4 **(2), 100–107.**
Hoffmann, J. (2001). Local search topology in planning benchmarks: An empirical analysis.

In Nebel, B. (Ed.), **Proceedings of the Seventeenth International Joint Conference on** Artificial Intelligence**, pp. 453–458, Seattle, WA. Morgan Kaufmann Publishers.**
Hoffmann, J., & Nebel, B. (2001). The FF planning system: Fast **plan generation through**
heuristic search. Journal of Artificial Intelligence Research, 14**, 253–302.**
Howe, A. E., Dahlman, E., Hansen, C., Scheetz, M., & von Mayrhauser, A. (1999). Exploiting competitive planner performance. In Biundo, S., & Fox, M. (Eds.), **Proceedings**
of the 5th European Conference on Planning, Vol. 1809 of **Lecture Notes in Computer**
Science**, pp. 62–72, Durham, UK. Springer.**
Joslin, D., & Pollack, M. E. (1994). Least-cost flaw repair: A **plan refinement strategy for**
partial-order planning. In **Proceedings of the Twelfth National Conference on Artificial**
Intelligence**, pp. 1004–1009, Seattle, WA. AAAI Press.**
Kautz, H., & Selman, B. (1996). Pushing the envelope: Planning, propositional logic, and stochastic search. In **Proceedings of the Thirteenth National Conference on Artificial** Intelligence**, pp. 1194–1201, Portland, OR. AAAI Press.**
Laborie, P., & Ghallab, M. (1995). Planning with sharable resource constraints. In Mellish, C. S. (Ed.), **Proceedings of the Fourteenth International Joint Conference on Artificial** Intelligence**, pp. 1643–1649, Montreal, Canada. Morgan Kaufmann Publishers.**
McAllester, D. A., & Rosenblitt, D. (1991). Systematic nonlinear planning. In **Proceedings**
of the Ninth National Conference on Artificial Intelligence**, pp. 634–639, Anaheim,**
CA. AAAI Press.

McDermott, D. (1999). Using regression-match graphs to control search in planning. Artificial Intelligence, 109 **(1–2), 111–159.**
McDermott, D. (2000). The 1998 AI planning systems competition. AI Magazine, 21 **(2),**
35–55.

Nguyen, X., & Kambhampati, S. (2000). Extracting effective and admissible state space heuristics from the planning graph. In Proceedings of the Seventeenth National Conference on Artificial Intelligence**, pp. 798–805, Austin, TX. AAAI Press.**
Nguyen, X., & Kambhampati, S. (2001). Reviving partial order planning. In Nebel, B.

(Ed.), Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence**, pp. 459–464, Seattle, WA. Morgan Kaufmann Publishers.**
Penberthy, J. S., & Weld, D. S. (1992). UCPOP: A sound, complete, partial order planner for ADL. In Nebel, B., Rich, C., & Swartout, W. (Eds.), **Proceedings of the Third** International Conference on Principles of Knowledge Representation and Reasoning, pp. 103–114, Cambridge, MA. Morgan Kaufmann Publishers.