HTN planning: complexity and expressivity
作者： Dana S. Nau , Kutluhan Erol , James Hendler
DOI:
关键词:
摘要: Most practical work on AI planning systems during the last fifteen years has been based hierarchical task network (HTN) decomposition, but until now, there very little analytical properties of HTN planners. This paper describes how complexity varies with various conditions networks.
参考文章(15)
Austin Tate, Generating project networks international joint conference on artificial intelligence. pp. 888- 893 ,(1977)
Mark E. Drummond, Refining and extending the procedural net international joint conference on artificial intelligence. pp. 1010- 1011 ,(1985)
悦朗 守屋, J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 情報処理. ,vol. 21, pp. 802- 803 ,(1980)
Earl D. Sacerdoti, The nonlinear nature of plans international joint conference on artificial intelligence. pp. 206- 214 ,(1975)
Dana S. Nau, Kutluhan Erol, James Hendler, Semantics for hierarchical task-network planning University of Maryland at College Park. ,(1994)
David E. Wilkins, Practical Planning: Extending the Classical AI Planning Paradigm ,(1989)
Rajeev Motwani, John E. Hopcroft, Jeffrey D. Ullman, Rotwani, Introduction to Automata Theory, Languages, and Computation ,(1979)
Amy L. Lansky, Localized event-based reasoning for multiagent domains computational intelligence. ,vol. 4, pp. 319- 340 ,(1988) , 10.1111/J.1467-8640.1988.TB00282.X
Kutluhan Erol, Dana S. Nau, V.S. Subrahmanian, Complexity, decidability and undecidability results for domain-independent planning Artificial Intelligence. ,vol. 76, pp. 75- 88 ,(1995) , 10.1016/0004-3702(94)00080-K
Kutluhan Erol, James Hendler, Dana S. Nau, Complexity results for HTN planning Annals of Mathematics and Artificial Intelligence. ,vol. 18, pp. 69- 93 ,(1994) , 10.1007/BF02136175