Blocks World revisited
From MaRDI portal
Publication:5940781
DOI10.1016/S0004-3702(00)00079-5zbMath0969.68136OpenAlexW2070183171MaRDI QIDQ5940781
Sylvie Thiébaux, John K. Slaney
Publication date: 20 August 2001
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(00)00079-5
Related Items (17)
An exact algorithm for the unrestricted block relocation problem ⋮ History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence ⋮ A Comprehensive Framework for Learning Declarative Action Models ⋮ Planning in multi-agent environment using strips representation and non-cooperative equilibrium strategy ⋮ A branch and bound approach for large pre-marshalling problems ⋮ Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm ⋮ Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces ⋮ Learning heuristic functions for large state spaces ⋮ Conformant planning via heuristic forward search: A new approach ⋮ In defense of PDDL axioms ⋮ Blocks World revisited ⋮ Set-structured and cost-sharing heuristics for classical planning ⋮ Relational Sequence Learning ⋮ Generalized ordering-search for learning directed probabilistic logical models ⋮ Learning action models with minimal observability ⋮ Lifted model checking for relational MDPs ⋮ Complexity results for standard benchmark domains in planning
Cites Work
- On the complexity of blocks-world planning
- The computational complexity of propositional STRIPS planning
- TALplanner: A temporal logic based forward chaining planner
- Using temporal logics to express search control knowledge for planning
- Blocks World revisited
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Blocks World revisited
