An ASP based method for subassembly identification

Authors:
L. Z. Zhao;W. Z. Liao;Y. L. Fang;J. Y. Qian;C. W. Zeng
Affiliations:
School of Computer and Control, Guilin University of Electronic Technology, Guilin, China and State Key Laboratory of Software Engineering, Wuhan University, China;Department of Information Technology, Guangxi Teachers Education University, Nanning, China;School of Computer and Control, GUET, Guilin, China;School of Computer and Control, GUET, Guilin, China;School of Computer and Control, GUET, Guilin, China
Venue:
ROBIO'09 Proceedings of the 2009 international conference on Robotics and biomimetics
Year:
2009

Citing 5
Cited 0

Answer set programming and plan generation

Artificial Intelligence
A simplified and efficient representation for evaluation and selection of assembly sequences

Computers in Industry
The DLV system for knowledge representation and reasoning

ACM Transactions on Computational Logic (TOCL)
The symbolic OBDD scheme for generating mechanical assembly sequences

Formal Methods in System Design
Fast SAT-based answer set solver

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.