An ASP Based Method for Subassembly Identification
Subassembly identification is a key technique in mechanical assembly sequence planning (MASP). Declarative methods for MASP admit highly efficient and understandable problem description. This paper proposes an Answer Set Programming (ASP) based subassembly identification technique, which can be viewed as a part of the declarative solution to MASP. Given the liaison and interference relation of an assembly, all assembly knowledge and necessary constraints are produced automatically. It is shown that the space complexity of our representation method is polynomial. With the answer set solver DLV, feasible subassemblies could be generated. And thanks to the declarativeness of our approach, its representation efficiency and time efficiency can be improved separately.
L.Z. Zhao W.Z. Liao Y.L. Fang J.Y. Qian C.W. Zeng
School of Computer and Control,Guilin University of Electronic Technology (GUET),Guilin,541004 China Department of Information Technology,Guangxi Teachers Education University,Nanning,530023 China School of Computer and Control,GUET,Guilin,541004 China
国际会议
2009 IEEE International Conference on Robotics and Biomimetics(2009 IEEE 机器人与仿生技术国际会议 ROBIO 2009)
桂林
英文
1317-1322
2009-12-19（万方平台首次上网日期，不代表论文的发表时间）