Bibliography

1

Bitner, J. R., & Reingold, E. M. (1975).
Backtrack programming techniques.
Communications of the ACM, 18(11), 651-656.

2

Blum, A. L., & Furst, M. L. (1997).
Fast planning through planning graph analysis.
Artificial Intelligence, 90(1-2), 281-300.

3

Bonet, B., & Geffner, H. (2001a).
Heuristic Search Planner 2.0.
AI Magazine, 22(3), 77-80.

4

Bonet, B., & Geffner, H. (2001b).
Planning as heuristic search.
Artificial Intelligence, 129(1-2), 5-33.

5

Bonet, B., Loerincs, G., & Geffner, H. (1997).
A robust and fast action selection mechanism for planning.
In Proceedings of the Fourteenth National Conference on Artificial Intelligence, pp. 714-719, Providence, RI. AAAI Press.

6

Dechter, R., Meiri, I., & Pearl, J. (1991).
Temporal constraint networks.
Artificial Intelligence, 49(1-3), 61-95.

7

Gerevini, A., & Schubert, L. (1996).
Accelerating partial-order planners: Some techniques for effective search control and pruning.
Journal of Artificial Intelligence Research, 5, 95-137.

8

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.

9

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.

10

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.

11

Hoffmann, J., & Nebel, B. (2001).
The FF planning system: Fast plan generation through heuristic search.
Journal of Artificial Intelligence Research, 14, 253-302.

12

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.

13

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.

14

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.

15

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.

16

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.

17

McDermott, D. (1999).
Using regression-match graphs to control search in planning.
Artificial Intelligence, 109(1-2), 111-159.

18

McDermott, D. (2000).
The 1998 AI planning systems competition.
AI Magazine, 21(2), 35-55.

19

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.

20

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.

21

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.

22

Penberthy, J. S., & Weld, D. S. (1994).
Temporal planning with continuous change.
In Proceedings of the Twelfth National Conference on Artificial Intelligence, pp. 1010-1015, Seattle, WA. AAAI Press.

23

Peot, M. A., & Smith, D. E. (1993).
Threat-removal strategies for partial-order planning.
In Proceedings of the Eleventh National Conference on Artificial Intelligence, pp. 492-499, Washington, DC. AAAI Press.

24

Pollack, M. E., Joslin, D., & Paolucci, M. (1997).
Flaw selection strategies for partial-order planning.
Journal of Artificial Intelligence Research, 6, 223-262.

25

Purdom, Jr., P. W. (1983).
Search rearrangement backtracking and polynomial average time.
Artificial Intelligence, 21(1-2), 117-133.

26

Refanidis, I., & Vlahavas, I. (2001).
The GRT planning system: Backward heuristic construction in forward state-space planning.
Journal of Artificial Intelligence Research, 15, 115-161.

27

Schubert, L., & Gerevini, A. (1995).
Accelerating partial order planners by improving plan and goal choices.
In Proceedings of the Seventh International Conference on Tools with Artificial Intelligence, pp. 442-450, Herndon, VA. IEEE Computer Society Press.

28

Smith, D. E., Frank, J., & Jónsson, A. K. (2000).
Bridging the gap between planning and scheduling.
Knowledge Engineering Review, 15(1), 47-83.

29

Veloso, M. M., & Blythe, J. (1994).
Linkability: Examining causal link commitments in partial-order planning.
In Hammond, K. (Ed.), Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, pp. 170-175, Chicago, IL. AAAI Press.

30

Vere, S. A. (1983).
Planning in time: Windows and durations for activities and goals.
IEEE Transactions on Pattern Analysis and Machine Intelligence, 5(3), 246-267.

31

Weld, D. S. (1994).
An introduction to least commitment planning.
AI Magazine, 15(4), 27-61.

32

Williamson, M., & Hanks, S. (1996).
Flaw selection strategies for value-directed planning.
In Drabble, B. (Ed.), Proceedings of the Third International Conference on Artificial Intelligence Planning Systems, pp. 237-244, Edinburgh, Scotland. AAAI Press.

33

Younes, H. L. S., & Simmons, R. G. (2002).
On the role of ground actions in refinement planning.
In Ghallab, M., Hertzberg, J., & Traverso, P. (Eds.), Proceedings of the Sixth International Conference on Artificial Intelligence Planning and Scheduling Systems, pp. 54-61, Toulouse, France. AAAI Press.