scientific article; zbMATH DE number 2243373
From MaRDI portal
zbMath1080.68662arXiv1107.0050MaRDI QIDQ5715685
Sarit Hanan, Ariel Felner, Richard E. Korf
Publication date: 4 January 2006
Full work available at URL: https://arxiv.org/abs/1107.0050
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Symbolic perimeter abstraction heuristics for cost-optimal planning, Merge-and-Shrink Abstraction, Duality in permutation state spaces and the dual search algorithm, An exact algorithm for the blocks relocation problem with new lower bounds, Optimal Sokoban solving using pattern databases with specific domain knowledge, Inconsistent heuristics in theory and practice, Maximizing over multiple pattern databases speeds up heuristic search, The compressed differential heuristic, Star-topology decoupled state space search, Predicting optimal solution cost with conditional probabilities, Landmark-enhanced abstraction heuristics, Fixed-parameter tractability results for feedback set problems in tournaments, Potential-based bounded-cost search and anytime non-parametric A*, Finding optimal solutions to the graph partitioning problem with heuristic search, Optimal admissible composition of abstraction heuristics, Heuristics as Markov chains, Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning