برنامه ریزی فرآیند مبتنی بر محدودیت در ورق های فلزی خم
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|27001||2002||14 صفحه PDF||سفارش دهید||3327 کلمه|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : CIRP Annals - Manufacturing Technology, Volume 51, Issue 1, 2002, Pages 425–428
The majority of research dealing with computer-aided process planning of sheet metal bending approaches this problem as heuristic search. Since relevant engineering knowledge mostly consists of declarations that prohibit collisions and just a handful of generative rules, there are no useful means to drive these heuristics. In order to find a new way, we have made experiments with a constraint-based approach: using predefined constraint types and geometric constraint satisfaction, complex bending problems have been solved. By returning not just a single solution but a Pareto-optimal set of solutions (i.e., operation sequences, with appropriate part orientations and tools assigned) we have left the engineers freedom to apply further, not yet modeled parts of their domain knowledge.