Ignoring irrelevant facts and operators in plan generation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1348 LNAI, Issue , 1997, Pages 338-350

  Nebel, Bernhard ^a   Dimopoulos, Yannis ^a   Koehler, Jana ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EFFICIENT PLANNING; GRAPHPLAN; MINIMIZING THE NUMBER OF; PLAN GENERATION; PLANNING GRAPHS; PLANNING PROCESS; PLANNING TASKS;

INFORMATION FILTERING;

EID: 84880674989     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63912-8_97     Document Type: Conference Paper

References (11)

1. C. Backstrom. Equivalence and tractability results for SAS+ planning. In B. Nebel, W. Swartout, and C. Rich, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the 3rd International Conference (KR-92), pages 126-137, Cambridge, MA, Oct. 1992. Morgan Kaufmann.
2. A. L. Blum and M. L. Furst. Fast planning through planning graph analysis. Artificial Intelligence, 90(l-2):279-298, 1997.
3. T. Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(l-2):165-204, 1994.
4. T. A. Estlin and R. J. Mooney. Multi-strategy learning of search control for partial order planning. In Proceedings of the 13th National Conference of the American Association for Artificial Intelligence (AAAI-96), Portland, OR, July 1996. MIT Press.
5. R. E. Fikes and N. Nilsson. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2:189-208, 1971.
6. A. Gerevini and L. Schubert. Accelerating partial-order planners: Some techniques for effective search control and pruning. Journal of Artificial Intelligence Research, 5:95-137, 1996.
7. H. A. Kautz and B. Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proceedings of the 13th National Conference of the Amer'ican Association for Artificial Intelligence (AAAI-96), pages 1194-1201, Portland, OR, July 1996. MIT Press.
8. J. Koehler, B. Nebel, J, Hoffmann, and Y. Dimopoulos. Extending planning graphs to an ADL subset. In Proc. European Conference on Planning 1997, Toulouse, France, September 1997.
9. D. McDermott. A heuristic estimator for means-ends analysis in planning. In Proceedings of the 3rd International Conference on Artificial Intelligence Planning Systems (AIPS-96), pages 142-149. AAAI Press, Menlo Park, 1996.
10. D. McDermott. Using regression-match graphs to control search in planning. Manuscript submitted for publication, 1997.
11. J. S. Penberthy and D. S. Weld. UCPOP: A sound, complete, partial order planner for ADL. In B. Nebel, W. Swartout, and C. Rich, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the 3rd International Conference (KR-92), pages 103-114, Cambridge, MA, Oct. 1992. Morgan Kaufmann.