Generalizing the relaxed planning heuristic to non-linear tasks

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

Volumn 3238 LNAI, Issue , 2004, Pages 198-212

  Edelkamp, Stefan ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; HEURISTIC ALGORITHMS;

ARITHMETIC EXPRESSION; DOMAIN DESCRIPTION; DOMAIN INDEPENDENTS; HEURISTIC SEARCH; PLANNING PROBLEM; STATE OF THE ART; VARIABLE ASSIGNMENT; WEAKEST PRECONDITION;

ARTIFICIAL INTELLIGENCE;

EID: 77049125577     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30221-6_16     Document Type: Conference Paper

References (28)

1. B. B́erard, A. F. M. Bidoit, F. Laroussine, A. Petit, L. Petrucci, P. Schoenebelen, and P. McKenzie. Systems and Software Verification. Springer, 2001.
2. B. Bonet and H. Geffner. Planning as heuristic search. Artificial Intelligence, 129(1-2):5-33, 2001.
3. R. Brafman and J. Hoffmann. Conformant planning via heuristic forward search: A new approach. In International Conference on Automated Planning and Scheduling (ICAPS), 2004. 335-364.
4. R. E. Bryant. Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):142-170, 1992.
5. T. Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, pages 165-204, 1994.
6. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999.
7. S. Edelkamp. Planning with pattern databases. In European Conference on Planning (ECP), 2001. 13-24.
8. S. Edelkamp. Promela planning. In Workshop on Model Checking Software (SPIN), pages 197-212, 2003.
9. S. Edelkamp. Taming numbers and durations in the model checking integrated planning system. Journal of Artificial Research (JAIR), 20:195-238, 2003.
10. S. Edelkamp. Extended critical paths in temporal planning. In Proceedings ICAPS-Workshop on Integrating Planning Into Scheduling, pages 38-45, 2004.
11. S. Edelkamp and J. Hoffmann. PDDL2.2: The language for the classical part of the 4th international planning competition. Technical report, University of Freiburg, 2003.
12. S. Edelkamp, J. Hoffmann, M. Littman, and H. Younes. Proceedings Fourth International Planning Competition, International Conference on Automated Planning and Scheduling. Jet Propulsion Laboratory, 2004.
13. S. Edelkamp, S. Leue, and A. Lluch-Lafuente. Directed explicit-state model checking in the validation of communication protocols. International Journal on Software Tools for Technology (STTT), 2004.
14. R. Fikes and N. Nilsson. Strips: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2:189-208, 1971.
15. M. Fox and D. Long. PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Research (JAIR), 20:61-124, 2003.
16. B. C. Gazen and C. Knoblock. Combining the expessiveness of UCPOP with the efficiency of graphplan. In European Conference on Planning (ECP), pages 221-233, 1997.
17. P. Haslum and H. Geffner. Admissible heuristics for optimal planning. In Artificial Intelligence Planning and Scheduling (AIPS), pages 140-149, 2000.
18. J. Hoffmann. Local search topology in planning benchmarks: An empirical analysis. In International Joint Conferences on Artificial Intelligence (IJCAI), pages 453-458, 2001.
19. J. Hoffmann. Local search topology in planning benchmarks: A theoretical analysis. In Artificial Intelligence Planning and Scheduling (AIPS), pages 379-387, 2002.
20. J. Hoffmann. The Metric FF planning system: Translating "Ignoring the delete list" to numerical state variables. Journal of Artificial Intelligence Research, 20:291-341, 2003.
21. J. Hoffmann, S. Edelkamp, R. Englert, F. Liporace, and S. Thiebaux. Towards realistic benchmarks for planning: the domains used in the classical part of IPC-4. In Proceedings Fourth International Planning Competition, pages 8-15, 2004.
22. J. Hoffmann and B. Nebel. Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14:253-302, 2001.
23. K. L. McMillan. Symbolic model checking. In M. K. Inan and R. P. Kurshan, editors, Verification of Digital and Hybrid Systems, pages 117-137. Springer, 1998.
24. K. Meriott and P. Stuckey. Programming with Constraints. MIT Press, 1998.
25. J. Pearl. Heuristics. Addison-Wesley, 1985.
26. J. Sanches, M. Tang, and A. D. Mali. P-MEP: Parallel more expressive planner. In Proceedings Fourth International Planning Competition, pages 53-55, 2004.
27. J. Sanchez and A. D. Mali. S-MEP: A planner for numeric goals. In Proceedings IEEE International Conference Tools with Artificial Intelligence (ICTAI), pages 274-283, 2003.
28. R. van der Krogt, M. de Weerdt, and C. Witteveen. Exploiting opportunities using planning graphs. In UK Planning and Scheduling SIG (PlanSig), pages 125-136, 2003.