This Article 
 Bibliographic References 
 Add to: 
A planning model with problem analysis and operator hierarchy
September 1988 (vol. 10 no. 5)
pp. 672,673,674,675
A planning model described in terms of its goal analysis and hierarchical operator representation is presented. With this system, successful plans have been made for nonlinear problems that are described as a conjunction of subgoals. The system uses heuristic rules to analyze the problem, and thus achieves an ordered sequence of subgoals and constraints that can be achieved successively without interfering with each other. The operators are designed in a goal-oriented fashion and are stored in operator hierarchies. During the plan generation phase, each subgoal is mapped into a goal operator, which is further refined to meet details and specific conditions of the problem. As the generation phase follows the analysis, conflicts among subgoals are eliminated implicitly.<>

[1] K. H. Chang, "A planning model with problem anlaysis and operator hierarchy," Ph.D. dissertation, Dep. Elec. Comput, Eng., Univ. Cincinnati, Cincinnati, OH, June 1986.
[2] P. R. Cohen and E. A. Feigenbaum,The Handbook of Artificial Intelligence, Vol. 3. Los Altos, CA: William Kaufmann, 1982, pp. 515-562.
[3] C. Dawson and L. Silklossly, "The role of preprocessing in problem solving system," inProc. IJCAI-5, 1977, pp. 465-471.
[4] R. E. Fikes and N. J. Nilsson, "STRIPS: A new approach to the applications of theorem proving to problem solving,"Artif. Intell., vol. 2, pp. 189-208, 1971.
[5] P. E. Friedland and Y. Iwasaki, "The concept and implementation of skeletal plans,"J. Automat. Reasoning, vol. 1, no. 2, pp. 161- 208, 1985.
[6] P. E. Friedland, "Knowledge-based experiment design in molecular genetics," Ph.D. disseration, Dep. Comput. Sci., Stanford Univ., Stanford, CA, 1979.
[7] B. Hayes-Roth and F. Hayes-Roth, "Modeling planning as an incremental opportunistic process," inProc, IJCAI-6, 1979, pp. 375-383.
[8] D. Kibler and P. Morris, "Don't be stupid," inProc. IJCAI-7, 1981, pp. 345-347.
[9] N. Nilsson,Principles of Artificial Intelligence. Palo Alto, CA: Tioga, 1980.
[10] E. D. Sacerdoti, "Planning in a hierarchy of abstraction space,"Artif. Intell., vol. 5, pp. 115-135, 1974.
[11] E. D. Sacerdoti, "The nonlinear nature of plan," inProc. IJCAI-4, 1975, pp. 206-214.
[12] M. J. Stefik, "Planning with constraints," Ph.D. dissertations, Dep. Comput. Sci., Stanford Univ., Stanford, CA, 1980.
[13] A. Tate, "Generating project networks," inProc. IJCAI-5, 1977, pp. 888-893.
[14] R. Wadingger, "Achieving several goals simultaneously," inReading in Artificial Intelligence. Palo Alto, CA: Tioga, 1981, pp. 250- 271.
[15] D. E. Wilkins, "Domain-independent planning: Representation and plan generation,"Artif Intell., vol. 22, pp. 269-301, 1984.

Index Terms:
problem solving,artificial intelligence,goal operator,artificial intelligence,problem solving,planning model,problem analysis,operator hierarchy,heuristic rules,plan generation,Strips,Protection,Problem-solving,Computer science,Path planning,Process planning,Genetics
"A planning model with problem analysis and operator hierarchy," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 10, no. 5, pp. 672,673,674,675, Sept. 1988, doi:10.1109/34.6775
Usage of this product signifies your acceptance of the Terms of Use.