• Korean Journal of Computational Design and Engineering
• /
• v.6 no.4
• /
• pp.244-253
• /
• 2001

For more complete process planning, machining sequence determination is critical to attain machining economics. Although many studies have been conducted in recent years, most of them suggests the non-unique machining sequences. When the tool approach directions(TAD) are considered fur a feature, both machining time and number of setups can be reduced. Then, the unique machining sequence can be extracted from alternate(non-unique) sequences by minimizing the idle time between operations within a sequence. This study develops an algorithm to generate the best machining sequence for composite prismatic features in a vertical milling operation. The algorithm contains five steps to produce an unique sequence: a precedence relation matrix(PRM) development, tool approach direction determination, machining time calculation, alternate machining sequence generation, and finally, best machining sequence generation with idle times. As a result, the study shows that the algorithm is effective for a given composite feature and can be applicable fur other prismatic parts.

• Journal of Intelligence and Information Systems
• /
• v.2 no.1
• /
• pp.45-58
• /
• 1996

This paper describes an a, pp.oach to recognizing composite features of prismatic parts. AAG (Attribute Adjacency Graph) is adopted as the basis of describing basic feature, but it is extended to enhance the expressive power of AAG by adding face type, angles between faces and normal vectors. Our a, pp.oach is called Extended AAG (EAAG). To simplify the recognition procedure, feature classification tree is built using the graph types of EEA and the number of EAD's. Algorithms to find open faces and dimensions of features are exemplified and used in decomposing composite feature. The processing sequence of recognized features is automatically determined during the decomposition process of composite features.