On the Complexity of Blocks-World Planning
| dc.contributor.author | Gupta, Naresh | en_US |
| dc.contributor.author | Nau, Dana S. | en_US |
| dc.contributor.department | ISR | en_US |
| dc.date.accessioned | 2007-05-23T09:48:29Z | |
| dc.date.available | 2007-05-23T09:48:29Z | |
| dc.date.issued | 1991 | en_US |
| dc.description.abstract | In this paper, we show that blocks-world planning is difficult, in the sense that finding an optimal plan is NP-hard. This is true regardless of whether or not, the goal state is completely specified, and regardless of whether or not different blocks have different sizes. However, the difficulty of blocks-world planning is not due to deleted-condition interactions, but instead due to another kind of goal interaction, which we call a deadlock. For problems that do not contain deadlocks, there is a simple hill- climbing strategy that can easily find an optimal plan, regardless of whether or not the problem contains any deleted- condition interactions.<P>The fact that deleted-condition interactions are easy and deadlocks are difficult is rather surprising, for one of the primary roles of the blocks world in the planning literature has been to provide examples of deleted- condition interactions such as creative destruction and Sussman's anomaly. This suggests that a good topic for future research might be to investigate how easily such interactions can be handled in other planning domains. | en_US |
| dc.format.extent | 1368464 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1903/5122 | |
| dc.language.iso | en_US | en_US |
| dc.relation.ispartofseries | ISR; TR 1991-74 | en_US |
| dc.subject | algorithms | en_US |
| dc.subject | computational complexity | en_US |
| dc.subject | Systems Integration | en_US |
| dc.title | On the Complexity of Blocks-World Planning | en_US |
| dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1