Development of a heuristic Process Planning Tool for Sequencing NC Machining Operations extended by the Potential Field Analysis

详细信息    查看全文

• 作者：Ulrich Berger^* ; ^{Ulrich.Berger@tu-cottbus.de" class="auth_mail" title="E-mail the corresponding author} ; Ralf Kretzschmann^* ; ^{Ralf.Kretzschmann@tu-cottbus.de" class="auth_mail" title="E-mail the corresponding author} ; Algebra Veronica Vargas Aparicio^* ; ^{vargaalg@tu-cottbus.de" class="auth_mail" title="E-mail the corresponding author} ; Matthias Reichenbach^** ; ^{Matthias.Reichenbach@daimler.com" class="auth_mail" title="E-mail the corresponding author} ; Michael Zü ; rn^** ; ^{Zurn.Michael@daimler.com" class="auth_mail" title="E-mail the corresponding author}
• 关键词：CAD/CAM ; CNC ; Machining Process Planning ; Graph Theory ; Potential Field Analysis
• 刊名：IFAC-PapersOnLine
• 出版年：2009
• 出版时间：2009
• 年：2009
• 卷：42
• 期：4
• 页码：1221-1226
• 全文大小：1069 K

文摘

Nowadays, the process planning for sequencing NC (numerical control) machining operations is still done manually in principle. In the last decade several approaches for the automatic process planning based on artificial intelligence (AI) and heuristic algorithm are introduced. Nevertheless, the planner has to modify and acknowledge the generated work plans. In order to close this gap, a concept for enabling the automatic preparation for feature-based work plans with methods known from the graph theory is introduced in this paper. Therefore the work plan is mapped into a direct graph. As a result, it is possible to use algorithms to find the shortest path and a Hamiltonian path as an optimal sequenced solution. The potential field analysis will be used in order to compare the generated work plans. Therefore a workflow including knowledge representation, knowledge processing and an algorithm for computing the process plans are outlined. A demonstrator completes this paper.