Blocks World revisited

DOI10.1016/S0004-3702(00)00079-5zbMath0969.68136MaRDI QIDQ5940781

Sylvie Thiébaux, John K. Slaney

Publication date: 20 August 2001

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

zbMATH Keywords

approximation algorithms; blocks world; planning benchmarks; random/hard problems

Mathematics Subject Classification ID

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

Related Items

Relational Sequence Learning, Blocks World revisited, History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence, Learning heuristic functions for large state spaces, Planning in multi-agent environment using strips representation and non-cooperative equilibrium strategy, Complexity results for standard benchmark domains in planning, Predicting optimal solution costs with bidirectional stratified sampling in regular search spaces, Generalized ordering-search for learning directed probabilistic logical models, An exact algorithm for the unrestricted block relocation problem, Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm, Set-structured and cost-sharing heuristics for classical planning, Conformant planning via heuristic forward search: A new approach, In defense of PDDL axioms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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