欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
分析了产品拆卸序列规划与约束满足问题的对应关系,在基于混合图的产品拆卸模型基础上,将产品拆卸序列规划转化为一类约束满足问题。以回溯算法为基础,给出了基于约束满足问题的产品拆卸序列规划求解流程和算法。通过一个简化的洗碗机门体实例说明了方法的可行性和有效性。
英文摘要：
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.
同期刊论文项目
同项目期刊论文
期刊信息
位置：