中国机械工程 ›› 2010, Vol. 21 ›› Issue (17): 2058-2062.

• 机械基础工程 • 上一篇    下一篇

基于约束满足问题的产品拆卸序列规划

宋守许;胡迪;高洋;杨明;张雷
  

  1. 合肥工业大学,合肥,230009
  • 出版日期:2010-09-10 发布日期:2010-09-20
  • 基金资助:
    国家自然科学基金资助项目(50735006);国家科技重大专项(2008BAC46B01) 
    National Natural Science Foundation of China(No. 50735006);
    National Science and Technology Major Project ( No. 2008BAC46B01)

Product Disassembly Sequence Planning Based on Constraint Satisfaction Problems

Song Shouxu;Hu Di;Gao Yang;Yang Ming;Zhang Lei
  

  1. Hefei University of Technology, Hefei, 230009
  • Online:2010-09-10 Published:2010-09-20
  • Supported by:
     
    National Natural Science Foundation of China(No. 50735006);
    National Science and Technology Major Project ( No. 2008BAC46B01)

摘要:

分析了产品拆卸序列规划与约束满足问题的对应关系,在基于混合图的产品拆卸模型基础上,将产品拆卸序列规划转化为一类约束满足问题。以回溯算法为基础,给出了基于约束满足问题的产品拆卸序列规划求解流程和算法。通过一个简化的洗碗机门体实例说明了方法的可行性和有效性。

关键词:

Abstract:

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.

Key words: constraint satisfaction problem, hybrid graph, disassembly constraint graph, disassembly sequence planning, backtracking

中图分类号: