Benton J., Coles A. & Coles A. 2012. Temporal planning with preferences and time-dependent continuous costs. In International Conference on Automated Planning and Scheduling (ICAPS), 2–10.

Chen Y., Wah B. & Hsu C. 2006. Temporal planning using subgoal partitioning and resolution in SGPlan. Journal of Artificial Intelligence Research 26, 323–369.

Coles A., Coles A., Fox M. & Long D. 2010. Forward-chaining partial-order planning. In International Conference on Automated Planning and Scheduling (ICAPS), 42–49.

Domshlak C., Karpas E. & Markovitch S. 2010. To max or not to max: online learning for speeding up optimal planning. In AAAI Conference on Artificial Intelligence.

Eyerich P. 2012. Preferring properly: increasing coverage while maintaining quality in anytime temporal planning. In Proceedings of the European Conference on Artificial Intelligence (ECAI), 312–317.

Eyerich P., Mattmüller R. & Röger G. 2009. Using the context-enhanced additive heuristic for temporal and numeric planning. In Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS).

Helmert M. 2004. A planning heuristic based on causal graph analysis. In International Conference on Automated Planning and Scheduling (ICAPS), 161–170.

Helmert M. 2006. The fast downward planning system. Journal of Articial Intelligence Research 26, 191–246.

Helmert M., Haslum P., Hoffmann J. & Nissim R. 2013. Merge & shrink abstraction: a method for generating lower bounds in factored state spaces. Journal of the ACM 61, 1–16:63.

Helmert M., Röger G. & Karpas E. 2011. Fast downward stone soup: a baseline for building planner portfolios. In Proceedings of the ICAPS-2011 Workshop on Planning and Learning (PAL), 28–35.

Hoffmann J. 2002. Extending FF to numerical state variables. In Proceedings of the 15th European Conference on Artificial Intelligence (ECAI), 571–575.

Hoffman J. & Nebel B. 2001. The FF planning system: fast planning generation through heuristic search. Journal of Artificial Intelligence Research 14, 253–302.

Hoffmann J., Porteous J. & Sebastia L. 2004. Ordered landmarks in planning. Journal of Artificial Intelligence Research 22, 215–278.

Keyder E. & Geffner H. 2008. Heuristics for planning with action costs revisited. In European Conference on Artificial Intelligence (ECAI), 588–592.

Khouadjia M., Schoenauer M., Vidal V., Dréo J. & Savéant P. 2013. Multi-objective AI planning: comparing aggregation and pareto approaches. In Proceedings of the 13th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP), 7832: 202–213.

Kvarnström J. 2011. Planning for loosely coupled agents using partial order forward-chaining. International Conference on Automated Planning and Scheduling (ICAPS), 138–145.

Lipovetzky N. & Geffner H. 2009. Inference and decomposition in planning using causal consistent chains. Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling (ICAPS), 217–224.

Richter S. & Westphal M. 2010. The LAMA planner: guiding cost-based anytime planning with landmarks. Journal of Artificial Intelligence Research 29(1), 127–177.

Russell S. J. & Norvig P. 2009. Artificial Intelligence: A Modern Approach, 3rd edition. Prentice Hall.

Sapena O., Onaindía E. & Torreño A. 2015. FLAP: applying least-commitment in forward-chaining planning. AI Communications 28(1), 5–20.

Sebastia L., Onaindía E. & Marzal E. 2006. Decomposition of planning problems. AI Communications 19(1), 49–81.

Torreño A., Onaindía E. & Sapena O. 2014. FMAP: distributed cooperative multi-agent planning. Applied Intelligence 41(2), 606–626.

Vidal V. 2003. A lookahead strategy for solving large planning problems. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI), 1524–1525.

Vidal V. 2011. YAHSP2: keep it simple, stupid. In Proceedings of the 7th International Planning Competition (IPC-2011), 83–90.