A heuristic for planning based on action evaluation

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

Volumn 2443 LNAI, Issue , 2002, Pages 61-70

  Vrakas, Dimitris ^a   Vlahavas, Ioannis ^a  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

DOMAIN ANALYSIS; DOMAIN INDEPENDENTS; INITIAL PROBLEM; PLANNING PROBLEM;

ARTIFICIAL INTELLIGENCE;

EID: 84877975426     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46148-5_7     Document Type: Conference Paper

References (15)

1. Blum, L., and Furst M., Fast planning through planning graph analysis, In Proceedings of the 14th Int. Joint Conference on Artificial Intelligence, 636-642. Montreal, Canada. (1995)
2. Bonet, B. and Geffner, H. Planning as Heuristic Search: New Results, In Proceedings of the 5th European Conference on Artificial Intelligence. Durham UK. (1999)
3. Bonet, B., Loerincs, G., and Geffner, H., A robust and fast action selection mechanism for planning, In Proceedings of the 14th Int. Conference of the American Association of Artificial Intelligence (AAAI-97), 714-719. Providence, Rhode Island. (1997)
4. Fox, M. and Long, D., Hybrid STAN: Identifying and Managing Combinatorial Subproblems in Planning. In Proceedings of 19th UK Planning and Scheduling SIG Workshop, (2000)
5. Hoffmann, J. A Heuristic for Domain Independent Planning and its Use in an Enforced Hill-climbing Algorithm, In Proceedings of the 12th Int. Symposium on Methodologies for intelligent Systems. (2000)
6. Kautz, H. and Selman, B., Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search. In Proceedings of the Thirteen National Conference on Artificial Intelligence (AAAI-96). Portland, Oregon, USA. (1996)
7. Koehler, J. and Hoffmann, J. On Reasonable and Forced Goal Orderings and their Use in an Agenda-Driven Planning Algorithm, Journal of Artiicial Intelligence Research 12. (2000)
8. Korf, R. Artificial intelligence search algorithms, CRC Handbook of Algorithms and Theory of Computation, Atallah, M. J. (Ed.), CRC Press, Boca Raton, FL, pp. 36-1 to 36-20. (1998)
9. Long, D. and Fox, M. Efficient Implementation of the Plan Graph in STAN, JAIR, 10, pp. 87-115.(1998)
10. McDermott, D. A Heuristic Estimator for Means-End Analysis in Planning, In Proceedings, AIPS (1996)
11. Nguyen, X., Kambhampati, S. and Nigenda, R. AltAlt: Combining the advantages of Graphplan and Heuristics State Search, In Proceedings, International Conference on Knowledge-based Computer Systems, Bombay, India. (2000)
12. Refanidis, I., and Vlahavas, I., GRT: A Domain Independent Heuristic for STRIPS Worlds based on Greedy Regression Tables, In Proceedings, 5th European Conference on Planning, Durham, UK, pp. 346-358. (1999)
13. Refanidis, I. and Vlahavas, I., The GRT Planner: Backward Heuristic Construction in Forward State-Space Planning, Journal of Artificial Intelligence Research 15:115-161. (2000)
14. Selman, B., Levesque, H. and Mitchell, D., A New Method for solving Hard Stisfiability Problems. In Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), 440-446. San Jose, California, USA. (1992)
15. Vrakas, D. and Vlahavas, I. Combining Progression and Regression in State-Space Heuristic Planning, In Pre-Proceedings of the 6th European Conference on Planning, 1-12. Toledo, Spain. (2001)