DocumentCode :
1739828
Title :
Reducing the complexity of geometric selective disassembly
Author :
García, Miguel Angel ; Larré, Albert ; López, Beatriz ; Oller, Albert
Author_Institution :
Intelligent Robotics & Comput. Vision Group, Rovira i Virgili Univ., Tarragona, Spain
Volume :
2
fYear :
2000
fDate :
2000
Firstpage :
1474
Abstract :
This paper presents an efficient technique for determining a low-cost disassembly sequence suitable to extract a subset of s components from an assembly containing n components, e of which are exterior (e≪n). The most efficient solution to this so-called geometric selective disassembly problem is the wave propagation algorithm, which is reported to have a computational complexity of O(sn 2). Instead, the complexity of the proposed algorithm is O(enlogn) when s≪n, and O(sn) when s≃n. Experimental results with synthetic 3D assemblies are presented
Keywords :
computational complexity; production control; recycling; wave propagation; computational complexity; disassembly sequence; geometric selective disassembly; production control; wave propagation; Assembly; Computational complexity; Computer vision; Costs; Fasteners; Intelligent robots; Polynomials; Recycling; Robot vision systems; Robotics and automation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Robots and Systems, 2000. (IROS 2000). Proceedings. 2000 IEEE/RSJ International Conference on
Conference_Location :
Takamatsu
Print_ISBN :
0-7803-6348-5
Type :
conf
DOI :
10.1109/IROS.2000.893228
Filename :
893228
Link To Document :
بازگشت