Recent advances in AI planning

AI Magazine

Volumn 20, Issue 2, 1999, Pages 93-123

  Weld, Daniel S ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; FORMAL LANGUAGES; GRAPH THEORY; LEARNING SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES;

GRAPHLAN; STOCHASTIC SAT METHOD;

ARTIFICIAL INTELLIGENCE;

EID: 0032633177     PISSN: 07384602     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (121)

1. Ambros-Ingerson, J., and Steel, S. 1988. Integrating Planning, Execution, and Monitoring. In Proceedings of the Seventh National Conference on Artificial Intelligence, 735-740. Menlo Park, Calif.: American Association for Artificial Intelligence.
2. Anderson, C.; Smith, D.; and Weld, D. 1998. Conditional Effects in GRAPHPLAN. In Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, 44-53. Menlo Park, Calif.: AAAI Press.
3. Bacchus, F., and Teh, Y. W. 1998. Making Forward-Chaining Relevant. In Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, 54-61. Menlo Park, Calif.: AAAI Press.
4. Bacchus, F., and van Run, P. 1995. Dynamic Variable Ordering in CSPS. In Proceedings of the 1995 Conference on Principles and Practice of Constraint Programming, 258-275. Heidelberg, Germany: Springer-Verlag.
5. Barrett, A., and Weld, D. 1994. Partial Order Planning: Evaluating Possible Efficiency Gains. Journal of Artificial Intelligence 67(1): 71-112.
6. Bayardo, R., and Schrag, R. 1997. Using CSP Look-Back Techniques to Solve Real-World SAT Instances. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, 203-208. Menlo Park, Calif.: American Association for Artificial Intelligence.
7. Blum, A., and Furst, M. 1997. Fast Planning through Planning Graph Analysis. Journal of Artificial Intelligence 90(1-2): 281-300.
8. Blum, A., and Furst, M. 1995. Fast Planning through Planning Graph Analysis. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1636-1642. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
9. Blum, A. L., and Langford, J. C. 1998. Probabilistic Planning in the GRAPHPLAN Framework. In Proceedings of the AIPS98 Workshop on Planning as Combinatorial Search, 8-12. Pittsburgh, Penn.: Carnegie Mellon University.
10. Bobrow, D., ed., 1984. Journal of Artificial Intelligence (Special Issue on Qualitative Reasoning about Physical Systems) 24(1).
11. Boutilier, C.; Dean, T.; and Hanks, S. 1995. Planning under Uncertainty: Structural Assumptions and Computational Leverage. In Proceedings of the Second European Workshop on Planning, 157-171. Amsterdam, Netherlands: IOS.
12. Boutilier, C.; Dearden, R.; and Goldszmidt, M. 1995. Exploiting Structure in Policy Construction. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1104-1111. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
13. Bylander, T. 1991. Complexity Results for Planning. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, 274-279. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
14. Chapman, D. 1987. Planning for Conjunctive Goals. Journal of Artificial Intelligence 32(3): 333-377.
15. Cheng, J., and Irani, K. B. 1989. Ordering Problem Subgoals. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, 931-936. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
16. Cook, S., and Mitchell, D. 1997. Finding Hard Instances of the Satisfiability Problem: A Survey. In Proceedings of the DIMACS Workshop on Satisfiability Problems, 11-13. Providence, R.I: American Mathematical Society.
17. Crawford, J., and Auton, L. 1993. Experimental Results on the Crossover Point in Satisfiability Problems. In Proceedings of the Eleventh National Conference on Artificial Intelligence, 21-27. Menlo Park, Calif.: American Association for Artificial Intelligence.
18. Davis, M.; Logemann, G.; and Loveland, D. 1962. A Machine Program for Theorem Proving. Communications of the ACM 5:394-397.
19. Dearden, R., and Boutilier, C. 1997. Abstraction and Approximate Decision-Theoretic Planning. Journal of Artificial Intelligence 89(1-2): 219-283.
20. DeJong, G., and Bennett, S. 1997. Permissive Planning: Extending Classical Planning to Uncertain Task Domains. Journal of Artificial Intelligence 89(1-2): 173-217.
21. de Kleer, J. 1986. An Assumption-Based Truth Maintenance System. Journal of Artificial Intelligence 28(2): 127-162.
22. Doyle, J. 1979. A Truth Maintenance System. Journal of Artificial Intelligence 12(3): 231-272.
23. Draper, D.; Hanks, S.; and Weld, D. 1994. Probabilistic Planning with Information Gathering and Contingent Execution. In Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, 31-36. Menlo Park, Calif.: American Association for Artificial Intelligence.
24. Ernst, M.; Millstein, T; and Weld, D. 1997. Automatic SAT-Compilation of Planning Problems. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1169-1176. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
25. Erol, K.; Hendler, J.; and Nau, D. 1994. HTN Planning: Complexity and Expressivity. In Proceedings of the Twelfth National Conference on Artificial Intelligence, 1123-1128. Menlo Park, Calif.: American Association for Artificial Intelligence.
26. Etzioni, O. 1993. Acquiring Search-Control Knowledge via Static Analysis. Artificial Intelligence 62(2): 255-302.
27. Etzioni, O., and Weld, D. 1994. A Softbot-Based Interface to the Internet. Communications of the ACM 37(7): 72-6.
28. Etzioni, O.; Hanks, S.; Weld, D.; Draper, D.; Lesh, N.; and Williamson, M. 1992. An Approach to Planning with Incomplete Information. In Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning, 115-125. San Francisco, Calif.: Morgan Kaufmann.
29. Falkenhainer, B., and Forbus, K. 1988. Setting Up Large Scale Qualitative Models. In Proceedings of the Seventh National Conference on Artificial Intelligence, 301-306. Menlo Park, Calif.: American Association for Artificial Intelligence.
30. Ferguson, G., and Allen, J. 1994. Arguing about Plans: Plan Representation and Reasoning in Mixed-Initiative Planning. In Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, 43-48. Menlo Park, Calif.: AAAI Press.
31. Ferguson, G.; Allen, J.; and Miller, B. 1996. TRAINS-95: Towards a Mixed-Initiative Planning Assistant. In Proceedings of the Third International Conference on Artificial Intelligence Planning Systems, 70-77. Menlo Park, Calif.: AAAI Press.
32. Fikes, R., and Nilsson, N. 1971. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving. Journal of Artificial Intelligence 2(3-4): 189-208.
33. Fox, M., and Long, D. 1998. The Automatic Inference of State Invariants in TIM. Technical Report 11/98, University of Durham.
34. Gazen, B., and Knoblock, C. 1997. Combining the Expressivity of UCPOP with the Efficiency of GRAPHPLAN. In Proceedings of the Fourth European Conference on Planning, 221-233. Berlin: Springer-Verlag.
35. Genesereth, M., and Nilsson, N. 1987. Logical Foundations of Artificial Intelligence. San Francisco, Calif.: Morgan Kaufmann.
36. Gent, I., and Walsh, T. 1993. Towards an Understanding of Hill-Climbing Procedures for SAT. In Proceedings of the Eleventh National Conference on Artificial Intelligence, 28-33. Menlo Park, Calif.: American Association for Artificial Intelligence.
37. Gerevini, A., and Schubert, L. 1998. Inferring State Constraints for Domain-Independent Planning. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, 905-912. Menlo Park, Calif.: American Association for Artificial Intelligence.
38. Gerevini, A., and Schubert, L. 1996. Accelerating Partial-Order Planners: Some Techniques for Effective Search Control and Pruning. Journal of Artificial Intelligence Research 5:95-137.
39. Giunchiglia, E.; Massarotto, A.; and Sebastiani, R. 1998. Act, and the Rest Will Follow: Exploiting Determinism in Planning as Satisfiability. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, 948-953. Menlo Park, Calif.: American Association for Artificial Intelligence.
40. Golden, K. 1998. Leap before You Look: Information Gathering in the PUCCINI Planner. In Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, 70-77. Menlo Park, Calif.: AAAI Press.
41. Golden, K.; Etzioni, O.; and Weld, D. 1994. Omnipotence without Omniscience: Sensor Management in Planning. In Proceedings of the Twelfth National Conference on Artificial Intelligence, 1048-1054. Menlo Park, Calif.: American Association for Artificial Intelligence.
42. Gomes, C.; Selman, B.; and Kautz, H. 1998. Boosting Combinatorial Search through Randomization. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, 431-437. Menlo Park, Calif.: American Association for Artificial Intelligence.
43. Green, C. 1969. Application of Theorem Proving to Problem Solving. In Proceedings of the First International Joint Conference on Artificial Intelligence, 219-239. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
44. Haas, A. 1987. The Case for Domain-Specific Frame Axioms. In The Frame Problem in Artificial Intelligence, Proceedings of the 1987 Workshop, 115-128. San Francisco, Calif.: Morgan Kaufmann.
45. Haralick, R. M., and Elliott, G. L. 1980. Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Journal of Artificial Intelligence 14(3): 263-313.
46. Irani, K. B., and Cheng, J. 1987. Subgoal Ordering and Goal Augmentation for Heuristic Problem Solving. In Proceedings of the Tenth International Joint Conference on Artificial Intelligence, 1018-1024. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
47. Joslin, D., and Pollack, M. 1996. Is "Early Commitment" in Plan Generation Ever a Good Idea? In Proceedings of the Thir-teenth National Conference on Artificial Intelligence, 1188-1193. Menlo Park, Calif.: American Association for Artificial Intelligence.
48. Joslin, D., and Pollack, M. 1994. Least-Cost Flaw Repair: A Plan Refinement Strategy for Partial-Order Planning. In Proceedings of the Twelfth National Conference on Artificial Intelligence, 1004-1009. Menlo Park, Calif.: American Association for Artificial Intelligence.
49. Kambhampati, S. 1998a. EBL and DDB for GRAPHPLAN. TR-99-008, Department of Computer Science and Engineering, Arizona State University.
50. Kambhampati, S. 1998b. On the Relations between Intelligent Backtracking and Failure-Driven Explanation-Based Learning in Constraint Satisfaction and Planning. TR-97-018, Department of Computer Science and Engineering, Arizona State University.
51. Kambhampati, S. 1997a. Challenges in Bridging Plan Synthesis Paradigms. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 44-49. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
52. Kambhampati, S. 1997b. Refinement Planning as a Unifying Framework for Plan Synthesis. AI Magazine 18(2): 67-97.
53. Kambhampati, S.; Knoblock, C.; and Yang, Q. 1995. Planning as Refinement Search: A Unified Framework for Evaluating Design Trade-Offs in Partial Order Planning. Journal of Artificial Intelligence 76(1-2): 167-238.
54. Kambhampati, R.; Lambrecht, E.; and Parker, E. 1997. Understanding and Extending GRAPHPLAN. In Proceedings of the Fourth European Conference on Planning, 260-272. Berlin: Springer-Verlag.
55. Kambhampati, R.; Mali, A.; and Srivastava, B. 1998. Hybrid Planning for Partially Hierarchical Domains. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, 882-888. Menlo Park, Calif.: American Association for Artificial Intelligence.
56. Kautz, H., and Selman, B. 1998a. BLACKBOX: A New Approach to the Application of Theorem Proving to Problem Solving. In AIPS98 Workshop on Planning as Combinatorial Search, 58-60. Pittsburgh, Penn.: Carnegie Mellon University.
57. Kautz, H., and Selman, B. 1998b. The Role of Domain-Specific Knowledge in the Planning as Satisfiability Framework. In Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, 181-189. Menlo Park, Calif.: AAAI Press.
58. Kautz, H., and Selman, B. 1996. Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, 1194-1201. Menlo Park, Calif.: American Association for Artificial Intelligence.
59. Kautz, H., and Selman, B. 1992. Planning as Satisfiability. In Proceedings of the Tenth European Conference on Artificial Intelligence, 359-363. Chichester, U.K.: Wiley.
60. Kautz, H.; McAllester, D.; and Selman, B. 1996. Encoding Plans in Propositional Logic. In Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning, 374-384. San Francisco, Calif.: Morgan Kaufmann.
61. Kelleher, K., and Cohen, P. 1992. Automatically Synthesizing Domain Constraints from Operator Descriptions. In Proceedings of the Tenth European Conference on Artificial Intelligence, 653-655. Chichester, U.K.: Wiley.
62. Knoblock, C. 1995. Planning, Executing, Sensing, and Replanning for Information Gathering. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1686-1693. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
63. Knoblock, C. 1992. An Analysis of ABSTRIPS. In Proceedings of the First International Conference on Artificial Intelligence Planning Systems, 126-135. San Francisco, Calif.: Morgan Kaufmann.
64. Knoblock, C. 1991. Automatically Generating Abstractions for Problem Solving. Technical report, CMU-CS-91-120, Ph.D. diss., Carnegie Mellon University.
65. Knoblock, C. 1990. Learning Abstraction Hierarchies for Problem Solving. In Proceedings of the Eighth National Conference on Artificial Intelligence, 923-928. Menlo Park, Calif.: American Association for Artificial Intelligence.
66. Koehler, J. 1998a. Planning under Resource Constraints. In Proceedings of the Thirteenth European Conference on Artificial Intelligence, 489-493. Chichester, U.K.: Wiley.
67. Koehler, J. 1998b. Solving Complex Planning Tasks through Extraction of Subproblems. In Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, 62-69. Menlo Park, Calif.: AAAI Press.
68. Koehler, J.; Nebel, B.; Hoffmann, J.; aNd Dimopoulos, Y. 1997a. Extending Planning Graphs to an ADL Subset. In Proceedings of the Fourth European Conference on Planning, 273-285. Berlin: Springer-Verlag.
69. Koehler, J.; Nebel, B.; Hoffmann, J.; and Dimopoulos, Y. 1997b. Extending Planning Graphs to an ADL Subset. TR 88, Institute for Computer Science, University of Freiburg.
70. Kondrack, G., and van Beek. P. 1997. A Theoretical Evaluation of Selected Backtracking Algorithms. Journal of Artificial Intelligence 89(1-2): 365-387.
71. Korf, R. 1987. Planning as Search: A Quantitative Approach. Journal of Artificial Intelligence 33(1): 65-88.
72. Kushmerick, N.; Hanks, S.; and Weld, D. 1995. An Algorithm for Probabilistic Planning. Journal of Artificial Intelligence 76(1-2): 239-286.
73. Kushmerick, N.; Hanks, S.; and Weld, D. 1994. An Algorithm for Probabilistic Least Commitment Planning. In Proceedings of the Twelfth National Conference on Artificial Intelligence, 1073-1078. Menlo Park, Calif.: American Association for Artificial Intelligence.
74. Lansky, A. L. 1998. Localized Planning with Action-Based Constraints. Journal of Artificial Intelligence 98(1-2): 49-136.
75. Li, C., and Anbulagan. 1997. Heuristics Based on Unit Propagation for Satisfiability Problems. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 366-371. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
76. Littman, M. 1997. Probabilistic Propositional Planning: Representations and Complexity. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, 748-754. Menlo Park, Calif.: American Association for Artificial Intelligence.
77. Long, D., and Fox, M. 1998. Efficient Implementation of the PLAN GRAPH in STAN. Technical Report, TR 14/98, Durham University.
78. McAllester, D. 1990. Truth Maintenance. In Proceedings of the Eighth National Conference on Artificial Intelligence, 1109-1116. Menlo Park, Calif.: American Association for Artificial Intelligence.
79. McAllester, D. 1980. An Outlook on Truth Maintenance. AI memo, 551, AI Lab, Massachusetts Institute of Technology.
80. McAllester, D., and Rosenblitt, D. 1991. Systematic Nonlinear Planning. In Proceedings of the Ninth National Conference on Artificial Intelligence, 634-639. Menlo Park, Calif.: American Association for Artificial Intelligence.
81. McAllester, D.; Selman, B.; and Kautz, H. 1997. Evidence for Invariants in Local Search. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, 321-326. Menlo Park, Calif.: American Association for Artificial Intelligence.
82. McCarthy, J., and Hayes, P. J. 1969. Some Philosophical Problems from the Standpoint of Artificial Intelligence. In Machine Intelligence 4, 463-502. Edinburgh, U.K.: Edinburgh University Press.
83. McDermott, D. 1996. A Heuristic Estimator for Means-Ends Analysis in Planning. In Proceedings of the Third International Conference on Artificial Intelligence Planning Systems, 142-149. Menlo Park, Calif.: AAAI Press.
84. Majercik, S. M., and Littman, M. L. 1998a. MAX-PLAN: A New Approach to Probabilistic Planning. In Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, 86-93. Menlo Park, Calif.: AAAI Press.
85. Majercik, S. M., and Littman, M. L. 1998b. Using Caching to Solve Larger Probabilistic Planning Problems. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, 954-960. Menlo Park, Calif.: American Association for Artificial Intelligence.
86. Mali, A. D., and Kambhampati, S. 1998. Encoding HTN Planning in Propositional Logic. In Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, 190-198. Menlo Park, Calif.: AAAI Press.
87. Minton, S.; Carbonell, J. G.; Knoblock, C. A.; Kuokka, D. R.; Etzioni, O.; and Gil, Y. 1989. Explanation-Based Learning: A Problem-Solving Perspective. Journal of Artificial Intelligence 40(1-3): 63-118.
88. Muscettola, N.; Nayak, P. P.; Pell, B.; and Williams, B. C. 1998. Remote Agent: To Boldly Go Where No AI System Has Gone Before. Artificial Intelligence 103(1-2): 5-48.
89. Nayak, P., and Williams, B. 1997. Fast Context Switching in Real-Time Propositional Reasoning. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, 50-56. Menlo Park, Calif.: American Association for Artificial Intelligence.
90. Nebel, B.; Dimopoulos, Y.; and Koehler, J. 1997. Ignoring Irrelevant Facts and Operators in Plan Generation. In Proceedings of the Fourth European Conference on Planning, 338-350. Berlin: Springer-Verlag.
91. Okushi, F. 1998. Parallel Cooperative Propositional Theorem Proving. In Proceedings of the Fifth International Symposium on Artificial Intelligence and Mathematics. Dordrecht, The Netherlands: Kluwer Academic.
92. Pednault, E. 1989. ADL: Exploring the Middle Ground between STRIPS and the Situation Calculus. In Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning, 324-332. San Francisco, Calif.: Morgan Kaufmann.
93. Pell, B.; Bernard, D.; Chien, S.; Gat, E.; Muscettola, N.; Nayak, P.; Wagner, M.; and Williams, B. 1997. An Autonomous Spacecraft Agent Prototype. In Proceedings of the First International Conference on Autonomous Agents, 253-261. New York: Association for Computing Machinery.
94. Pell, B.; Bernard, D. E.; Chien, S. A.; Gat, E.; Muscettola, N.; Nayak, P. P.; Wagner, M. D.; and Williams, B. C. 1998. An Autonomous Spacecraft Agent Prototype. Autonomous Robots 5(1): 93-108.
95. Penberthy, J., and Weld, D. 1992. UCPOP: A Sound, Complete, Partial Order Planner for ADL. In Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning, 103-114. San Francisco, Calif.: Morgan Kaufmann.
96. Peot, M., and Smith, D. 1992. Conditional Nonlinear Planning. In Proceedings of the First International Conference on Artificial Intelligence Planning Systems, 189-197. San Francisco, Calif.: Morgan Kaufmann.
97. Pollack, M. E.; Joslin, D.; and Paolucci, M. 1997. Flaw Selection Strategies for Partial-Order Planning. Journal of Artificial Intelligence Research 6:223-262.
98. Rintanen, J. T. 1998. A Planning Algorithm Not Based on Directional Search. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning, 953-960. San Francisco, Calif.: Morgan Kaufmann.
99. Selman, B.; Kautz, H.; and Cohen, B. 1996. Local Search Strategies for Satisfiability Testing. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26:521-532.
100. Selman, B.; Kautz, H.; and Cohen, B. 1994. Noise Strategies for Improving Local Search. In Proceedings of the Twelfth National Conference on Artificial Intelligence, 337-343. Menlo Park, Calif.: American Association for Artificial Intelligence.
101. Selman, B.; Kautz, H.; and McAllester, D. 1997. Computational Challenges in Propositional Reasoning and Search. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 50-54. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
102. Selman, B.; Levesque, H.; and Mitchell, D. 1992. A New Method for Solving Hard Satisfiability Problems. In Proceedings of the Tenth National Conference on Artificial Intelligence, 440-446. Menlo Park, Calif.: American Association for Artificial Intelligence.
103. Smith, D. 1989. Controlling Backward Inference. Journal of Artificial Intelligence 39(2): 145-208.
104. Smith, D., and Peot, M. 1996. Suspending Recursion in Causal Link Planning. In Proceedings of the Third International Conference on Artificial Intelligence Planning Systems, 182-189. Menlo Park, Calif.: AAAI Press.
105. Smith, D., and Peot, M. 1993. Postponing Threats in Partial-Order Planning. In Proceedings of the Eleventh National Conference on Artificial Intelligence, 500-506. Menlo Park, Calif.: American Association for Artificial Intelligence.
106. Smith, D., and Weld, D. 1998a. Conformant GRAPHPLAN. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, 889-896. Menlo Park, Calif.: American Association for Artificial Intelligence.
107. Smith, D., and Weld, D. 1998b. Temporal GRAPHPLAN. Technical report, 98-09-06, Department of Computer Science and Engineering, University of Washington.
108. Srinivasan, R., and Howe, A. 1995. Comparison of Methods for Improving Search Efficiency in a Partial-Order Planner. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1620-1626. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
109. Stefik, M. 1981. Planning with Constraints (MOLGEN: Part 1). Journal of Artificial Intelligence 14(2): 111-139.
110. Tenenberg, J. 1988. Abstraction in Planning. Ph.D. thesis, Department of Computer Science, University of Rochester.
111. Van Gelder, A., and Okushi, F. 1998. A Propositional Theorem Prover to Solve Planning and Other Problems. In Proceedings of the Fifth International Symposium on Artificial Intelligence and Mathematics. Dordrecht, The Netherlands: Kluwer Academic.
112. Van Gelder, A., and Tsuji, Y. K. 1996. Satisfiability Testing with More Reasoning and Less Guessing. In Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, eds. D. S. Johnson and M. Trick, 559-586. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Providence, R.I.: American Mathematical Society.
113. Veloso, M. 1994. Flexible Strategy Learning: Analogical Replay of Problem-Solving Episodes. In Proceedings of the Twelfth National Conference on Artificial Intelligence, 595-600. Menlo Park, Calif.: American Association for Artificial Intelligence.
114. Weld, D. 1994. An Introduction to Least Commitment Planning. AI Magazine 15(4): 27-61.
115. Weld, D., and de Kleer, J., eds. 1989. Readings in Qualitative Reasoning about Physical Systems. San Francisco, Calif.: Morgan Kaufmann.
116. Weld, D. S.; Anderson, C. R.; and Smith, D. E. 1998. Extending GRAPHPLAN to Handle Uncertainty and Sensing Actions. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, 897-904. Menlo Park, Calif.: American Association for Artificial Intelligence.
117. Williams, B. C., and Nayak, P. P. 1997. A Reactive Planner for a Model-Based Execution. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1178-1185. Menlo Park, Calif.: International Joint Conferences on Artificial Intelligence.
118. Williams, B. C., and Nayak, P. P. 1996. A Model-Based Approach to Reactive Self-Configuring Systems. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, 971-978. Menlo Park, Calif.: American Association for Artificial Intelligence.
119. Yang, Q. 1990. Formalizing Planning Knowledge for Hierarchical Planning. Computational Intelligence 6(1): 12-24.
120. Yang, Q., and Chan, A. 1994. Delaying Variable Binding Committments in Planning. In Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, 182-187. Menlo Park, Calif.: AAAI Press.
121. Yang, Q., and Tenenberg, J. 1990. ABTWEAK: Abstracting a Nonlinear, Least Commitment Planner. In Proceedings of the Eighth National Conference on Artificial Intelligence, 204-209. Menlo Park, Calif.: American Association for Artificial Intelligence.