Pages that link to "Item:Q1332851"

The following pages link to Automatically generating abstractions for planning (Q1332851):

Displaying 31 items.

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