Automatic Synthesis and use of Generic Types in Planning

Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems, AIPS 2000

Volumn , Issue , 2000, Pages 196-205

  Long, Derek ^a   Fox, Maria ^a  

^a DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

SIGNAL ENCODING;

ALGORITHMIC ISSUES; AUTOMATIC SYNTHESIS; DOMAIN DEPENDENT PLANNING; DOMAIN-INDEPENDENT PLANNING; EFFICIENT PLANNING; ENCODINGS; GENERIC TYPES; SEARCH SPACES; STATE TRANSITION FUNCTIONS; TRANSPORTATION DOMAIN;

ENCODING (SYMBOLS);

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

References (18)

1. Bacchus:F.,and Kabanza,K. 1998.Usingtemporal logictoexpress searchcontrol knowledge forphmning. Technical report..University of Waterloo, Canada, ftp://logos.uwaterloo.ca/pub/bacchus/BKTlplan.ps.
2. Blum, A., and Furst, M. 1995. Fast Planning through Pbm-graph Analysis. In LICAL
3. Fox, M., and Long, D. 1998. The automatic inference of state invariants in TIM.JAIR9.
4. Fox, M., and Long, D. 1999. The detection and exploitation of symmetryin planning problems. In Proceedings of the International Joint Conference on Artificial Intelligence.
5. Geffner, H., and Bonet, B. 1998. High level planning and control with incomplete information using POMDPs.In Proceedings of AIPS-98 workshop on Integrating Planning, Scheduling andExecution in Dynamic and Uncertain Environments.
6. Gcrevini, A., and Schubert, L. 1996. Accelerating Partial Order Planners: SomeTechniques for Effective Search Control and Pruning. JAIR 5:95-137.
7. Howe,A.; Dalflman, E.; Hansen, C.; Schcetz, M.; and von Mayrhauser, A. 1999. Exploiting competetive planner performance. In Proceedings of the Fifth European Conference on Planning, Durham,UK.
8. Kautz, H., and Selman, B. 1998. The role of domainspecific axiomsin the planningas satisfiability framework. In Proceedings of AIPS-98, Pittsburgh, PA.
9. Kelleher, G., and Cohn, A. 1992. Automatically Synthesising DomainConstraints from Operator Descriptions. In Proceedings ECAI92.
10. Koehler, J. 1998. Solving complex planning tasks through extraction of subproblems. In Proceedings of AIPS-98, Pittsburgh, PA.
11. Long, D., madFox, M. 1999. The efficient implementation of the plan-graph in SWAN. JAIR 10.
12. McCluskey, T. L., and Porteous, J. 1997. Engineering and Compiling Planning Domain Models to Promote Validity and Efficiency. Artificial Intelligence 95(1).
13. McDermott, D. 1998. PDDL- the planning domain definition language. Technical report, Yale University, http://www.cs.yale.edu/users/mcdermott.html.
14. Nau, D.; Cao.. Y.; Lotem, A.; and Mufioz-Avila, H. 1999. SHOP:Simple hierarchical orederd planner. In Proceedings of the International Joint Conference on Artificial Intelligence.
15. Nebel, B.; Dimmopoulos, Y.; and Koehler, J. 1997. Ignoring irrelevant facts and operators in plan generation. In Proceedings of ECP-97, Toulouse, Ft.
16. reserved. regression tables. In Proceedingsof the Fifth European Conference on Planning, Durham, UK.
17. Scholz, U. 1999. Action constraints for planning. In Proceedings of the Fifth EuropeanConference on Planning, Durham, UK.
18. Srivastava, B., mid Kambhampati, S. 1999. Planning though separate resource scheduling. In AAAISpring Symposium on Search Strategy under Uncertain and Incomplete Information.