Improving heuristics through relaxed search

The hm admissible heuristics for (sequential and temporal) regression planning are defined by a parameterized relaxation of the optimal cost function in the regression search space, where the param...

[1]  Stefan Edelkamp,et al.  Towards Realistic Benchmarks for Planning: the Domains Used in the Classical Part of IPC-4 , 2004 .

[2]  John Gaschnig,et al.  A Problem Similarity Approach to Devising Heuristics: First Results , 1979, IJCAI.

[3]  S. Edelkamp,et al.  The Deterministic Part of IPC-4: An Overview , 2005, J. Artif. Intell. Res..

[4]  Nils J. Nilsson,et al.  Searching problem-solving and game-playing trees for minimal cost solutions , 1968, IFIP Congress.

[5]  Richard E. Korf,et al.  Additive Pattern Database Heuristics , 2004, J. Artif. Intell. Res..

[6]  Jonathan Schaeffer,et al.  Searching with Pattern Databases , 1996, Canadian Conference on AI.

[7]  Maria Fox,et al.  PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..

[8]  Tristan Cazenave.  Iterative Widening , 2001, IJCAI.

[9]  R. Bellman.  Dynamic programming. , 1957, Science.

[10]  Alfred V. Aho,et al.  Data Structures and Algorithms , 1983 .

[11]  Derek Long,et al.  A Temporal Planning System for Durative Actions of PDDL2.1 , 2002, ECAI.

[12]  Patrik Haslum,et al.  Admissible Heuristics for Optimal Planning , 2000, AIPS.

[13]  Jonathan Schaeffer,et al.  Sokoban: Enhancing general single-agent search methods using domain knowledge , 2001, Artif. Intell..

[14]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

[15]  Alberto Martelli,et al.  Additive AND/OR Graphs , 1973, IJCAI.

[16]  Hector Geffner,et al.  Heuristic Planning with Time and Resources , 2014 .

[17]  Matthew L. Ginsberg,et al.  Iterative Broadening , 1990, Artif. Intell..

[18]  Robert C. Holte,et al.  Experiments with Automatically Created Memory-Based Heuristics , 2000, SARA.

[19]  Alexander Reinefeld,et al.  Enhanced Iterative-Deepening Search , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[20]  Thomas Schiex,et al.  Russian Doll Search for Solving Constraint Optimization Problems , 1996, AAAI/IAAI, Vol. 1.

[21]  Maria Fox,et al.  Exploiting a Graphplan Framework in Temporal Planning , 2003, ICAPS.

[22]  Patrik Haslum.  Improving Heuristics Through Search , 2004, ECAI.

[23]  Blai Bonet,et al.  An Algorithm Better than AO*? , 2005, AAAI.

[24]  Hector Geffner,et al.  Branching and pruning: An optimal temporal POCL planner based on constraint programming , 2004, Artif. Intell..

[25]  David Furcy,et al.  Speeding up the calculation of heuristics for heuristic search-based planning , 2002, AAAI/IAAI.

[26]  Patrik Haslum,et al.  New Admissible Heuristics for Domain-Independent Planning , 2005, AAAI.

[27]  David E. Smith,et al.  Temporal Planning with Mutual Exclusion Reasoning , 1999, IJCAI.

[28]  Marco Valtorta,et al.  A Result on the Computational Complexity of Heuristic Estimates for the A* Algorithm , 1983, IJCAI.

[29]  David E. Smith.  Choosing Objectives in Over-Subscription Planning , 2004, ICAPS.