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