A framework for analysing state-abstraction methods
type: Item
instance of: scholarly article
title: A framework for analysing state-abstraction methods
zbMATH Open document ID: 1486.68175
author: Peter Jonsson
author: Christer Bäckström
published in: Artificial Intelligence
publication date: 2021-12-13T00:00:00Z
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 7443178
zbMATH Keywords: action planning
zbMATH Keywords: combinatorial search
zbMATH Keywords: heuristic search
zbMATH Keywords: hierarchical abstraction
zbMATH Keywords: refinement
zbMATH Keywords: state abstraction
MaRDI profile type: Publication
full work available at URL: j.artint.2021.103608
OpenAlex ID: W3207048625
cites work: Path Problems in Structured Graphs
cites work: Downward refinement and the efficiency of hierarchical problem solving
cites work: A complete parameterized complexity analysis of bounded planning
cites work: The complexity of searching implicit graphs
cites work: Q5715724
cites work: Calculating criticalities
cites work: The computational complexity of propositional STRIPS planning
cites work: Towards a practical theory of reformulation for reasoning about physical systems
cites work: Counterexample-guided abstraction refinement for symbolic model checking
cites work: Abstract interpretation
cites work: Generalized best-first search strategies and the optimality of A*
cites work: Red-black planning: a new systematic approach to partial delete relaxation
cites work: Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings
cites work: The complexity of optimal monotonic planning: the bad, the good, and the causal graph
cites work: Weighted \(A^*\) search - unifying view and application
cites work: Q3092752
cites work: Inconsistent heuristics in theory and practice
cites work: Succinct representations of graphs
cites work: A theory of abstraction
cites work: A method for computing heuristics in problem solving
cites work: Merge-and-Shrink Abstraction
cites work: Q5715727
cites work: Q5283006
cites work: Q5715683
cites work: Q4028091
cites work: Automatically generating abstractions for planning
cites work: Macro-operators: A weak method for learning
cites work: Linear-time disk-based implicit graph search
cites work: The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problems
cites work: Q3849246
cites work: Planning in a hierarchy of abstraction spaces
cites work: Q4999292
cites work: Q4580275
cites work: A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm
cites work: Q3624143
cites work: The computational complexity of avoiding spurious states in state space abstraction
DOI: 10.1016/J.ARTINT.2021.103608
description: scientific article; zbMATH DE number 7443178