کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
377313 658400 2009 31 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Anytime heuristic search for partial satisfaction planning
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
Anytime heuristic search for partial satisfaction planning
چکیده انگلیسی

We present a heuristic search approach to solve partial satisfaction planning (PSP) problems. In these problems, goals are modeled as soft constraints with utility values, and actions have costs. Goal utility represents the value of each goal to the user and action cost represents the total resource cost (e.g., time, fuel cost) needed to execute each action. The objective is to find the plan that maximizes the trade-off between the total achieved utility and the total incurred cost; we call this problem PSP Net Benefit. Previous approaches to solving this problem heuristically convert PSP Net Benefit into STRIPS planning with action cost by pre-selecting a subset of goals. In contrast, we provide a novel anytime search algorithm that handles soft goals directly. Our new search algorithm has an anytime property that keeps returning better quality solutions until the termination criteria are met. We have implemented this search algorithm, along with relaxed plan heuristics adapted to PSP Net Benefit problems, in a forward state-space planner called SapaPS. An adaptation of SapaPS, called YochanPS, received a “distinguished performance” award in the “simple preferences” track of the 5th International Planning Competition.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Artificial Intelligence - Volume 173, Issues 5–6, April 2009, Pages 562-592