Fast planning through planning graph analysis, Artificial Intelligence, vol.90, issue.1-2, pp.279-298, 1997. ,
DOI : 10.1016/S0004-3702(96)00047-1
Planning as heuristic search, Artificial Intelligence, vol.129, issue.1-2, pp.5-33, 2001. ,
DOI : 10.1016/S0004-3702(01)00108-4
Heuristics for planning with penalties and rewards formulated in logic and computed through circuits, Artificial Intelligence, vol.172, issue.12-13, pp.12-13, 2008. ,
DOI : 10.1016/j.artint.2008.03.004
Strengthening landmark heuristics via hitting sets, Proceedings of the 19th European Conference on Artificial Intelligence, 2010. ,
A robust and fast action selection mechanism for planning, Proceedings of the 14th National Conference of the American Association for Artificial Intelligence, 1997. ,
The computational complexity of propositional STRIPS planning, Artificial Intelligence, vol.69, issue.1-2, pp.165-204, 1994. ,
DOI : 10.1016/0004-3702(94)90081-7
Automatic generation of temporal planning domains for??e-learning problems, Journal of Scheduling, vol.22, issue.1, pp.347-362, 2010. ,
DOI : 10.1007/s10951-009-0140-x
Acquisition of object-centred domain models from planning examples, Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009. ,
Planning with pattern databases, Recent Advances in AI Planning . 6th European Conference on Planning, 2001. ,
PDDL2.1: An extension to PDDL for expressing temporal planning domains, Journal of Artificial Intelligence Research, vol.20, pp.61-124, 2003. ,
Planning through stochastic local search and temporal action graphs, Journal of Artificial Intelligence Research, vol.20, pp.239-290, 2003. ,
Automated Planning: Theory and Practice, 2004. ,
Admissible heuristics for optimal planning, Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems, 2000. ,
Landmarks, critical paths and abstractions: What's the difference anyway?, Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009. ,
Flexible abstraction heuristics for optimal sequential planning, Proceedings of the 17th International Conference on Automated Planning and Scheduling, 2007. ,
Where ignoring delete lists works, part II: Causal graphs, Proceedings of the 21st International Conference on Automated Planning and Scheduling, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00578653
Local search topology in planning benchmarks: An empirical analysis, Proceedings of the 17th International Joint Conference on Artificial Intelligence, 2001. ,
Local search topology in planning benchmarks: A theoretical analysis, Proceedings of the 6th International Conference on Artificial Intelligence Planning and Scheduling, 2002. ,
The Metric-FF planning system: Translating " ignoring delete lists " to numeric state variables, Journal of Artificial Intelligence Research, vol.20, pp.291-341, 2003. ,
Utilizing Problem Structure in Planning: A Local Search Approach, Lecture Notes in Artificial Intelligence, vol.2854, 2003. ,
DOI : 10.1007/b93903
Where 'ignoring delete lists' works: Local search topology in planning benchmarks, Journal of Artificial Intelligence Research, vol.24, pp.685-758, 2005. ,
Analyzing search topology without running any search: On the connection between causal graphs and h +, Journal of Artificial Intelligence Research, vol.41, pp.155-229, 2011. ,
URL : https://hal.archives-ouvertes.fr/inria-00598248
The FF planning system: Fast plan generation through heuristic search, Journal of Artificial Intelligence Research, vol.14, pp.253-302, 2001. ,
SAP speaks PDDL, Proceedings of the 24th AAAI Conference on Artificial Intelligence, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00491123
Cost-optimal planning with landmarks, Proceedings of the 21st International Joint Conference on Artificial Intelligence, 2009. ,
Optimal additive composition of abstraction-based admissible heuristics, Proceedings of the 18th International Conference on Automated Planning and Scheduling, 2008. ,
Waking up a sleeping rabbit: On natural-language sentence generation with FF, Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00491109
EXPERIENCES WITH PLANNING FOR NATURAL LANGUAGE GENERATION, Computational Intelligence, vol.19, issue.4, pp.23-40, 2011. ,
DOI : 10.1111/j.1467-8640.2010.00370.x
Attack planning in the real world, Proceedings of the 2nd Workshop on Intelligent Security, 2010. ,
A heuristic estimator for means-ends analysis in planning, Proceedings of the 3rd International Conference on Artificial Intelligence Planning Systems, 1996. ,
The PDDL Planning Domain Definition Language, The AIPS-98 Planning Competition Committee, 1998. ,
Preferred operators and deferred evaluation in satisficing planning, Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009. ,
The LAMA planner: Guiding cost-based anytime planning with landmarks, Journal of Artificial Intelligence Research, vol.39, pp.127-177, 2010. ,
Heuristics for Planning with SAT, Proceedings of the 16th International Conference on Principles and Practice of Constraint Programming, 2010. ,
DOI : 10.1007/978-3-642-15396-9_34
Planning as satisfiability: parallel plans and algorithms for plan search, Artificial Intelligence, vol.170, issue.12-13, pp.12-13, 2006. ,
DOI : 10.1016/j.artint.2006.08.002
On-line planning and scheduling: An application to controlling modular printers, Journal of Artificial Intelligence Research, vol.40, pp.415-468, 2011. ,
Planning domain definition using GIPO, The Knowledge Engineering Review, vol.22, issue.02, pp.117-134, 2007. ,
DOI : 10.1017/S0269888907001063
Bounded suboptimal search: A direct approach using inadmissible estimates, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, 2011. ,
0: an integrated tool for designing planning domains, Proceedings of the 17th International Conference on Automated Planning and Scheduling, 2007. ,