CBPOP: A domain-independent multi-case reuse planner

Computational Intelligence

Volumn 20, Issue 2, 2004, Pages 405-443

  Britanik, J ^a   Marefat, M ^a  

^a UNIVERSITY OF ARIZONA   (United States)

Author keywords

Case based planning; Domain independent planning; Multi reuse planning; Partial order planning

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION THEORY; INFORMATION RETRIEVAL; PROBLEM SOLVING; REUSABILITY;

CASE-BASED PLANNING; DOMAIN-INDEPENDENT PLANNING; MULTI-REUSE PLANNING; PARTIAL-ORDER PLANNING;

COMPUTATIONAL METHODS;

EID: 2442472125     PISSN: 08247935     EISSN: None     Source Type: Journal    
DOI: 10.1111/j.0824-7935.2004.00243.x     Document Type: Conference Paper

References (38)

1. BACCHUS, F., and F. KABANZA. 2000. Using temporal logics to express search control knowledge for planning. Artificial Intelligence, 116(1-2):123-191.
2. BRANTING, L. K., and B. W. PORTER. 1991. Rules and precedents as complementary warrants. In Ninth National Conference on Artificial Intelligence. Anaheim.
3. KARL BRANTFNG, L., and D. W. AHA. 1995. Stratified case-based reasoning: Reusing hierarchical problem solving episodes. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Montreal, Canada, Morgan Kaufmann, pp. 384-390.
4. BRITANIK, J. M. 2001. Enabling Mechanisms for Planning Knowledge Sharing, Merging, and Reuse. Ph. D. Thesis, University of Arizona, Department of Electrical and Computer Engineering.
5. EVETT, M. P., J. A. HENDLER, and L. SPECTOR. 1994. A system for massively parallel knowledge representation. Journal of Parallel and Distributed Computing, 22(2): 168-184.
6. FIKES, R. E., and N. J. NILSSON. 1971. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2:189-208.
7. FRANCIS, A., and A. RAM. 1993. Computational models of the utility problem and their application to a utility analysis of case-based reasoning. In Workshop on Knowledge Compilation and Speed-Up Learning. Amherst, MA.
8. FRANCIS, JR., A. G., and A. RAM. 1995. A domain-independent algorithm for multi-plan adaptation and merging in least-commitment planners. In AAAI Fall Symposium - Adaptation of Knowledge for Reuse. Cambridge, MA.
9. GOEL, A. K., K. S. ALI, M. W. DONNELLAN, ANDRES GOMEZ DE SILVA GARZA, and T. J. CALLANTINE. 1994. Multistrategy adaptive path planning. IEEE Expert, 9(6):57-65.
10. GUPTA, K. M., and A. R. MONTAZEMI. 1997. Empirical evaluation of retrieval in case-based reasoning systems using modified cosine matching function. IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 27(7):601-612.
11. HANKS, S., and D. S. WELD. 1991. Systematic adaptation for case-based planning: Algorithm description, formal properties, and empirical results. Technical Report 91-10-03, Department of Computer Science and Engineering, University of Washington.
12. HANKS, S., and D. S. WELD. 1992. The systematic plan adaptor: A formal foundation for case-based planning. Technical Report 92-09-04, Department of Computer Science and Engineering, University of Washington.
13. HANKS, S., and D. S. WELD. 1995. A domain-independent algorithm for plan adaptation. Journal of Artificial Intelligence Research, 2:319-360.
14. HINRICHS, T. R. 1992. Problem Solving in Open Worlds. Lawrence Erlbaum Associates, Hillsdale, NJ.
15. IHRIG, L. H. 1996. The Design and Implementation of a Case-Based Planning Framework within a Partial-Order Planner. Ph. D. Thesis, Arizona State University.
16. IHRIG, L., and S. KAMBHAMPATI. 1996. Design and implementation of a replay framework based on a partial order planner. In National Conference on Artificial Intelligence. Portland, Oregon.
17. IHRIG, L. H., and S. KAMBHAMPATI. 1997. Storing and indexing plan derivations through explanation-based analysis of retrieval failures. Journal of Artificial Intelligence Research, 7:161-198.
18. KAMBHAMPATI, S. 1993. On the utility of systematicity: Understanding tradeoffs between redundancy and commitment in partial-orderplanning. In International Joint Conference on Artificial Intelligence, pp. 1380-1385.
19. KAMBHAMPATI, S., and J. A. HENDLER. 1992. A validation-structure-based theory of plan modification and reuse. Artificial Intelligence, 55:193-258.
20. KETTLER, B. P. 1995. Case-Based Planning with a High-Performance Parallel Memory. Ph. D. Thesis, University of Maryland. Available as tech. report CS-TR-3561.
21. KOLODNER, J. 1993. Case-Based Reasoning. Morgan Kaufmann, San Mateo, CA.
22. MAREFAT, M., and J. BRITANIK. 1997. Plan reuse and plan merging in manufacturing process planning. Engineering Design and Automation, 3(1):49-77.
23. MCALLESTER, D., and D. ROSENBLITT. 1991. Systematic nonlinear planning. In National Conference on Artificial Intelligence, pp. 634-639.
24. MINTON, S., C. A. KNOBLOCK, D. R. KUOKKA, Y. GIL, R. L. JOSEPH, and J. G. CARBONELL. 1989. Prodigy 2.0: The manual and tutorial. Technical Report CMU-CS-89-146, School of Computer Science, Carnegie Mellon University.
25. MUNOZ-AVILA, H., J. HULLEN, and F. WEBERSKIRCH. 1997. A study on multiple and single case retrieval. In Ralph Bergmann and Wolfgang Wilke, editors, Proceedings of the Fifth German Workshop on CBR. Edited by R. Bergmann and W. Wilke. Bad Honnef, Germany.
26. NEBEL, B., and J. KOEHLER.1995. Plan reuse versus plan generation: A theoretical and empirical analysis. Artificial Intelligence, 76(1-2):427-454.
27. NGUYEN, X. L., and S. KAMBHAMPATI. 2001. Reviving partial order planning. In Proceedings of the Seventeen International Joint Conference on Artificial Intelligence, in press.
28. PEOT, M. A., and D. E. SMITH. 1993. Threat-removal strategies for partial-order planning. In Eleventh National Conference on Artificial Intelligence. AAAI.
29. RAM, A., and A. G. FRANCIS, JR. 1996. In Case-Based Reasoning. Experience, Lessons, & Future Directions, Chapter 10. AAAI Press, Menlo Park, CA, pp. 167-168.
30. REDMOND, M. 1990. Distributed cases for case-based reasoning; facilitating use of multiple cases. In National Conference on Artificial Intelligence. AAAI, pp. 304-309.
31. SMITH, D. E., and M. A. PEOT. 1993. Postponing threats in partial-order planning. In Eleventh National Conference on Artificial Intelligence. AAAI.
32. TANAKA, T., M. HATTORI, and N. SUEDA. 1992. Use of multiple cases in case-based design. In Proceedings of the IEEE International Conference on AI Applications, pp. 233-239.
33. VELOSO, M. M. 1989. Nonlinear problem solving using intelligent causal-commitment. Technical Report CMUCS-89-210, Carnegie Mellon, School of Computer Science.
34. VELOSO, M.M. 1994. In Planning and Learning by Analogical Reasoning. Springer-Verlag, New York.
35. VELOSO, M. M. 1997. Merge strategies for multiple case plan replay. In International Conference on Case Based Reasoning. Providence, RI.
36. WELD, D. S. 1994. An introduction to least commitment planning. AI Magazine, 15(4):27-61.
37. YANG, H., and W. F. LU. 1993. PROCASE: A prototype of intelligent case-based process planning system with simulation environment. In Proceedings of the ASME Computers in Engineering Conferenc. San Diego, CA, pp. 571-577.
38. YANG, Q. 1992. A theory of conflict resolution in planning. Artificial Intelligence, 58:361-392.