Robotic disassembly re-planning using a two-pointer detection strategy and a super-fast bees algorithm

Abstract

Link to publication on Research at Birmingham portal General rightsUnless a licence is specified above, all rights (including copyright and moral rights) in this document are retained by the authors and/or the copyright holders. The express permission of the copyright holder must be obtained for any use of this material other than for purposes permitted by law.• Users may freely distribute the URL that is used to identify this publication.• Users may download and/or print one copy of the publication from the University of Birmingham research portal for the purpose of private study or non-commercial research.• User may use extracts from the document in line with the concept of 'fair dealing' under the Copyright, Designs and Patents Act 1988 (?) • Users may not further distribute the material nor use it for the purposes of commercial gain.Where a licence is displayed above, please note the terms and conditions of the licence govern your use of this document.When citing, please reference the published version. Take down policyWhile the University of Birmingham exercises care and attention in making items available there are rare occasions when an item has been uploaded in error or has been deemed to be commercially or otherwise sensitive.

Electric Vehicle Battery Disassembly Sequence Planning Based on Frame-Subgroup Structure Combined with Genetic Algorithm

“…And a CNC machine tool example is given to illustrate the proposed models and the effectiveness of the proposed algorithm. Laili et al (2019) proposed a ternary bees algorithm to identify new disassembly sequences and directions. The algorithm combines the merits of a greedy search and meta-heuristic techniques.…”

An Improved Vantage Point Bees Algorithm to Solve Combinatorial Optimization Problems from TSPLIB

“…During last years, many researchers focused on developing algorithms to find a good solution to these problems in fast times. Pham, in 2005, proposed the Bees Algorithm (BA), [ 2,3 ] which has been applied to several Combinatorial Optimisation Problems (COP), such as the job scheduling, [ 4 ] disassembly sequence planning, [ 5,6 ] vehicle routing problem, and others. [ 7 ] Despite the existing studies, new methods are still needed to increase the accuracy and speed of the proposed algorithms, and for a fair comparison of the previous methods, more experiments with different data sets should be done.…”

“…Several modifications of BA have been proposed in recent years to improve its capacity of solving COP [ 4,5,7–9,6 ] also for TSP problems. In 2015, Zeybek proposed a Vantage Point (VP) strategy in the BA local search strategy (called VPBA), [ 10 ] in which a Vantage Point Tree (VPT) was used as a selection procedure from metric space elements.…”

Peg–hole disassembly using active compliance

“…A critical step in remanufacturing is the disassembly of the returned product, which is normally manually executed and can be labour intensive due to its complexity [4]. Disassembly using robots can improve the efficiency of the process [5,6].…”