Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-14T21:16:35.967Z Has data issue: false hasContentIssue false

Critical component detection in assemblies: a graph centrality approach

Published online by Cambridge University Press:  16 May 2024

Robert Ballantyne*
Affiliation:
University of Bristol, United Kingdom
Adam McClenaghan
Affiliation:
University of Bristol, United Kingdom
Oliver Schiffmann
Affiliation:
University of Bristol, United Kingdom
Chris Snider
Affiliation:
University of Bristol, United Kingdom

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This study examines the use of graph centrality to identify critical components in assembly models, a method typically dominated by computationally intense analyses. By applying centrality measures to simulated assembly graphs, components were ranked to assess their criticality. These rankings were compared against Monte Carlo sensitivity analysis results. Preliminary findings indicate a promising correlation, suggesting graph centrality as a valuable tool in assembly analysis, enhancing efficiency and insight in critical component identification.

Information

Type
Artificial Intelligence and Data-Driven Design
Creative Commons
Creative Common License - CCCreative Common License - BYCreative Common License - NCCreative Common License - ND
This is an Open Access article, distributed under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives licence (http://creativecommons.org/licenses/by-nc-nd/4.0/), which permits non-commercial re-use, distribution, and reproduction in any medium, provided the original work is unaltered and is properly cited. The written permission of Cambridge University Press must be obtained for commercial re-use or in order to create a derivative work.
Copyright
The Author(s), 2024.