The following pages link to Blocks World revisited (Q5940781):
Displaying 18 items.
- History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence (Q342093) (← links)
- Learning heuristic functions for large state spaces (Q420796) (← links)
- Planning in multi-agent environment using strips representation and non-cooperative equilibrium strategy (Q614839) (← links)
- Complexity results for standard benchmark domains in planning (Q814425) (← links)
- Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces (Q901034) (← links)
- Generalized ordering-search for learning directed probabilistic logical models (Q1009243) (← links)
- An exact algorithm for the unrestricted block relocation problem (Q1652624) (← links)
- Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm (Q1694329) (← links)
- Lifted model checking for relational MDPs (Q2102421) (← links)
- Set-structured and cost-sharing heuristics for classical planning (Q2268919) (← links)
- Learning action models with minimal observability (Q2321324) (← links)
- A branch and bound approach for large pre-marshalling problems (Q2424778) (← links)
- Conformant planning via heuristic forward search: A new approach (Q2457623) (← links)
- In defense of PDDL axioms (Q2457650) (← links)
- A Comprehensive Framework for Learning Declarative Action Models (Q5094057) (← links)
- Relational Sequence Learning (Q5452021) (← links)
- Blocks World revisited (Q5940781) (← links)
- Generalized planning as heuristic search: a new planning search-space that leverages pointers over objects (Q6566615) (← links)
