A framework for analysing state-abstraction methods
From MaRDI portal
Publication:2060741
DOI10.1016/j.artint.2021.103608zbMath1486.68175OpenAlexW3207048625MaRDI QIDQ2060741
Peter Jonsson, Christer Bäckström
Publication date: 13 December 2021
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2021.103608
refinementheuristic searchcombinatorial searchaction planningstate abstractionhierarchical abstraction
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The computational complexity of avoiding spurious states in state space abstraction
- Inconsistent heuristics in theory and practice
- A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm
- Weighted \(A^*\) search - unifying view and application
- Macro-operators: A weak method for learning
- A method for computing heuristics in problem solving
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
- A theory of abstraction
- Automatically generating abstractions for planning
- The computational complexity of propositional STRIPS planning
- Downward refinement and the efficiency of hierarchical problem solving
- Calculating criticalities
- Planning in a hierarchy of abstraction spaces
- Red-black planning: a new systematic approach to partial delete relaxation
- A complete parameterized complexity analysis of bounded planning
- Towards a practical theory of reformulation for reasoning about physical systems
- The complexity of searching implicit graphs
- The Complexity of Optimal Monotonic Planning: The Bad, The Good, and The Causal Graph
- Merge-and-Shrink Abstraction
- Succinct representations of graphs
- Linear-time disk-based implicit graph search
- Counterexample-guided abstraction refinement for symbolic model checking
- Path Problems in Structured Graphs
- Generalized best-first search strategies and the optimality of A*
- Abstract interpretation
- Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings
