摘要
分析了产品拆卸序列规划与约束满足问题的对应关系,在基于混合图的产品拆卸模型基础上,将产品拆卸序列规划转化为一类约束满足问题。以回溯算法为基础,给出了基于约束满足问题的产品拆卸序列规划求解流程和算法。通过一个简化的洗碗机门体实例说明了方法的可行性和有效性。
By analyzing the corresponding relationship between product disassembly sequence planning and constraint satisfaction problems,a product disassembly sequence planning was mapped into a constraint satisfaction problems based on product disassembly hybrid graph model.Then the processes and algorithms of the product disassembly sequence planning were given based on constraint satisfaction problems using backtracking algorithm.Finally,a simplified dishwasher door example was given to show the feasibility and effectiveness of the proposed method.
出处
《中国机械工程》
EI
CAS
CSCD
北大核心
2010年第17期2058-2062,共5页
China Mechanical Engineering
基金
国家自然科学基金资助项目(50735006)
国家科技重大专项(2008BAC46B01)
关键词
约束满足问题
混合图
拆卸约束图
拆卸序列规划
回溯算法
constraint satisfaction problem
hybrid graph
disassembly constraint graph
disassembly sequence planning
backtracking
