Abstraction-based action ordering in planning

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 1220-1225

  Fox, Maria ^a   Long, Derek ^a   Porteous, Julie ^a  

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

PLANNING PROBLEM; PROBLEM DOMAIN; SEARCH SPACES; SYMMETRIC STRUCTURES; SYMMETRY-BREAKING;

ARTIFICIAL INTELLIGENCE;

ABSTRACTING;

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

References (15)

1. G. Audemard and B. Benhamou. Reasoning by symmetry and function ordering in finite model generation. In Proc. 18th Int. Conf. on Automated Deduction (CADE-18), volume 2392 of LNCS, 2002.
2. M. Fox and D. Long. The automatic inference of state invariants in TIM . JAIR, 9, 1998.
3. M. Fox and D. Long. The Detection and Exploitation of Symmetry in Planning. In Proc. of the 16th Int. Joint Conf. on AI (IJCAI), 1999.
4. M. Fox and D. Long. Extending the exploitation of symmetries in planning. In Proc. of AIPS'02, 2002.
5. M. Fox and D. Long. An extension to PDDL for expressing temporal planning domains. Journal of AI Research, 20, 2003.
6. I. P. Gent and B. Smith. Symmetry breaking during search in constraint programming. In Proc. of ECAI, 2000.
7. J. Hoffmann and B. Nebel. The FF planning system: Fast plan generation through heuristic search. JAIR, 14, 2001.
8. J. Hoffmann, 2002. The FF-v2.3 planner is available to download from http://www.informatik.unifreiburg.de/∼hoffmann/ff.html.
9. C. Norris Ip and David L. Dill. Better verification through symmetry. Formal Methods in System Design, 9, 1996.
10. D. Joslin and A. Roy. Exploiting symmetry in lifted CSPs. In Proc. of 14th National Conf. on AI (AAAI-97), 1997.
11. D. Long and M. Fox. Plan permutation symmetries as a source of planner inefficiency. In Proc. of UK Workshop on Planning and Scheduling, 2003.
12. B. McKay. Nauty Users Guide 1.5. Technical Report TR-CS-90-02, Australian National University, 1990.
13. J. Rintanen. Symmetry reduction for SAT representations of transition systems. In Proc. of the 13th Int. Conf. on Planning and Scheduling, 2003.
14. C.M. Roney-Dougal, I.P. Gent, T. Kelsey, and S. Linton. Tractable symmetry breaking using restricted search trees. In Proceedings of ECAI, 2004.
15. P. Roy and F. Pachet. Using symmetry of global constraints to speed up the resolution of CSPs. In Workshop on Non-binary Constraints, ECAI, 1998.