GRT: A domain independent heuristic for STRIPS worlds based on greedy regression tables

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1809, Issue , 2000, Pages 347-359

  Refanidis, Ioannis ^a   Vlahavas, Ioannis ^a  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTERS;

BEST FIRST SEARCH; DOMAIN INDEPENDENTS; INTERMEDIATE STATE; PLANNING COMPETITIONS; PROBLEM INSTANCES; PROBLEM SOLVING PROCESS; SEARCH PROCESS; STATE SPACE PLANNERS;

PROBLEM SOLVING;

EID: 84943252442     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/10720246_27     Document Type: Conference Paper

References (13)

1. Barett A., Weld D.S.: Partial order planning: Evaluating possible efficiency gains.J.Artificial Intelligence, 67 (1994) 71-112
2. Blum A.L., Furst M.L.: Fast planning through planning graph analysis.14th International Joint Conference on Artificial Intelligence (IJCAI-95), Montreal, Canada (1995) 636-1642
3. Bonet B., Loerincs G., Geffner H.: A robust and fast action selection mechanism for planning.14th International Conference of the American Association of Artificial Intelligence (AAAI-97), Providence, Rhode Island (1997) 714-719
4. Bonet B., Geffner H.: HSP: Heuristic Search Planner.Entry at the Artificial Intelligence Planning Systems (AIPS-98) Planning Competition, Pittsburgh (1998).
5. Fikes R.E., Nilsson N.J.: Strips: A new approach to the application of theorem proving to problem solving.Artificial Intelligence, 2 (1971) 189-208
6. Gupta N., Nau D.S.: On the complexity of blocks world planning.Artificial Intelligence, 56(2-3) (1992) 223-254
7. Hart P.E., Nilsson N.J., Raphael B.: A formal basis for the heuristic determination of minimum cost paths.IEEE Trans.on Systems Science and Cybernetics, 4(2) (1968) 100-107
8. Kautz H., Selman B.: Pushing the envelope: Planning, propositional logic and stochastic search.13th International Conference of the American Association of Artificial Intelligence (AAAI-96), Portland, Oregon (1996) 1194-1201
9. Kautz H., Selman B.: BLACKBOX: A New Approach to the Application of Theorem Proving to Problem Solving.Working notes of the Workshop on Planning as Combinatorial Search, held in conjunction with Artificial Intelligence Planning Systems (AIPS-98), Pittsburgh (1998)
10. Minton S., Bresina J., Drummond M.: Total-order and partial-order planning: A comparative analysis.J.of Artificial Intelligence Research, 2, (1994) 227-261
11. Pearl J., Heuristics, Intelligent Strategies For Computer Problem Ma solving., (1984) A.
12. Slaney J., Thiebaux S.: Linear-time near-optimal planning in the blocks world.13th International Conference of the American Association of Artificial Intelligence (AAAI-96), Portland, Oregon (1996)
13. Veloso M.: Learning by Analogical Reasoning in General Problem Solving.PhD Dissertation, Computer Science Dept., CMU Tech.Report, CMU-CS-92-174 (1992)