Graph Extraction for Assisting Crash Simulation Data Analysis

06/15/2023
by   Anahita Pakiman, et al.
0

In this work, we establish a method for abstracting information from Computer Aided Engineering (CAE) into graphs. Such graph representations of CAE data can improve design guidelines and support recommendation systems by enabling the comparison of simulations, highlighting unexplored experimental designs, and correlating different designs. We focus on the load-path in crashworthiness analysis, a complex sub-discipline in vehicle design. The load-path is the sequence of parts that absorb most of the energy caused by the impact. To detect the load-path, we generate a directed weighted graph from the CAE data. The vertices represent the vehicle's parts, and the edges are an abstraction of the connectivity of the parts. The edge direction follows the temporal occurrence of the collision, where the edge weights reflect aspects of the energy absorption. We introduce and assess three methods for graph extraction and an additional method for further updating each graph with the sequences of absorption. Based on longest-path calculations, we introduce an automated detection of the load-path, which we analyse for the different graph extraction methods and weights. Finally, we show how our method for the detection of load-paths helps in the classification and labelling of CAE simulations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/25/2022

Edge-coloured graph homomorphisms, paths, and duality

We present a edge-coloured analogue of the duality theorem for transitiv...
research
10/11/2018

Path matrix and path energy of graphs

Given a graph G, we associate a path matrix P whose (i, j) entry represe...
research
06/03/2023

Valid path-based graph vertex numbering

A labelling of a graph is an assignment of labels to its vertex or edge ...
research
12/31/2017

Reconstruction of the Path Graph

Let P be a set of n ≥ 5 points in convex position in the plane. The path...
research
05/10/2022

On equipathenergetic graphs and new bounds on path energy

The path eigenvalues of a graph G are the eigenvalues of its path matrix...
research
07/26/2019

Adventures in Abstraction: Reachability in Hierarchical Drawings

We present algorithms and experiments for the visualization of directed ...
research
08/15/2023

PKE-RRT: Efficient Multi-Goal Path Finding Algorithm Driven by Multi-Task Learning Model

Multi-goal path finding (MGPF) aims to find a closed and collision-free ...

Please sign up or login with your details

Forgot password? Click here to reset