Sciweavers

67 search results - page 1 / 14
» On the Compilation of Plan Constraints and Preferences
Sort
View
IJCAI
2007
13 years 6 months ago
Constraint Partitioning for Solving Planning Problems with Trajectory Constraints and Goal Preferences
The PDDL3 specifications include soft goals and trajectory constraints for distinguishing highquality plans among the many feasible plans in a solution space. To reduce the compl...
Chih-Wei Hsu, Benjamin W. Wah, Ruoyun Huang, Yixin...
AIPS
2009
13 years 6 months ago
Learning User Plan Preferences Obfuscated by Feasibility Constraints
It has long been recognized that users can have complex preferences on plans. Non-intrusive learning of such preferences by observing the plans executed by the user is an attracti...
Nan Li, William Cushing, Subbarao Kambhampati, Sun...
LPNMR
2007
Springer
13 years 11 months ago
CPP: A Constraint Logic Programming Based Planner with Preferences
Abstract. We describe the development of a constraint logic programming based system, called CPP, which is capable of generating most preferred plans with respect to a user’s pre...
Phan Huy Tu, Tran Cao Son, Enrico Pontelli
SARA
2005
Springer
13 years 10 months ago
Approximate Model-Based Diagnosis Using Preference-Based Compilation
Abstract. This article introduces a technique for improving the efficiency of diagnosis through approximate compilation. We extend the approach of compiling a diagnostic model, as...
Gregory M. Provan