Reducing accidental complexity in planning problems

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 1898-1903

  Haslum, Patrik ^a  

^a CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

DOMAIN-INDEPENDENT PLANNER; PLANNING PROBLEM; POLYNOMIAL-TIME; PROBLEM COMPLEXITY; PROBLEM REFORMULATIONS; PROBLEM SPECIFICATION; PROBLEM TRANSFORMATIONS; STRIPS PLANNING;

ABSTRACTING; POLYNOMIAL APPROXIMATION;

PROBLEM SOLVING;

EID: 57749190745     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. F. Bacchus and Q. Yang. Downward refinement and the efficiency of hierarchical problem solving. Artificial Intelligence, 71(1):43-100, 1994.
2. C. Bäckström and P. Jonsson. Planning with abstraction hierarchies can be exponentially less efficient. In Proc. 14th International Joint Conference on Artificial Intelligence (IJCAI'95), pages 1599-1605, 1995.
3. B. Bonet and H. Geffner. Planning as heuristic search. Artificial Intelligence, 129(1-2):5-33, 2001. (Pubitemid 32498414)
4. A. Botea, M. Enzenberger, M. Mueller, and J. Schaeffer. Macro-FF: Improving AI planning with automatically learned macro-operators. Journal of AI Research, 24:581-621, 2005. (Pubitemid 43130945)
5. T. Bylander. Complexity results for planning. In Proc. 12th International Joint Conference on Artificial Intelligence (IJCAI'91), pages 274-279, 1991.
6. Y. Chen, B.W. Wah, and C. Hsu. Temporal planning using subgoal partitioning and resolution in SGPlan. Journal of AI Research, 26:323-369, 2006. (Pubitemid 44452214)
7. C. Domshlak and R. Brafman. Factored planning: How, when and when not. In Proc. 21st National Conference on Artificial Intelligence (AAAI' 06), 2006.
8. S. Edelkamp and M. Helmert. Exhibiting knowledge in planning problems to minimize state encoding length. In Proc. 5th European Conference on Planning (ECP' 99), pages 135-147, 1999.
9. Patrik Haslum and Peter Jonsson. Planning with reduced operator sets. In Proc. 5:th International Conference on Artificial Intelligence Planning and Scheduling (AIPS'00), pages 150-158, 2000.
10. M. Helmert. Fast (diagonally) downward. In 5th International Planning Competition Booklet, 2006. Available at http://zeus.ing.unibs.it/ipc-5/.
11. Malte Helmert. Solving Planning Tasks in Theory and Practice. PhD thesis, Albert-Ludwigs Universität Freiburg, 2006.
12. P. Jonsson and C. Bäckström. State-variable planning under structural restrictions: Algorithms and complexity. Artificial Intelligence, 100(1-2):125-176, 1998. (Pubitemid 128403239)
13. A. Junghanns and J. Schaeffer. Sokoban: Enhancing general single-agent search methods using domain knowledge. Artificial Intelligence, 129(1-2):219-251, 2001. (Pubitemid 32498421)
14. C.A. Knoblock. Automatically generating abstractions for planning. Artificial Intelligence, 68:243-302, 1994.
15. U. Scholz. Reducing Planning Problems by Path Reduction. PhD thesis, Technischen Universität Darmstadt, 2004.
16. L. Sebastia, E. Onaindia, and E. Marzal. Decomposition of planning problems. Artificial Intelligence Communications, 19(1):49-81, 2006. (Pubitemid 43343361)