Distance-Based Goal-Ordering Heuristics for Graphplan
暂无分享,去创建一个
[1] Subbarao Kambhampati,et al. Understanding and Extending Graphplan , 1997, ECP.
[2] David E. Smith,et al. Extending Graphplan to handle uncertainty and sensing actions , 1998, AAAI 1998.
[3] Drew McDermott,et al. Using Regression-Match Graphs to Control Search in Planning , 1999, Artif. Intell..
[4] Jana Koehler,et al. Solving Complex Planning Tasks Through Extraction of Subproblems , 1998, AIPS.
[5] Bart Selman,et al. Unifying SAT-based and Graph-based Planning , 1999, IJCAI.
[6] Subbarao Kambhampati,et al. Extracting Effective and Admissible State Space Heuristics from the Planning Graph , 2000, AAAI/IAAI.
[7] Henry Kautz,et al. Blackbox: Unifying sat-based and graph-based planning , 1999, International Joint Conference on Artificial Intelligence.
[8] Brian Falkenhainer,et al. Dynamic Constraint Satisfaction Problems , 1990, AAAI.
[9] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[10] Patrik Haslum,et al. Admissible Heuristics for Optimal Planning , 2000, AIPS.
[11] Blai Bonet,et al. A Robust and Fast Action Selection Mechanism for Planning , 1997, AAAI/IAAI.
[12] Blai Bonet,et al. Planning as Heuristic Search: New Results , 1999, ECP.
[13] Fahiem Bacchus,et al. Dynamic Variable Ordering in CSPs , 1995, CP.
[14] Subbarao Kambhampati,et al. Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan , 2000, J. Artif. Intell. Res..
[15] David E. Smith,et al. Extending Graphplan to Handle Uncertainty & Sensing Actions , 1998, AAAI/IAAI.
[16] Edward P. K. Tsang,et al. Foundations of constraint satisfaction , 1993, Computation in cognitive science.
[17] Ioannis P. Vlahavas,et al. GRT: A Domain Independent Heuristic for STRIPS Worlds Based on Greedy Regression Tables , 1999, ECP.
[18] R. Dechter. to Constraint Satisfaction , 1991 .
[19] Rina Dechter,et al. In Search of the Best Constraint Satisfaction Search , 1994, AAAI.