Hostname: page-component-78c5997874-t5tsf Total loading time: 0 Render date: 2024-11-05T03:23:15.843Z Has data issue: false hasContentIssue false

Temporal reasoning in process planning

Published online by Cambridge University Press:  01 April 1999

MIRA BALABAN
Affiliation:
Department of Industrial Engineering and Management, Ben-Gurion University, P.O.B. 653, Beer-Sheva 84105, Israel
DAN BRAHA
Affiliation:
Department of Industrial Engineering and Management, Ben-Gurion University, P.O.B. 653, Beer-Sheva 84105, Israel

Abstract

Computer-aided process planning has been recognized as an important tool for coordinating the different operations involved in making the product. While temporal knowledge is central to the design of efficient and reliable process plans, little attention is given to the integration of process planning and temporal processing and reasoning. To fill the void, we propose in this paper a practical approach, which is inspired by the framework of Temporal Constraint Satisfaction Problem (TCSP), to integrate process planning and temporal reasoning. We show that a TCSP formulation is a subset of a formulation using a reified temporal logic, and discuss the advantages of using such a restricted model. To reflect more realistic process planning encountered in real manufacturing environments, we present a model, called n-TCSP, which is a generalization of the TCSP framework. We envision the proposed temporal reasoning framework as one of the modules in the evolving new intelligent computer-aided process planning.

Type
Research Article
Copyright
© 1999 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

This work was supported in part by the Paul Ivanir Center for Robotics and Production Management at Ben-Gurion University of the Negev.