Applying Domain Analysis Techniques for Domain-Dependent Control in TALplanner

Proceedings of the 6th International Conference on Artificial Intelligence Planning Systems, AIPS 2002

Volumn , Issue , 2002, Pages 101-110

  Kvarnström, Jonas ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

'CURRENT; ANALYSIS TECHNIQUES; DOMAIN ANALYSIS; EXTRACT INFORMATIONS; IMPROVE PERFORMANCE; PLANNING DOMAINS; SEARCH TREES; STATE INVARIANTS; TEMPORAL CONTROLS;

AUTOMATION;

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

References (24)

1. Ambite, J. L.; Knoblock, C. A.; and Minton, S. 2000. Learning plan rewriting rules. In Proc. AIPS-2000, 3-12. http://www.isi.edu/∼ambite/2000-aips.ps.
2. Ambite, J. L. 1998. Planning by Rewriting. Ph.D. Dissertation, University of Southern California. http://www.isi.edu/∼ambite/thesis.ps.gz.
3. Bacchus, F., and Ady, M. 1999. Precondition control. ftp://newlogos.uwaterloo.ca/pub/bacchus/BApre.ps.gz.
4. Bacchus, F., and Kabanza, F. 2000. Using temporal logics to express search control knowledge for planning. Artificial Intelligence 116:123-191.
5. Bacchus, F. 2001. The AIPS'00 planning competition. AI Magazine 22(3):47-106. Competition web page at http://www.cs.toronto.edu/aips2000/.
6. Doherty, P., and Kvarnström, J. 2001. TALplanner: A temporal logic-based planner. AI Magazine 22(3):95-102.
7. Doherty, P.; Gustafsson, J.; Karlsson, L.; and Kvarnström, J. 1998. TAL: Temporal Action Logics - language specification and tutorial. Linköping Electronic Articles in Computer and Information Science 3(15). http://www.ep.liu.se/ea/cis/1998/015.
8. Doherty, P. 1994. Reasoning about action and change using occlusion. In Proc. ECAI-94, 401-405.
9. Fox, M., and Long, D. 1998. The automatic inference of state invariants in TIM. Journal of Artificial Intelligence Research 9:367-421.
10. Fox, M., and Long, D. 1999. The detection and exploitation of symmetry in planning domains. In Proc. IJCAI-99. http://www.dur.ac.uk/∼dcs0www/research/stanstuff/papers.html.
11. Gerevini, A., and Schubert, L. 1998. Inferring state constraints for domain-independent planning. In Proc. AAAI-98.
12. Gerevini, A., and Schubert, L. 2000. Discovering state constraints in DISCOPLAN: Some new results. In Proc. AAAI-00.
13. Gustafsson, J., and Doherty, P. 1996. Embracing occlusion in specifying the indirect effects of actions. In Proc. KR-96.
14. Haslum, P., and Jonsson, P. 2000. Planning with reduced operator sets. In Proc. AIPS-2000. AAAI Press.
15. Karlsson, L., and Gustafsson, J. 1999. Reasoning about concurrent interaction. Journal of Logic and Computation 9(5):623-650.
16. Kvarnström, J., and Doherty, P. 2000. TALplanner: A temporal logic based forward chaining planner. Annals of Mathematics and Artificial Intelligence 30:119-169.
17. Kvarnström, J.; Doherty, P.; and Haslum, P. 2000. Extending TALplanner with concurrency and resources. In Proc. ECAI-2000.
18. Kvarnström, J., and Doherty, P. 2000b. TALplanner project page. Accessible via the KPLAB web page, http://www.ida.liu.se/∼patdo/kplabsite/html/external/.
19. Lin, F. 2001. A planner called R. AI Magazine 22(3):73-76.
20. Nau, D.; Cau, Y.; Lotem, A.; and Muños-Avila, H. 1999. SHOP: Simple hierarchical ordered planner. In Dean, T., ed., Proc. IJCAI-99, 968-973. San Francisco: Morgan Kaufmann Publishers.
21. Nau, D.; Cao, Y.; Lotem, A.; and Muños-Avila, H. 2001. The SHOP planning system. AI Magazine 22(3):91-94.
22. Nebel, B.; Dimopoulos, Y.; and Koehler, J. 1997. Ignoring irrelevant facts and operators in plan generation. In Proc. ECP-97, 338-350.
23. Rintanen, J. 2000. An iterative algorithm for synthesizing invariants. In Proc. AAAI-00. http://www.informatik.unifreiburg.de/∼rintanen/CV.html.
24. Scholz, U. 2000. Extracting state constraints from PDDLlike planning domains. In Proc. AIPS Workshop on Analyzing and Exploiting Domain Knowledge for Efficient Planning, 43-48.