Hierarchically merging plans in decomposable domains

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans.

Volumn 29, Issue 1, 1999, Pages 27-40

  Britanik, John M ^a,b   Marefat, Michael M ^a,b  

^a IEEE   (United States)

^b University of Arizona   (United States)

Author keywords

Plan merging; Planning

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; PROBLEM SOLVING;

DECOMPOSABLE DOMAIN; PLAN MERGING;

OPTIMIZATION;

EID: 0032714848     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/3468.736358     Document Type: Article

References (17)

1. C. C. Hayes, "A model of planning for plan efficiency: Taking advantage of operator overlap," in Int. Joint Conf. Artificial Intelligence. San Mateo, CA: Morgan-Kaufmann, 1989, pp. 949-953.
2. R. Karinthi, D. Nau, and Q. Yang, "Handling feature interactions in process-planning," Appl. Artif. Intell., vol. 6, pp. 389-415, 1992.
3. Q. Yang, D. S. Nau, and J. Hendler, "Merging separately generated plans with restricted interactions," Comput. Intell., vol. 8, no. 4, pp. 648-676, 1992.
4. M. Marefat and J. Britanik, "Case-based process planning using an object-oriented model representation," Robot. Comput.-Integr. Manufact., vol. 13, no. 3, pp. 229-251, 1997.
5. E. D. Sacerdoti, A Structure of Plans and Behavior. New York: Elsevier, 1977.
6. R. Wilensky, Planning and Understanding. Reading, MA: Addison-Wesley, 1983.
7. A. Tate, "Generating project networks," in Int. Joint Conf. Artificial Intelligence. San Mateo, CA: Morgan-Kaufmann, 1977, pp. 888-893.
8. D. E. Wilkins, Practical Planning. San Mateo, CA: Morgan-Kaufman, 1988.
9. S. Kambhampati and J. A. Hendler, "A validation-structure-based theory of plan modification and reuse," Artif. Intell., vol. 55, pp. 193-258, 1992.
10. D. E. Foulser, M. Li, and Q. Yang, "Theory and algorithms for plan merging," Artif. Intell., vol. 57, pp. 143-181, 1992.
11. D. S. Weld, "An introduction to least commitment planning," AI Mag., vol. 15, pp. 27-61, Winter 1994.
12. D. Chapman, "Planning for conjunctive goals," Artif. Intell., vol. 32, pp. 333-377, 1987.
13. T. Bylander, "The computational complexity of propositional strips planning," Artif. Intell., vol. 69, pp. 165-204, 1994.
14. N. Gupta and D. S. Nau, "Complexity results for blocks-world planning," in Proc. Nat. Conf. Artificial Intelligence. Menlo Park, CA: AAAI, 1991, pp. 629-633.
15. J. Britanik, "Hierarchical plan merging in decomposable domains," Tech. Rep., Intelligent Syst. Lab., Dept. Elect. Comput. Eng., Univ. Arizona, Tucson, 1997.
16. M. Mantyla and J. Opas, "HUTCAPP - A machining operations planner," in Robotics Manufacturing, Nov. 1988, ASME, New York, pp. 901-910.
17. E. M. Reingold, J. Nievergelt, and N. Deo, Combinatorial Algorithms: Theory and Practice. Englewood Cliffs, NJ: Prentice-Hall, 1977, ch. 8, sec. 8.3.2.