Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
