Complexity Results for Blocks-World Planning
نویسندگان
چکیده
Although blocks-world planning is well-known, its complexity has not previously been analyzed, and different planning researchers have expressed connicting opinions about its diiculty. In this paper, we present the following results: 1. Finding optimal plans in a well-known formulation of the blocks-world planning domain is NP-hard, even if the goal state is completely speciied. 2. Classical examples of deleted-condition interactions such as Sussman's anomaly and creative destruction are not diicult to handle in this domain, provided that the right planning algorithm is used. Instead, the NP-hardness of the problem results from diicul-ties in determining which of several diierent actions will best help to achieve multiple goals.
منابع مشابه
Near-Optimal Plans, Tractability, and Reactivity
Many planning problems have recently been shown to be inherently intractable. For example , nding the shortest plan in the blocks-world domain is NP-hard, and so is planning in even some of the most limited STRIPS-style planning formalisms. We explore the question as to what extent these negative results can be attributed to the insistence on nding plans of minimal length. Using recent results ...
متن کاملBlocks World Tamed Ten Thousand Blocks in under a Second
Blocks World (BW) has been a standard example of a planning domain for almost thirty years, and it is still commonly used to illustrate the capabilities both of formalisms and of planners. As a minimum, therefore, we should know certain basic things about the domain. It is clear that BW planning, in the sense of nding some plan or other, is trivial, and it was shown in 1991 that nding optimal (...
متن کاملLinear Time Near-Optimal Planning in the Blocks World
This paper reports an analysis of near-optimal Blocks World planning. Various methods are clarified, and their time complexity is shown to be linear in the number of blocks, which improves their known complexity bounds. The speed of the implemented programs (ten thousand blocks are handled in a second) enables us to make empirical observations on large problems. These suggest that the above met...
متن کاملThe Computational Complexity of Propositional STRIPS Planning
I present several computational complexity results for propositional STRIPS planning, i.e., STRIPS planning restricted to ground formulas. Diierent planning problems can be deened by restricting the type of formulas, placing limits on the number of pre-and postconditions, by restricting negation in pre-and postconditions, and by requiring optimal plans. For these types of restrictions, I show w...
متن کاملOn the NP-Hardness of Blocks World
Blocks world (cube world) has been one of the most popular model domains in artificial intelligence search and planning. The operation and effectiveness of alternative heuristic strategies, both basic and complex, can be observed easily in this domain. We show that finding an optimal solution is NP-hard in an important variant of the domain, and po cr ular extensions. This enlarges the range of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991