Research on selective disassembly sequence planning based on graph model

Dongmei Liu; Binfeng Lin; Yongfeng Li; Viacheslav Tarelnyk

doi:10.1117/12.3014520

9 January 2024 Research on selective disassembly sequence planning based on graph model

Dongmei Liu, Binfeng Lin, Yongfeng Li, Viacheslav Tarelnyk

Proceedings Volume 12969, International Conference on Algorithm, Imaging Processing, and Machine Vision (AIPMV 2023); 129691W (2024) https://doi.org/10.1117/12.3014520
Event: International Conference on Algorithm, Imaging Processing and Machine Vision (AIPMV 2023), 2023, Qingdao, China

Abstract

In order to solve the disassembly plan of the target parts in the product with high efficiency, a disassembly hybrid graph model of the target parts is proposed and established based on the disassembly connection relationship and disassembly priority constraint relationship between the parts in the product. The disassembly sequence planning problem of the target parts is transformed into a search and optimization problem for the path with the optimal value in the graph model. At the same time, the sorting algorithm is used to solve the mixed graph model of the target part disassembly, finally, an example is given the feasibility of this method has been verified.

(2024) Published by SPIE. Downloading of the abstract is permitted for personal use only.

Citation Download Citation

Dongmei Liu, Binfeng Lin, Yongfeng Li, and Viacheslav Tarelnyk "Research on selective disassembly sequence planning based on graph model", Proc. SPIE 12969, International Conference on Algorithm, Imaging Processing, and Machine Vision (AIPMV 2023), 129691W (9 January 2024); https://doi.org/10.1117/12.3014520

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available