Abstract
In this paper, we focus on how to generate the multi-objective optimal plan in hierarchical task network (HTN) planning. Many practical HTN planning problems not only require feasible plans, but also require these plans to achieve the best performance on multiple criteria, which is the multi-objective optimization problem in HTN planning. Aiming to generate the multi-objective optimal plan in HTN planning, a novel HTN planning approach is proposed. Our initial step is to express multiple criteria by extending the concept of the HTN planning domain. The primary search process of our proposed HTN planning approach has two components. The first one is heuristic search, which assesses the quality of methods/operators and organizes them according to their dominance relations. The second one is anytime search, which reduces the search space on the basis of the dominance relations between the partial plan and the non-dominated plan set, which is updated during the planning process. After the termination of the HTN planning search, a non-dominated plan set is returned for the decision-maker to choose from. We adopt Zeno Travel domain problems and an emergency evacuation planning problem in an experimental study to demonstrate how effective and practicable the proposed approach is.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.