Recognizing machining features through partial constraint satisfaction

Research output: Contribution to journalConference articlepeer-review

3 Citations (Scopus)


Machining features are groupings of geometric and topological entities that have certain engineering significance. Recognizing these features from a designed parts is crucial in the automation of Computer Integrated Manufacturing (CIM). In this paper, the machining feature recognition problem is formulated as a partial constraint satisfaction problem (PCSP) where variables are the faces in the delta volume (the difference between a part and a stock), the possible feature classifications are values for the variables, and the constraints are the geometric and topological properties between the variables. Based this framework, several techniques can be applied to solve a PCSP. An integral method that combines extended forward checking, variable ordering, and value ordering is employed to solve the problem. Interacting features are then recognized by solving the PCSP and verifying the solution that partially satisfy all the constraints.

Original languageEnglish
Pages (from-to)1912-1917
Number of pages6
JournalProceedings of the IEEE International Conference on Systems, Man and Cybernetics
Publication statusPublished - 1997
EventProceedings of the 1997 IEEE International Conference on Systems, Man, and Cybernetics. Part 3 (of 5) - Orlando, FL, USA
Duration: 1997 Oct 121997 Oct 15

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Hardware and Architecture


Dive into the research topics of 'Recognizing machining features through partial constraint satisfaction'. Together they form a unique fingerprint.

Cite this