\begin{thebibliography}{}

\bibitem[\protect\BCAY{Bacchus}{Bacchus}{2001}]{fahiem}
Bacchus, F. \BBOP2001\BBCP.
\newblock \BBOQ The {AIPS'00} planning competition\BBCQ\
\newblock {\Bem {AI} Magazine}, {\Bem 22(3)}, 47--56.

\bibitem[\protect\BCAY{Bacchus\ \BBA\ Ady}{Bacchus\ \BBA\
  Ady}{2001}]{bacchusconcurrency}
Bacchus, F.\BBACOMMA\  \BBA\ Ady, M. \BBOP2001\BBCP.
\newblock \BBOQ Planning with resources and concurrency: A forward chaining
  approach\BBCQ\
\newblock In {\Bem Proceedings of {IJCAI-01}}, \BPGS\ 417--424.

\bibitem[\protect\BCAY{Bacchus\ \BBA\ Kabanza}{Bacchus\ \BBA\
  Kabanza}{2000}]{tlplan}
Bacchus, F.\BBACOMMA\  \BBA\ Kabanza, F. \BBOP2000\BBCP.
\newblock \BBOQ Using temporal logic to express search control knowledge for
  planning\BBCQ\
\newblock {\Bem Artificial Intelligence}, {\Bem 116(1-2)}, 123--191.

\bibitem[\protect\BCAY{Blum\ \BBA\ Furst}{Blum\ \BBA\ Furst}{1995}]{blum}
Blum, A.\BBACOMMA\  \BBA\ Furst, M. \BBOP1995\BBCP.
\newblock \BBOQ Fast {P}lanning through {P}lan-graph {A}nalysis\BBCQ\
\newblock In {\Bem Proceedings of {IJCAI}-95}.

\bibitem[\protect\BCAY{Bonet, Loerincs,\ \BBA\ Geffner}{Bonet
  et~al.}{1997}]{hsp}
Bonet, B., Loerincs, G., \BBA\ Geffner, H. \BBOP1997\BBCP.
\newblock \BBOQ A robust and fast action selection mechanism for planning\BBCQ\
\newblock In {\Bem Proceedings of {AAAI}-97}, \BPGS\ 714--719. AAAI/MIT Press.

\bibitem[\protect\BCAY{Do\ \BBA\ Kambhampati}{Do\ \BBA\
  Kambhampati}{2003}]{sapa}
Do, M.~B.\BBACOMMA\  \BBA\ Kambhampati, S. \BBOP2003\BBCP.
\newblock \BBOQ Sapa: A scalable, multi-objective, heuristic, metric, temporal
  planner\BBCQ\
\newblock {\Bem Journal of Artificial Intelligence Research}, {\Bem this
  issue}.

\bibitem[\protect\BCAY{Edelkamp}{Edelkamp}{2003}]{edelkamp}
Edelkamp, S. \BBOP2003\BBCP.
\newblock \BBOQ Taming numbers and durations in the model-checking integrated
  planning system\BBCQ\
\newblock {\Bem Journal of Artificial Intelligence Research}, {\Bem this
  issue}.

\bibitem[\protect\BCAY{Fox\ \BBA\ Long}{Fox\ \BBA\ Long}{2003}]{foxl}
Fox, M.\BBACOMMA\  \BBA\ Long, D. \BBOP2003\BBCP.
\newblock \BBOQ {\sc pddl2.1}: An extension to {\sc pddl} for expressing
  temporal planning domains\BBCQ\
\newblock {\Bem Journal of Artificial Intelligence Research}, {\Bem this
  issue}.

\bibitem[\protect\BCAY{Garrido, Fox,\ \BBA\ Long}{Garrido
  et~al.}{2002}]{tpsys2}
Garrido, A., Fox, M., \BBA\ Long, D. \BBOP2002\BBCP.
\newblock \BBOQ Temporal planning with {PDDL2.1}\BBCQ\
\newblock In {\Bem Proceedings of ECAI-02}.

\bibitem[\protect\BCAY{Garrido, Onaind{\'{\i}}a,\ \BBA\ Barber}{Garrido
  et~al.}{2001}]{tpsys1}
Garrido, A., Onaind{\'{\i}}a, E., \BBA\ Barber, F. \BBOP2001\BBCP.
\newblock \BBOQ Time-optimal planning in temporal problems\BBCQ\
\newblock In {\Bem Proceedings {ECP}-01}.

\bibitem[\protect\BCAY{Gerevini, Saetti,\ \BBA\ Serina}{Gerevini
  et~al.}{2003}]{lpg}
Gerevini, A., Saetti, A., \BBA\ Serina, I. \BBOP2003\BBCP.
\newblock \BBOQ Planning through stochastic local search and temporal action
  graphs in {LPG}\BBCQ\
\newblock {\Bem Journal of Artificial Intelligence Research}, {\Bem this
  issue}.

\bibitem[\protect\BCAY{Ghallab\ \BBA\ Laruelle}{Ghallab\ \BBA\
  Laruelle}{1994}]{ixtetoriginal}
Ghallab, M.\BBACOMMA\  \BBA\ Laruelle, H. \BBOP1994\BBCP.
\newblock \BBOQ Representation and control in {IxTeT}, a temporal planner\BBCQ\
\newblock In {\Bem Proceedings of {AIPS}-94}.

\bibitem[\protect\BCAY{Haslum\ \BBA\ Geffner}{Haslum\ \BBA\
  Geffner}{2001}]{haslum}
Haslum, P.\BBACOMMA\  \BBA\ Geffner, H. \BBOP2001\BBCP.
\newblock \BBOQ Heuristic planning with time and resources\BBCQ\
\newblock In {\Bem Proceedings of ECP-01, Toledo}.

\bibitem[\protect\BCAY{Hoffmann}{Hoffmann}{2003a}]{metricff}
Hoffmann, J. \BBOP2003a\BBCP.
\newblock \BBOQ The {Metric-FF} planning system: Translating ``ignoring delete
  lists'' to numerical state variables\BBCQ\
\newblock {\Bem Journal of Artificial Intelligence Research}, {\Bem this
  issue}.

\bibitem[\protect\BCAY{Hoffmann}{Hoffmann}{2003b}]{hofftop}
Hoffmann, J. \BBOP2003b\BBCP.
\newblock \BBOQ Where ignoring delete-lists works: local search topology in
  planning benchmarks\BBCQ\
\newblock \BTR\ 185, Institut f{\"u}r Informatik, Albert-Ludwigs
  Universit{\"a}t, Freiburg.

\bibitem[\protect\BCAY{Hoffmann\ \BBA\ Nebel}{Hoffmann\ \BBA\ Nebel}{2000}]{ff}
Hoffmann, J.\BBACOMMA\  \BBA\ Nebel, B. \BBOP2000\BBCP.
\newblock \BBOQ The {FF} planning system: Fast plan generation through
  heuristic search\BBCQ\
\newblock {\Bem Journal of Artificial Intelligence Research}, {\Bem 14},
  253--302.

\bibitem[\protect\BCAY{Howe\ \BBA\ Dahlman}{Howe\ \BBA\ Dahlman}{2002}]{howe}
Howe, A.\BBACOMMA\  \BBA\ Dahlman, E. \BBOP2002\BBCP.
\newblock \BBOQ A critical assessment of benchmark comparison in planning\BBCQ\
\newblock {\Bem Journal of Artificial Intelligence Research}, {\Bem 17}, 1--33.

\bibitem[\protect\BCAY{Kanji}{Kanji}{1999}]{kanji}
Kanji, G. \BBOP1999\BBCP.
\newblock {\Bem 100 Statistical Tests}.
\newblock Sage Publications.

\bibitem[\protect\BCAY{Kvarnstr{\"o}m\ \BBA\ Magnusson}{Kvarnstr{\"o}m\ \BBA\
  Magnusson}{2003}]{talplanner}
Kvarnstr{\"o}m, J.\BBACOMMA\  \BBA\ Magnusson, M. \BBOP2003\BBCP.
\newblock \BBOQ Talplanner in the 3rd international planning competition:
  Extensions and control rules\BBCQ\
\newblock {\Bem Journal of Artificial Intelligence Research}, {\Bem this
  issue}.

\bibitem[\protect\BCAY{Laborie\ \BBA\ Ghallab}{Laborie\ \BBA\
  Ghallab}{1995}]{ixtet}
Laborie, P.\BBACOMMA\  \BBA\ Ghallab, M. \BBOP1995\BBCP.
\newblock \BBOQ Planning with sharable resource constraints\BBCQ\
\newblock In {\Bem Proceedings of {IJCAI}-95}. Morgan Kaufmann.

\bibitem[\protect\BCAY{Long}{Long}{2000}]{aimag98}
Long, D. \BBOP2000\BBCP.
\newblock \BBOQ The {AIPS'98} {P}lanning {C}ompetition: Competitors'
  perspective\BBCQ\
\newblock {\Bem {AI} Magazine}, {\Bem 21\/}(2).

\bibitem[\protect\BCAY{McDermott}{McDermott}{2000}]{drewaimag}
McDermott, D. \BBOP2000\BBCP.
\newblock \BBOQ The 1998 {AI} planning systems competition\BBCQ\
\newblock {\Bem {AI} Magazine}, {\Bem 21\/}(2).

\bibitem[\protect\BCAY{McDermott\ \BBA\ the {AIPS'98} Planning
  Competition~Committee}{McDermott\ \BBA\ the {AIPS'98} Planning
  Competition~Committee}{1998}]{pddl}
McDermott, D.\BBACOMMA\  \BBA\ the {AIPS'98} Planning Competition~Committee
  \BBOP1998\BBCP.
\newblock \BBOQ {PDDL}--the planning domain definition language\BBCQ\
\newblock \BTR, Available at: {\small {\tt www.cs.yale.edu/homes/dvm}}.

\bibitem[\protect\BCAY{McDermott}{McDermott}{1996}]{unpop}
McDermott, D. \BBOP1996\BBCP.
\newblock \BBOQ A heuristic estimator for means ends analysis in planning\BBCQ\
\newblock In {\Bem Proceedings of {AIPS}-96}, \BPGS\ 142--149. AAAI Press.

\bibitem[\protect\BCAY{Nau, Au, Ilghami, Kuter, Murdoch, Wu,\ \BBA\ Yaman}{Nau
  et~al.}{2003}]{shop2}
Nau, D., Au, T.-C., Ilghami, O., Kuter, U., Murdoch, J., Wu, D., \BBA\ Yaman,
  F. \BBOP2003\BBCP.
\newblock \BBOQ {SHOP2}: An {HTN} planning environment\BBCQ\
\newblock {\Bem Journal of Artificial Intelligence Research}, {\Bem this
  issue}.

\bibitem[\protect\BCAY{Onaind{\'i}a, Sapena, Sebastia,\ \BBA\
  Marzal}{Onaind{\'i}a et~al.}{2001}]{simplanner}
Onaind{\'i}a, E., Sapena, O., Sebastia, L., \BBA\ Marzal, E. \BBOP2001\BBCP.
\newblock \BBOQ Sim{P}lanner: an execution-monitoring system for replanning in
  dynamic worlds\BBCQ\
\newblock In {\Bem Proceedings of {EPIA}-01}.

\bibitem[\protect\BCAY{Parker}{Parker}{1999}]{semsyn}
Parker, E. \BBOP1999\BBCP.
\newblock \BBOQ Making graphplan goal-directed\BBCQ\
\newblock In {\Bem Proceedings of {ECP}-99}, \BPGS\ 333--346.

\bibitem[\protect\BCAY{Penberthy\ \BBA\ Weld}{Penberthy\ \BBA\
  Weld}{1994}]{zeno}
Penberthy, J.\BBACOMMA\  \BBA\ Weld, D. \BBOP1994\BBCP.
\newblock \BBOQ Temporal planning with continuous change\BBCQ\
\newblock In {\Bem Proceedings of {AAAI}-94}. AAAI/MIT Press.

\bibitem[\protect\BCAY{Porteous, Sebastia,\ \BBA\ Hoffmann}{Porteous
  et~al.}{2001}]{landmarks}
Porteous, J., Sebastia, L., \BBA\ Hoffmann, J. \BBOP2001\BBCP.
\newblock \BBOQ On the extraction, ordering, and usage of landmarks in
  planning\BBCQ\
\newblock In {\Bem Proceedings of {ECP-01}}.

\bibitem[\protect\BCAY{Sebastia, Onaind{\'i}a,\ \BBA\ Marzal}{Sebastia
  et~al.}{2001}]{stella}
Sebastia, L., Onaind{\'i}a, E., \BBA\ Marzal, E. \BBOP2001\BBCP.
\newblock \BBOQ {SteLLa}: An optimal sequential and parallel planner\BBCQ\
\newblock In {\Bem Proceedings of {EPIA}-01}.

\bibitem[\protect\BCAY{Smith\ \BBA\ Weld}{Smith\ \BBA\ Weld}{1999}]{tgp}
Smith, D.~E.\BBACOMMA\  \BBA\ Weld, D.~S. \BBOP1999\BBCP.
\newblock \BBOQ Temporal planning with mutual exclusion reasoning\BBCQ\
\newblock In {\Bem Proceedings of {IJCAI}-99}, \BPGS\ 326--337.

\bibitem[\protect\BCAY{Wu\ \BBA\ Nau}{Wu\ \BBA\ Nau}{2002}]{umtranslog}
Wu, D.\BBACOMMA\  \BBA\ Nau, D. \BBOP2002\BBCP.
\newblock \BBOQ {\sc um-t}ranslog-2: a planning domain designed for
  {AIPS}-02\BBCQ\
\newblock \BTR\ CS-TR-4402, University of Maryland.

\bibitem[\protect\BCAY{Younes\ \BBA\ Simmons}{Younes\ \BBA\
  Simmons}{2003}]{vhpop}
Younes, H.\BBACOMMA\  \BBA\ Simmons, R. \BBOP2003\BBCP.
\newblock \BBOQ {\sc vhpop}: Versatile heuristic partial order planner\BBCQ\
\newblock {\Bem Journal of Artificial Intelligence Research}, {\Bem this
  issue}.

\end{thebibliography}
