On the Complexity of Blocks-World Planning

@article{Gupta1992OnTC,
  title={On the Complexity of Blocks-World Planning},
  author={Naresh Gupta and Dana S. Nau},
  journal={Artif. Intell.},
  year={1992},
  volume={56},
  pages={223-254}
}
Gupta, N and D S Nau, On the complexity of blocks-world planmng, Artificial Intelligence 56 (1992) 223-254 In this paper, we show that m the best-known version of the blocks world (and several related versions), planning is difficult, in the sense that finding an optimal plan ~s NP-hard However, the NP-hardness is not due to deleted-condmon interactions, but instead due to a situation which we call a deadlock For problems that do not contain deadlocks, there is a simple hdl-chmbmg strategy that… CONTINUE READING
Highly Influential
This paper has highly influenced 16 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 192 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

193 Citations

051015'92'97'03'09'15
Citations per Year
Semantic Scholar estimates that this publication has 193 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Introduction to tttlti~tal Intelhgence t Addlson-~esle~

  • E Charmak, D McDermott
  • Reading MA,
  • 1985
Highly Influential
3 Excerpts

Subrahmanlan On the complexlt) of domain-independent planning, in Proceedmgs

  • V S K Erol D S Nau
  • 1992
1 Excerpt

Subrahmanlan Complexlt) decidablht\ and undecldablht~ results for domain-independent planning, SRC TR

  • V S K Erol D S Nau
  • 1991
1 Excerpt

Ripest Inttodt.tton to l&ottthm~ I MI'I Press/McGraw-Hill

  • T H Cormen, R L C E Lmserson
  • 1990
1 Excerpt

Fhe De~tw and tnahs> ol (,~mput~t tlgorlthms (Addison-Wesley

  • A'v Aho J E Hopcrofl, J D Ullman
  • 1976

Similar Papers

Loading similar papers…