On the complexity of blocks-world planning
From MaRDI portal
Publication:1199914
DOI10.1016/0004-3702(92)90028-VzbMath0785.68046OpenAlexW2054497239WikidataQ29030659 ScholiaQ29030659MaRDI QIDQ1199914
Publication date: 17 January 1993
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(92)90028-v
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
A multi-heuristic approach for solving the pre-marshalling problem, Loading, unloading and premarshalling of stacks in storage areas: survey and classification, Container relocation problem with time windows for container departure, An exact algorithm for the unrestricted block relocation problem, History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence, On the abstraction method for the container relocation problem, A biased random-key genetic algorithm for the container pre-marshalling problem, Model-lite planning: case-based vs. model-based approaches, On the nature and role of modal truth criteria in planning, MULTI-AGENT COOPERATION VIA REASONING ABOUT THE BEHAVIOR OF OTHERS, Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol, Solving real-world sized container pre-marshalling problems with an iterative deepening branch-and-bound algorithm, Hybrid planning for challenging construction problems: an answer set programming approach, A mathematical formulation and complexity considerations for the blocks relocation problem, Using temporal logics to express search control knowledge for planning, Blocks World revisited, On SAT instance classes and a method for reliable performance experiments with SAT solvers, On distinguishing sets of structures by first-order sentences of minimal quantifier rank, Complexity, decidability and undecidability results for domain-independent planning, A complete parameterized complexity analysis of bounded planning, On the computational complexity of temporal projection, planning, and plan validation, Complexity results for standard benchmark domains in planning, A new mixed integer program and extended look-ahead heuristic algorithm for the block relocation problem
Cites Work
