On the complexity of blocks-world planning
Artificial Intelligence
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
Pellet: A practical OWL-DL reasoner
Web Semantics: Science, Services and Agents on the World Wide Web
FaCT++ description logic reasoner: system description
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
| Hi-index | 0.00 |
Keeping planning problems as small as possible is a must in order to cope with complex tasks and environments. Earlier, we have described a method for cascading Description Logic (DL) representation and reasoning on the one hand, and Hierarchical Task Network (HTN) action planning on the other. The planning domain description as well as the fundamental HTN planning concepts are represented in DL and can therefore be subject to DL reasoning. From these representations, concise planning problems are generated for HTN planners. We show by way of case study that this method yields significantly smaller planning problem descriptions than regular representations do in HTN planning. The method is presented through a case study of a robot navigation domain and the blocks world domain. We present the benefits of using this approach in comparison with a pure HTN planning approach.