Admissible Heuristics for Optimal Planning

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

Volumn , Issue , 2000, Pages 140-149

  Haslum, Patrik ^a   Geffner, Héctor ^b  

^a LINKÖPING UNIVERSITY   (Sweden)

^b UNIVERSIDAD SIMÓN BOLÍVAR   (Venezuela)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; GRAPH THEORY; OPTIMIZATION;

ENCODINGS; GRAPHPLAN; HEURISTIC FUNCTIONS; INITIAL STATE; OPTIMAL PLANNING; PERFORMANCE; RE-COMPUTING; REGRESSION SEARCH; SHORTEST PATH PROBLEM; STATE-SPACE;

HEURISTIC ALGORITHMS;

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

References (23)

1. Ahuja, R.; Magnanti, T.; and Orlin, J. 1993. Network Flows. Prentice-Hall.
2. Bertsekas, D. 1995. Dynamic Programming and Optimal Control, Vols 1 and 2. Athena Scientific.
3. Blum, A., and Furst, M. 1995. Fast planning through planning graph analysis. In Proceedings of IJCAI-95.
4. Bonet, B., and Geffner, H. 1999. Planning as heuristic search: New results. In Proceedings of ECP-99. Springer.
5. Bonet, B.; Loerines, G.; and Geffner, H. 1997. A robust and fast action selection mechanism for planning. In Proceedings of AAAI-97. 714-719. MIT Press.
6. Culberson, J., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(3):319-333.
7. Fox. M.. and Long. D. 1999. The detection and exploitation of symmetry in planning domains. In Proc. IJCAI-99.
8. Garey. M.. and Johnson, D. 1979. Computers and Intractability. Freeman.
9. Kautz. H., and Selinan. B. 1999. Unifying SAT-based and Graph-based planning. In Proceedings IJCAI-99.
10. Korf, R. 1985. Depth-first iterative-deepening: an optimal admissible tree search. Artificial Intelligence 27(1):97-109.
11. Korf. R. 1993. Linear-space best-first search. Artificial Intelligence 62:41 78.
12. Korf, R. 1998. Finding optimal solutions to Rubik's cube using pattern databases. In Proceedings of AAAI-98. 1202-1207.
13. Lawler, E., and Rinnooy-Kan, A., eds. 1985. The Traveling Salesman Problem : A Guided Tour of Combinatorial Optimization. Wiley.
14. Long, D., and Fox, M. 1999. The efficient implementation of the plan-graph. J AIR 10:85-115.
15. McDcrmott. D. 1996. A heuristic estimator for means-ends analysis in planning. In Proc. Third Int. Conf. on AI Planning Systems (AIPS-96).
16. McDermott, D. 1998. AIPS-98 Planning Competition Results, http ://ftp.cs.yale.edu/pub/mcdermott/aipscomp-results.html.
17. Nilsson, N. 1980. Principles of Artificial Intelligence. Tioga.
18. Pearl. J. 1983. Heuristics. Morgan Kaufmann.
19. Refanidis, I ., and Vlahavas, I. 1999. C R T: A domain independent, heuristic for Strips worlds based on greedy regression tallies. In Proceedings of ECP-99. Springer.
20. Reinfeld. A., and Marsland. T. 1994. Enhanced iterative-deepening search. IEEE Trans. on Pattern Analysis and Machine Intelligence 16(7):701 710.
21. Riutanen. J. 1998. A planning algorithm not, based on directional search. In Proceedings KR'98, 617 624. Morgan Kaufmann.
22. Sen. A., and Bagchi. A. 1989. Fast recursive formulations for B F S that, allow controlled used of memory. In Proc. IJCAI-89, 297 302.
23. Smith. D.. and Wehl. D. 1999. Temporal planning with mutual exclusion reasoning. In Proc. IJC'AI-99.