Understanding and Extending Graphplan
暂无分享,去创建一个
[1] Anthony Barrett,et al. Partial-Order Planning: Evaluating Possible Efficiency Gains , 1994, Artificial Intelligence.
[2] Roberto J. Bayardo,et al. Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.
[3] Avrim Blum,et al. Fast Planning Through Planning Graph Analysis , 1995, IJCAI.
[4] Drew McDermott,et al. A Heuristic Estimator for Means-Ends Analysis in Planning , 1996, AIPS.
[5] Roberto J. Bayardo,et al. Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances , 1996, CP.
[6] Eric Parker. Making Graphplan Goal-Directed , 1999, ECP.
[7] Subbarao Kambhampati,et al. Refinement Planning as a Unifying Framework for Plan Synthesis , 1997, AI Mag..
[8] Subbarao Kambhampati,et al. Planning as Refinement Search: A Unified Framework for Evaluating Design Tradeoffs in Partial-Order Planning , 1995, Artif. Intell..
[9] Alan K. Mackworth. Constraint Satisfaction , 1985 .
[10] R. Dechter. to Constraint Satisfaction , 1991 .
[11] Rina Dechter,et al. In Search of the Best Constraint Satisfaction Search , 1994, AAAI.
[12] Mark Drummond,et al. Situated Control Rules , 1989, KR.
[13] Bart Selman,et al. Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.
[14] Subbarao Kambhampati,et al. On the Relations Between Intelligent Backtracking and Failure-Driven Explanation-Based Learning in Constraint Satisfaction and Planning , 1998, Artif. Intell..
[15] Brian Falkenhainer,et al. Dynamic Constraint Satisfaction Problems , 1990, AAAI.
[16] Subbarao Kambhampati,et al. On the Role of Disjunctive Representations and Constraint Propagation in Refinement Planning , 1996, KR.
[17] Frank P. Coyle,et al. Aaai '90 , 1990, IEEE Expert.