Planning by rewriting

Journal of Artificial Intelligence Research

Volumn 15, Issue , 2001, Pages 207-261

  Ambite, José Luis ^a   Knoblock, Craig A ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING;

DOMAIN-INDEPENDENT PLANNING; PLANNING BY REWRITING (PBR);

PLANNING;

EID: 0013401935     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.754     Document Type: Article

References (85)

1. Aarts, E., & Lenstra, J. K. (1997). Local Search in Combinatorial Optimization. John Wiley and Sons, Chichester, England.
2. Abiteboul, S., Hull, R., & Vianu, V. (1995). Foundations of Databases. Addison-Wesley.
3. Ambite, J. L. (1998). Planning by Rewriting. Ph.D. thesis, University of Southern California.
4. Ambite, J. L., & Knoblock, C. A. (1997). Planning by rewriting: Efficiently generating high-quality plans. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, pp. 706-713 Providence, RI.
5. Ambite, J. L., & Knoblock, C. A. (2000). Flexible and scalable cost-based query planning in mediators: A transformational approach. Artificial Intelligence, 118(1-2), 115-161.
6. Ambite, J. L., Knoblock, C. A., & Minton, S. (2000). Learning plan rewriting rules. In Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling Systems Breckenridge, CO.
7. Ashish, N., Knoblock, C. A., & Levy, A. (1997). Information gathering plans with sensing actions. In Steel, S., & Alami, R. (Eds.), Recent Advances in AI Planning: 4th European Conference on Planning, ECP'97. Springer-Verlag, New York.
8. Avenhaus, J., & Madlener, K. (1990). Term rewriting and equational reasoning. In Formal Techniques in Artificial Intelligence, pp. 1-43. Elsevier, North Holland.
9. Baader, F., & Nipkow, T. (1998). Term Rewriting and All That. Cambridge University Press.
10. Bacchus, F., & Kabanza, F. (1995). Using temporal logic to control search in a forward chaining planner. In Proceedings of the 3rd European Workshop on Planning.
11. Bacchus, F., &: Kabanza, F. (2000). Using temporal logics to express search control knowledge for planning. Artificial Intelligence, 116(1-2), 123-191.
12. Bäckström, C. (1994a). Executing parallel plans faster by adding actions. In Cohn, A. G. (Ed.), Proceedings of the Eleventh European Conference on Artificial Intelligence, pp. 615-619 Amsterdam, Netherlands. John Wiley and Sons.
13. Bäckström, C. (1994b). Finding least constrained plans and optimal parallel executions is harder that we thought. In Bäckström, C., & Sandewell, E. (Eds.), Current Trends in AI Planning: Proceedings of the 2nd European Workshop on Planning (EWSP-93), pp. 46-59 Vadstena, Sweeden. IOS Press (Amsterdam).
14. + planning. Computational Intelligence, 11(4), 625-655.
15. Blum, A. L., & Furst, M. L. (1995). Fast planning through planning graph analysis. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence Montreal, Canada.
16. Blum, A. L., & Furst, M. L. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90(1-2), 281-300.
17. Bonet, B., & Geffner, H. (1999). Planning as heuristic search: New results. In Proceedings of the Fifth European Conference on Planning (ECP-99) Durham, UK.
18. Bonet, B., Loerincs, G., & Geffner, H. (1997). A robust and fast action selection mechanism for planning. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, pp. 714-719 Providence, RI.
19. Borrajo, D., & Veloso, M. (1997). Lazy incremental learning of control knowledge for efficiently obtaining quality plans. AI Review, 11, 371-405.
20. Bylander, T. (1994). The computation complexity of propositional strips. Artificial Intelligence, 69(1-2), 165-204.
21. Carbonell, J. G., Knoblock, C. A., & Minton, S. (1991). PRODIGY: An integrated architecture for planning and learning. In VanLehn, K. (Ed.), Architectures for Intelligence, pp. 241-278. Lawrence Erlbaum, Hillsdale, NJ.
22. Cherniack, M., & Zdonik, S. B. (1996). Rule languages and internal algebras for rule-based optimizers. SIGMOD Record (ACM Special Interest Group on Management of Data), 25(2), 401-412.
23. Cherniack, M., & Zdonik, S. B. (1998). Changing the rules: Transformations for rule-based optimizers. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 61-72 Seattle, WA.
24. Dean, T., & Boddy, M. (1988). An analysis of time-dependent planning. In Proceedings of the Seventh National Conference on Artificial Intelligence, pp. 49-54 Saint Paul, MN.
25. Dorr, H. (1995). Efficient graph rewriting and its implementation, Vol. 922 of Lecture Notes in Computer Science. Springer-Verlag Inc., New York, NY, USA.
26. Erol, K., Nau, D., & Hendler, J. (1994). UMCP: A sound and complete planning procedure for hierarchical task-network planning. In Proceedings of the Second International Conference on Artificial Intelligence Planning Systems, pp. 249-254 Chicago, IL.
27. Erol, K., Nau, D., & Subrahmanian, V. S. (1995). Decidability and undecidability results for domain-independent planning. Artificial Intelligence, 76(1-2), 75-88.
28. Estlin, T. A., & Mooney, R. J. (1997). Learning to improve both efficiency and quality of planning. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, pp. 1227-1233 Nagoya, Japan.
29. Etzioni, O. (1993). Acquiring search-control knowledge via static analysis. Artificial Intelligence, 62(2), 255-302.
30. Etzioni, O., & Weld, D. S. (1994). A softbot-based interface to the Internet. Communications of the ACM, 37(7).
31. Fikes, R. E., & Nilsson, N. J. (1971). STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2(3/4), 189-208.
32. Forgy, C. L. (1982). Rete: A fast algorithm for the many pattern/many object pattern match problem. Artificial Intelligence, 19, 17-37.
33. Foulser, D. E., Li, M., & Yang, Q. (1992). Theory and algorithms for plan merging. Artificial Intelligence, 57(2-3), 143-182.
34. Fox, M., & Long, D. (1998). The automatic inference of state invariants in TIM. Journal of Artificicial Intelligence Research, 9, 367-421.
35. Gerevini, A., & Schubert, L. (1998). Inferring state constraints for domain-independent planning. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, pp. 905-912 Madison, WI.
36. Glover, F. (1989). Tabu search - Part I. ORSA Journal on Computing, 1(3), 190-206.
37. Gomes, C. P., Selman, B., & Kautz, H. (1998). Boosting combinatorial search through randomization. In Proceedings of the Fifteenth National Conference on Artificial Intelligence Madison, WI.
38. Gupta, N., & Nau, D. S. (1992). On the complexity of blocks-world planning. Artificial Intelligence, 56(2-3), 223-254.
39. Hanks, S., & Weld, D. S. (1995). A domain-independent algorithm for plan adaptation. Journal of Artificicial Intelligence Research, 2, 319-360.
40. Johnson, D. S. (1990). Local optimization and the traveling salesman problem. In Paterson, M. S. (Ed.), Automata, Languages and Programming: Proc. of the 17th International Colloquium, pp. 446-461. Springer, New York.
41. Kambhampati, S. (1992). A validation-structure-based theory of plan modification and reuse. Artificial Intelligence, 55(2-3), 193-258.
42. Kambhampati, S., Knoblock, C. A., & Yang, Q. (1995). Planning as refinement search: A unified framework for evaluating the design tradeoffs in partial order planning. Artificial Intelligence, 76(1-2), 167-238.
43. Kautz, H., & Selman, B. (1992). Planning as satisfiability. In Neumann, B. (Ed.), Proceedings of the 10th European Conference on Artificial Intelligence, pp. 359-363 Vienna, Austria. John Wiley & Sons.
44. Kautz, H., & Selman, B. (1996). Pushing the envelope: Planning, prepositional logic, and stochastic search. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, pp. 1194-1201 Portland, OR.
45. Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, 671-680.
46. Knoblock, C. A. (1994a). Automatically generating abstractions for planning. Artificial Intelligence, 68(2), 243-302.
47. Knoblock, C. A. (1994b). Generating parallel execution plans with a partial-order planner. In Proceedings of the Second International Conference on Artificial Intelligence Planning Systems Chicago, IL.
48. Knoblock, C. A. (1995). Planning, executing, sensing, and replanning for information gathering. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence Montreal, Canada.
49. Knoblock, C. A. (1996). Building a planner for information gathering: A report from the trenches. In Proceedings of the Third International Conference on Artificial Intelligence Planning Systems Edinburgh, Scotland.
50. Koehler, J. (1998). Solving complex planning tasks through extraction of subproblems. In Simmons, R., Veloso, M., &: Smith, S. (Eds.), Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems, pp. 62-69 Pittsburgh, PA.
51. Koehler, J., & Hoffmann, J. (2000). On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm. Journal of Artificial Intelligence Research, 12, 338-386.
52. Koehler, J., Nebel, B., Hoffman, J., & Dimopoulos, Y. (1997). Extending planning graphs to an ADL subset. In Steel, S., & Alami, R. (Eds.), Proceedings of the Fourth European Conference on Planning (ECP-97): Recent Advances in AI Planning, Vol. 1348 of LNAI, pp. 273-285 Berlin. Springer.
53. McAllester, D., & Rosenblitt, D. (1991). Systematic nonlinear planning. In Proceedings of the Ninth National Conference on Artificial Intelligence Anaheim, CA.
54. Minton, S. (1988a). Learning Effective Search Control Knowledge: An Explanation-Based Approach. Ph.D. thesis, Computer Science Department, Carnegie Mellon University.
55. Minton, S. (1988b). Learning Search Control Knowledge: An Explanation-Based Approach. Kluwer, Boston, MA.
56. Minton, S. (1992). Minimizing conflicts: A heuristic repair method for constraint-satisfaction and scheduling problems. Artificial Intelligence, 55(1-3), 161-205.
57. Minton, S. (1996). Automatically configuring constraint satisfaction programs: A case study. Constraints, 1(1), 7-43.
58. Minton, S., Johnston, M. D., Philips, A. B., & Laird, P. (1990). Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method. In Proceedings of the Eighth National Conference on Artificial Intelligence, pp. 17-24 Boston, MA.
59. Muñoz-Avila, H. (1998). Integrating Twofold Case Retrieval and Complete Decision Replay in CAPlan/CbC. Ph.D. thesis, University of Kaiserslautern.
60. Nau, D. S., Gupta, S. K., & Regli, W. C. (1995). AI planning versus manufacturing-operation planning: A case study. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence Montreal, Canada.
61. Nebel, B., & Koehler, J. (1995). Plan reuse versus plan generation: A theoretical and empirical analysis. Artificial Intelligence, 76((1-2)), 427-454.
62. Ono, K., & Lohman, G. M. (1990). Measuring the complexity of join enumeration in query optimization. In McLeod, D., Sacks-Davis, R., & Schek, H.-J. (Eds.), 16th International Conference on Very Large Data Bases, pp. 314-325 Brisbane, Queensland, Australia. Morgan Kaufmann.
63. Papadimitriou, C. H., & Steiglitz, K. (1977). On the complexity of local search for the traveling salesman problem. SIAM, 6(1), 76-83.
64. Papadimitriou, C. H., & Steiglitz, K. (1982). Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, Englewood Cliffs, NJ.
65. Penberthy, J. S., & Weld, D. S. (1992). UCPOP: A sound, complete, partial order planner for ADL. In Third International Conference on Principles of Knowledge Representation and Reasoning, pp. 189-197 Cambridge, MA.
66. Pérez, M. A. (1996). Representing and learning quality-improving search control knowledge. In Proceedings of the Thirteenth International Conference on Machine Learning Bari, Italy.
67. Ratner, D., & Pohl, I. (1986). Joint and LPA*: Combination of approximation and search. In Proceedings of the Fifth National Conference on Artificial Intelligence Philadelphia, PA.
68. Rintanen, J. (2000). An iterative algorithm for synthesizing invariants. In Proceedings of the Seventeenth National Conference on Artificial Intelligence Austin, TX.
69. Russell, S., & Norvig, P. (1995). Artificial Intelligence: A Modern Approach. Prentice Hall.
70. Sacerdoti, E. D. (1975). The nonlinear nature of plans. In Proceedings of the Fourth International Joint Conference on Artificial Intelligence, pp. 206-214 Tbilisi, Georgia, USSR.
71. Savage, S., Weiner, P., & Bagchi, A. (1976). Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient. Journal of Computer and System Sciences, 12(1), 25-35.
72. Schürr, A. (1990). Introduction to PROGRES, an attribute graph grammar based specification language. In Nagl, M. (Ed.), Graph-Theoretic Concepts in Computer Science, Vol. 411 of Lecture Notes in Computer Science, pp. 151-165.
73. Schurr, A. (1997). Programmed graph replacement systems. In Rozenberg, G. (Ed.), Handbook on Graph Grammars: Foundations, Vol. 1, pp. 479-546. World Scientific, Singapore.
74. Sellis, T. K. (1988). Multiple-query optimization. ACM Transactions on Database Systems, 13(1), 23-52.
75. Selman, B., Levesque, H., & Mitchell, D. (1992). A new method for solving hard satisfiability problems. In Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), pp. 440-446 San Jose, California. AAAI Press.
76. Silberschatz, A., Korth, H. F., & Sudarshan, S. (1997). Database System Concepts (Third edition). McGraw-Hill.
77. Simon, H. (1969). The sciences of the artificial. MIT Press.
78. Slaney, J., & Thiébaux, S. (1996). Linear time near-optimal planning in the blocks world. In Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, pp. 1208-1214 Menlo Park. AAAI Press / MIT Press.
79. Sussman, G. J. (1975). A Computer Model of Skill Acquisition. American Elsevier, New York.
80. Veloso, M. (1994). Planning and Learning by Analogical Reasoning. Springer Verlag.
81. Veloso, M. M., Perez, M. A., & Carbonell, J. G. (1990). Nonlinear planning with parallel resource allocation. In Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control, pp. 207-212 San Diego, CA.
82. Weld, D. S. (1994). An introduction to least commitment planning. AI Magazine, 15(4).
83. Weld, D. S. (1999). Recent advances in AI planning. AI Magazine, 20(2).
84. Yu, C., & Chang, C. (1984). Distributed query processing. ACM Computing Surveys, 16(4), 399-433.
85. Zweben, M., Daun, B., & Deale, M. (1994). Scheduling and rescheduling with iterative repair. In Intelligent Scheduling, pp. 241-255. Morgan Kaufman, San Mateo, CA.