Abstract
In our previous paper, we have shown that case-based reasoning (CBR) techniques can be used as a viable formulation for solving assembly sequence generation problems. The issues covered in that paper were case base organization, case selection and matching, and case indexing. The part on case adaptation was not addressed in a formal way to allow satisfactory generalization of the method to a large class of assembly planning problems. We present in this paper a methodology which formalizes the adaptation process of CBR using constraint satisfaction techniques. Combining CBR with constraint satisfaction provides a generalized formalism for assembly planning problem solving.
Sign-in/Register to access full text options 
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.
