Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > Automatic generation of disassembly sequences and exploded views from solidworks symbolic geometric relationships
Publication

Publications

Automatic generation of disassembly sequences and exploded views from solidworks symbolic geometric relationships

Title
Automatic generation of disassembly sequences and exploded views from solidworks symbolic geometric relationships
Type
Article in International Conference Proceedings Book
Year
2018
Authors
Germano Veiga
(Author)
FEUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Armando Jorge Sousa
(Author)
FEUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Eugénio Oliveira
(Author)
FEUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Thomas, U
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Indexing
Publicação em ISI Web of Science ISI Web of Science
Other information
Authenticus ID: P-00N-ZQJ
Abstract (EN): Planning the optimal assembly and disassembly sequence plays a critical role when optimizing the production, maintenance and recycling of products. For tackling this problem, a recursive branch-and-bound algorithm was developed for finding the optimal disassembly plan. It takes into consideration the traveling distance of a robotic end effector along with a cost penalty when it needs to be changed. The precedences and part decoupling directions are automatically computed in the proposed geometric reasoning engine by analyzing the spatial relationships present in SolidWorks assemblies. For accelerating the optimization process, a best-first search algorithm was implemented for quickly finding an initial disassembly sequence solution that is used as an upper bound for pruning most of the non-optimal tree branches. For speeding up the search further, a caching technique was developed for reusing feasible disassembly operations computed on previous search steps, reducing the computational time by more than 18%. As a final stage, our SolidWorks add-in generates an exploded view animation for allowing intuitive analysis of the best solution found. For testing our approach, the disassembly of two starter motors and a single cylinder engine was performed for assessing the capabilities and time requirements of our algorithms. © 2018 IEEE.
Language: English
Type (Professor's evaluation): Scientific
Documents
We could not find any documents associated to the publication.
Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-22 at 01:35:56 | Privacy Policy | Personal Data Protection Policy | Whistleblowing