Using regression-match graphs to control search in planning
From MaRDI portal
Publication:1292308
DOI10.1016/S0004-3702(99)00010-7zbMath0916.68145OpenAlexW2064591764WikidataQ127797918 ScholiaQ127797918MaRDI QIDQ1292308
Publication date: 21 June 1999
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(99)00010-7
Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (14)
Learning from planner performance ⋮ Heuristics for planning with penalties and rewards formulated in logic and computed through circuits ⋮ The computational complexity of avoiding spurious states in state space abstraction ⋮ On the completeness of pruning techniques for planning with conditional effects ⋮ Planning with Incomplete Information ⋮ Star-topology decoupled state space search ⋮ State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning ⋮ Planning as heuristic search ⋮ Set-structured and cost-sharing heuristics for classical planning ⋮ Planning and control in artificial intelligence: A unifying perspective ⋮ Directed Unfolding of Petri Nets ⋮ Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search ⋮ Red-black planning: a new systematic approach to partial delete relaxation ⋮ Multiobjective heuristic state-space planning
Uses Software
This page was built for publication: Using regression-match graphs to control search in planning
