from Part II - Hierarchical Task Networks
Published online by Cambridge University Press: 19 May 2025
This chapter is about representing HTN planning domains and solving HTN planning problems. Several of the formal definitions require the same "classical planning" restrictions as in Part I, but most practical HTN implementations loosen or drop several of these restrictions. We first discuss ways to represent and solve planning problems in which there is a totally ordered sequence of tasks to accomplish. We then generalize to allow partially ordered tasks and describe ways to combine classical planning and HTN planning. Finally, we briefly discuss heuristic functions, expressivity, and computational complexity.
To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Find out more about the Kindle Personal Document Service.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.
To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.