Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Hierarchical task network
open-in-new
<h2 id="see-also">See also</h2> <ul><li><a href="/facts/Stanford_Research_Institute_Problem_Solver/jRBHW0T2">STRIPS</a></li> <li><a href="/facts/Hierarchical_control_system/7G56Ulnq">Hierarchical control system</a> - a feedback control system well suited for HTN planning</li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>NOAH <a href="https://www.ijcai.org/Proceedings/75/Papers/028.pdf" target="_blank">https://www.ijcai.org/Proceedings/75/Papers/028.pdf</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Nonlin <a href="http://www.aiai.ed.ac.uk/project/nonlin/" target="_blank">http://www.aiai.ed.ac.uk/project/nonlin/</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>David E. Wilkins. "SIPE-2: System for Interactive Planning and Execution". Artificial Intelligence Center. SRI International. Retrieved 2013-06-13. <a href="http://www.ai.sri.com/~sipe/" target="_blank">http://www.ai.sri.com/~sipe/</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>O-Plan <a href="http://www.aiai.ed.ac.uk/project/oplan/" target="_blank">http://www.aiai.ed.ac.uk/project/oplan/</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>UMCP <a href="http://www.cs.umd.edu/projects/plus/umcp/" target="_blank">http://www.cs.umd.edu/projects/plus/umcp/</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> <li id="fn:6"><p>I-X/I-Plan <a href="http://www.aiai.ed.ac.uk/project/ix/" target="_blank">http://www.aiai.ed.ac.uk/project/ix/</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></p></li> <li id="fn:7"><p>SHOP2 <a href="http://www.cs.umd.edu/projects/shop/" target="_blank">http://www.cs.umd.edu/projects/shop/</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></p></li> <li id="fn:8"><p>PANDA <a href="https://www.uni-ulm.de/en/in/ki/research/software/panda/" target="_blank">https://www.uni-ulm.de/en/in/ki/research/software/panda/</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></p></li> <li id="fn:9"><p>HTNPlan-P <a href="http://www.cs.toronto.edu/kr/publications/1242050782_Sohrabi-IJCAI09.pdf" target="_blank">http://www.cs.toronto.edu/kr/publications/1242050782_Sohrabi-IJCAI09.pdf</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></p></li> <li id="fn:10"><p>Erol, Kutluhan; Hendler, James; Nau, Dana S. (1996). "Complexity results for htn planning" (PDF). Annals of Mathematics and Artificial Intelligence. 18. Springer: 69–93. Retrieved 8 February 2015. <a href="/wiki/Dana_S._Nau" target="_blank">/wiki/Dana_S._Nau</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></p></li> <li id="fn:11"><p>Alford, Ron; Bercher, Pascal; Aha, David (June 2015). Tight Bounds for HTN Planning (PDF). Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS). Retrieved 8 February 2015.[permanent dead link] <a href="http://www.volus.net/publications/alford2015tight.pdf" target="_blank">http://www.volus.net/publications/alford2015tight.pdf</a> <a href="#fnref:11" class="footnote-back-ref">↩</a></p></li> <li id="fn:12"><p>Alford, Ron; Kuter, Ugur; Nau, Dana S. (July 2009). Translating HTNs to PDDL: A small amount of domain knowledge can go a long way (PDF). Twenty-First International Joint Conference on Artificial Intelligence (IJCAI). Retrieved 8 February 2015. <a href="/wiki/Dana_S._Nau" target="_blank">/wiki/Dana_S._Nau</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></p></li> </ol>