Skip to main content
×
×
Home

Intelligently helping the human planner in industrial process planning

  • A. Famili (a1) and P. Turney (a1)
Abstract

The function of a process planning system is to determine the methods by which a product is to be manufactured economically and competitively. In a modern manufacturing environment, a process planning system consists of highly trained people and complex software. The plans prepared by a process planning system are not always executed as planned. It is useful if the system can discover why plans fail, when they do fail. In order to learn why plans fail, the system must analyse a number of plans, both successful and unsuccessful, to find patterns in the failures of plans. This type of analysis is difficult for people, who are much better at analysing single events than multiple events.

The aim of the project described here is to design and implement a computer program which will help human planners in a process planning system to understand why plans fail. To achieve this aim, a program called IMAFO (Intelligent MAnufacturing FOreman) has been developed. IMAFO uses decision tree induction to analyse examples of both successful and unsuccessful plans.

The difficulties presented by this application are discussed and solutions are presented. Problems addressed include finding an appropriate set of attributes for describing the plans, using data efficiently, consolidating input from distinct sources, and presenting decision trees in an understandable form. Potential applications and directions for future research are considered.

Copyright
References
Hide All
Albus J., Barbera B. and Nagel R. 1981. Theory and practice of hierarchical control. Proceedings of the 23rd IEEE Computer Society International Conference, pp. 1839. New York, N.Y.: IEEE Computer Society.
Albus J. et al. 1984. A control system for an automated manufacturing research facility. Proceedings of Robots 8 Conference and Exposition, Section 13, pp. 2844. Detroit, MI:
Bratko I. and Kononenko I. 1986. Learning diagnostic rules from incomplete and noisy data. In AI Methods in Statistics. London: UNICOM Seminar.
Bratko I., Mozetic I., and Lavrac N. 1988. Automatic synthesis and compression of cardiological knowledge. In Hayes J. E., Michie D. and Richards J., eds. Machine Intelligence 11. Oxford: Clarendon Press.
Breiman L., Freidman J., Olshen R. and Stone C. 1984. Classification and Regression Trees. Belmont, CA: Wadsworth.
Carbonell J. G. 1989. Introduction: paradigms for machine learning. Artificial Intelligence 40, 19.
Flann N. S. and Dietterich T. G. 1989. A study of explanation-based methods for inductive learning. Machine Learning 4(2), 187226.
Holte R. C., Acker L. E. and Porter B. W. 1989. Concept learning and the problem of small disjuncts. Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pp. 813818. Los Altos, CA: Morgan Kaufmann.
Kahneman D., Slovic P. and Tversky A., eds. 1982. Judgement Under Uncertainty: Heuristics and Biases. Cambridge: Cambridge University Press.
McLean C. R. 1986. Information architecture of the automated manufacturing research facility. Proceedings of the Information Technologies for Manufacturing Conference. Troy, NY: Rensselaer Polytechnic Institute.
Michalski R. S. 1986. Understanding of the nature of learning: issues and research directions. In Carbonell J. G., Michalski R. S. & Mitchell T. M., eds, Machine Learning: An Artificial Intelligence Approach, Vol. II, Los Altos, CA: Morgan Kaufmann.
Mingers J. 1987. Expert systems—rule induction with statistical data. Journal of the Operational Research Society 38(1), 3947.
Mingers J. 1989 a. An empirical comparison of selection measures for decision-tree induction. Machine Learning 3(4), 319342.
Mingers J. 1989 b. An empirical comparison of pruning methods for decision tree induction. Machine Learning 4(2), 227243.
Mooney R., Shavlik J., Towell G. & Gove A., 1989. An experimental comparison of symbolic and connectionist learning algorithms. Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pp. 775780. Los Altos, CA: Morgan Kaufmann.
Niblett T. and Bratko I. 1986. Learning decision rules in noisy domains. In Bramer M. A. ed. Research and Development in Expert Systems, III. Cambridge: Cambridge University Press.
Quinlan J. R. 1983. Learning efficient classification procedures and their application to chess end games. In Carbonell J. G., Michalski R. S. and Mitchell T. M., eds. Machine Learning: An Artificial Intelligence Approach, Vol. I, pp. 463482. Los Altos, CA: Morgan Kaufmann.
Quinlan J. R. 1986 a. The effect of noise on concept learning. In Carbonell J. G., Michalski R. S. and Mitchell T. M. eds. Machine Learning: An Artificial Intelligence Approach, Vol. II, pp. 149166. Los Altos, CA: Morgan Kaufmann.
Quinlan J. R. 1986 b. Induction of decision trees. Machine Learning 1(1), 81106.
Quinlan J. R. 1987 a. Simplifying decision trees. International Journal of Man-Machine Studies, 27, 221234.
Quinlan J. R. 1987 b. Generating production rules from decision trees. Proceedings of the Tenth International Joint Conference on Artificial Intelligence, pp. 304307. Los Altos, CA: Morgan Kaufmann.
Stirling D. and Buntine W. 1988. Process routings in a steel mill: a challenging induction problem. In Gero J. S. and Stanton R. eds. Artificial Intelligence Development and Applications, pp. 301313. Amsterdam: Elsevier.
Wilkins D. E. 1988. Practical Planning: Extending the Classical AI Planning Paradigm. Los Altos, CA: Morgan Kaufmann.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

AI EDAM
  • ISSN: 0890-0604
  • EISSN: 1469-1760
  • URL: /core/journals/ai-edam
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 11 *
Loading metrics...

Abstract views

Total abstract views: 98 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 22nd January 2018. This data will be updated every 24 hours.