SearcharxivSearch

arXiv subjects

Anthony Sirico Jr.

Publications and source records attributed to Anthony Sirico Jr..

2 recordsLinked to original sources

Iterative Classification of Graph-Set-Based Designs (IC-GSBD) for the Down-Selection of Aircraft Thermal Management Systems

In this paper, we present Iterative Classification of Graph-Set-Based Design (IC-GSBD), a framework utilizing graph-based techniques with geometric deep learning (GDL) integrated within a set-based design (SBD) approach for the classification and down-selection complex engineering systems represented by graphs. We demonstrate this approach on aircraft thermal management systems (TMSs) utilizing previous datasets created using an enumeration or brute-force graph generation procedure to represent novel aircraft TMSs as graphs. However, as with many enumerative approaches, combinatorial explosion limits its efficacy in many real-world problems, particularly when simulations and optimization must be performed on the many (automatically-generated) physics models. Therefore, the approach uses the directed graphs representing aircraft TMSs and GDL to predict on a subset of the graph-based dataset through graph classification. This paper's findings demonstrate that incorporating additional graph-based features using principle component analysis (PCA) enhances GDL model performance, achieving an accuracy of 98% for determining a graph's compilability and simulatability while using only 5% of the data for training. By applying iterative classification methods, we also successfully segmented the total set of graphs into more specific groups with an average inclusion of 75.5 of the top 100 highest-performing graphs, achieved by training on 40% of the data.

cs.CE

On the Use of Geometric Deep Learning for the Iterative Classification and Down-Selection of Analog Electric Circuits

Many complex engineering systems can be represented in a topological form, such as graphs. This paper utilizes a machine learning technique called Geometric Deep Learning (GDL) to aid designers with challenging, graph-centric design problems. The strategy presented here is to take the graph data and apply GDL to seek the best realizable performing solution effectively and efficiently with lower computational costs. This case study used here is the synthesis of analog electrical circuits that attempt to match a specific frequency response within a particular frequency range. Previous studies utilized an enumeration technique to generate 43,249 unique undirected graphs presenting valid potential circuits. Unfortunately, determining the sizing and performance of many circuits can be too expensive. To reduce computational costs with a quantified trade-off in accuracy, the fraction of the circuit graphs and their performance are used as input data to a classification-focused GDL model. Then, the GDL model can be used to predict the remainder cheaply, thus, aiding decision-makers in the search for the best graph solutions. The results discussed in this paper show that additional graph-based features are useful, favorable total set classification accuracy of 80\% in using only 10\% of the graphs, and iteratively-built GDL models can further subdivide the graphs into targeted groups with medians significantly closer to the best and containing 88.2 of the top 100 best-performing graphs on average using 25\% of the graphs.

cs.CE