Finding Admissible Bounds for Oversubscription Planning Problems
暂无分享,去创建一个
[1] Subbarao Kambhampati,et al. A Hybrid Linear Programming and Relaxed Plan Heuristic for Partial Satisfaction Planning Problems , 2007, ICAPS.
[2] Subbarao Kambhampati,et al. Reviving Integer Programming Approaches for AI Planning: A Branch-and-Cut Framework , 2005, ICAPS.
[3] Ronen I. Brafman,et al. Planning with Goal Preferences and Constraints , 2005, ICAPS.
[4] Subbarao Kambhampati,et al. An LP-Based Heuristic for Optimal Planning , 2007, CP.
[5] Blai Bonet,et al. Heuristics for Planning with Penalties and Rewards using Compiled Knowledge , 2006, KR.
[6] Patrik Haslum. Improving Heuristics Through Relaxed Search - An Analysis of TP4 and HSP*a in the 2004 Planning Competition , 2006, J. Artif. Intell. Res..
[7] Blai Bonet,et al. Planning as heuristic search , 2001, Artif. Intell..
[8] Subbarao Kambhampati,et al. Effective Approaches for Partial Satisfaction (Over-Subscription) Planning , 2004, AAAI.
[9] Christer Bäckström. Equivalence and Tractability Results for SAS+ Planning , 1992, KR.
[10] Fahiem Bacchus,et al. Graphical models for preference and utility , 1995, UAI.
[11] Jorge A. Baier,et al. A Heuristic Search Approach to Planning with Temporally Extended Preferences , 2007, IJCAI.
[12] Dana S. Nau,et al. On the Use of Integer Programming Models in AI Planning , 1999, IJCAI.
[13] A. Gerevini,et al. Plan Constraints and Preferences in PDDL 3 The Language of the Fifth International Planning Competition , 2005 .
[14] Subbarao Kambhampati,et al. Planning with Goal Utility Dependencies , 2007, IJCAI.
[15] David E. Smith. Choosing Objectives in Over-Subscription Planning , 2004, ICAPS.