Name
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 |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1109/IROS.2000.893228 | IROS 2000). Proceedings. 2000 IEEE/RSJ International Conference |
Keywords | Field | DocType |
computational complexity,production control,recycling,wave propagation,computational complexity,disassembly sequence,geometric selective disassembly,production control,wave propagation | Production control,Wave propagation,Polynomial,Computer science,Simulation,Intelligent robots,Control engineering,Computational science,Robot vision systems,Computational complexity theory | Conference |
Volume | ISBN | Citations |
2 | 0-7803-6348-5 | 6 |
PageRank | References | Authors |
0.84 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Miguel Ángel Garcia | 1 | 220 | 24.41 |
| Albert Larré | 2 | 6 | 0.84 |
| Beatriz López | 3 | 6 | 0.84 |
| Albert Oller | 4 | 8 | 1.65 |