Automatically generating abstractions for planning

DOI10.1016/0004-3702(94)90069-8zbMath0942.68712MaRDI QIDQ1332851

Craig A. Knoblock

Publication date: 14 August 2000

Published in: Artificial Intelligence (Search for Journal in Brave)

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (32)

Partial-order planning: Evaluating possible efficiency gains ⋮ Downward refinement and the efficiency of hierarchical problem solving ⋮ Symbolic perimeter abstraction heuristics for cost-optimal planning ⋮ Formally verified algorithms for upper-bounding state space diameters ⋮ Integrating planning and learning: the PRODIGY architecture ⋮ Learning metric-topological maps for indoor mobile robot navigation ⋮ Engineering and compiling planning domain models to promote validity and efficiency ⋮ Calculating criticalities ⋮ Reward-respecting subtasks for model-based reinforcement learning ⋮ The computational complexity of avoiding spurious states in state space abstraction ⋮ Abstraction and approximate decision-theoretic planning. ⋮ Automatically selecting and using primary effects in planning: Theory and experiments. ⋮ The influence of \(k\)-dependence on the complexity of planning ⋮ On the complexity of planning for agent teams and its implications for single agent planning ⋮ A Verified Compositional Algorithm for AI Planning ⋮ Limitations of acyclic causal graphs for planning ⋮ Proving theorems by reuse ⋮ Using temporal logics to express search control knowledge for planning ⋮ A new result on the complexity of heuristic estimates for the \(A^*\) algorithm ⋮ Star-topology decoupled state space search ⋮ Acquiring search-control knowledge via static analysis ⋮ Causal graphs and structurally restricted planning ⋮ Interactive in-vehicle guidance through a multihierarchical representation of urban maps ⋮ Omission-Based Abstraction for Answer Set Programs ⋮ Abstraction for non-ground answer set programs ⋮ A framework for analysing state-abstraction methods ⋮ Backdoors to planning ⋮ Computational Complexity of Computing Symmetries in Finite-Domain Planning ⋮ Optimal scheduling of progressive processing tasks ⋮ Red-black planning: a new systematic approach to partial delete relaxation ⋮ Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in RealPlan ⋮ A study of a dynamic progressive reasoning system

Cites Work

• Macro-operators: A weak method for learning
• On the satisfiability of circumscription
• Theorem proving with abstraction
• Embedding decision-analytic control in a learning architecture
• A theory of abstraction
• Planning in a hierarchy of abstraction spaces
• STRIPS: A new approach to the application of theorem proving to problem solving
• Mechanical Discovery of Classes of Problem-Solving Strategies
• Sufficient Conditions for the Success of GPS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Automatically generating abstractions for planning