The computational complexity of avoiding spurious states in state space abstraction
From MaRDI portal
Publication:622104
DOI10.1016/j.artint.2010.06.002zbMath1210.68105MaRDI QIDQ622104
Robert C. Holte, Sandra Zilles
Publication date: 31 January 2011
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2010.06.002
68Q25: Analysis of algorithms and problem complexity
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Efficient symbolic search for cost-optimal planning, A framework for analysing state-abstraction methods
Cites Work
- The expected length of a shortest path
- Using regression-match graphs to control search in planning
- Automatically generating abstractions for planning
- Downward refinement and the efficiency of hierarchical problem solving
- Planning in a hierarchy of abstraction spaces
- STRIPS: A new approach to the application of theorem proving to problem solving
- Some Recent Results in Heuristic Search Theory
- The complexity of satisfiability problems
- Planning as heuristic search
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item