SearcharxivSearch

arXiv · 2510.08582

Physics-Structured Surrogate Modeling and Conformal Robust Multipoint Optimization for Glider Wing Design

Abstract

Aerodynamic design using surrogate assistance can lower the cost of concept design. Point accuracy, however, is not enough to ensure that the optimizer does not exploit any part of space which is uncertain or with low confidence. In this work we develop a locked physics-structured surrogate and robust multi-point framework for the early-stage design of glider wings. The framework utilizes a dataset of 150,000 Tornado vortex lattice simulations, which provides 16 continuous targets for the aerodynamics, root loads, and flight dynamics. A five-member dual-head ensemble distinguishes between similarity-based aerodynamic inputs and the physical structure required for dimensional dynamics, while exact decoder recovers dimensional forces and root-load proxy values. Split-conformal prediction gives simultaneous intervals for the 14 optimization outputs, while at the same time a nearest-neighbor support score limits the extrapolation. The in-distribution test resulted in a mean NRMSE of 0.0223, while the structured out-of-distribution test resulted in 0.0595. The global joint 95% intervals covered 94.71% of points in distribution and support conditioned calibration gave 91.08% coverage under structured shift. Three-speed search examined 16,384 geometries and kept 2,998 feasible designs, 198 of which are nondominated designs. After freezing 20 wings, 60 Tornado simulations were conducted. The 60 simulations resulted in a mean NRMSE of 0.0228, coverage for 58 of 60 operating points, and hard feasibility success for all 60. For all 20 wings, all three objective upper bounds are conservative. The primary contribution of this paper is the combination of structured multi-output learning, simultaneous calibration, support aware robust Pareto search and locked post-selection simulations.

Explore related subjects

Keep this discovery

BibTeXRIS

Arash Fath Lipaei, AmirHossein Ghaemi, Melika Sabzikari. 2025-09-29. Physics-Structured Surrogate Modeling and Conformal Robust Multipoint Optimization for Glider Wing Design. https://arxiv.org/abs/2510.08582

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Breaking the Central Bias: Spatially Partitioned Experts for Coordinate-Based Neuroevolution

Evolvable-Substrate HyperNEAT (ES-HyperNEAT), a bio-inspired indirect encoding that determines neuron placement and connection weights from spatial coordinates, exhibits a failure mode on MNIST as a diagnostic benchmark. Because input pixels map to a coordinate space centered at the origin, evolved networks converge on a small central cluster of input pixels, a spatial-concentration bias; prior work observed only 21% mean accuracy in this regime. Is this bias an optimization artifact or an architectural ceiling? Inspired by Mixture-of-Experts (MoE) principles, we partition the input into non-overlapping spatial segments, each assigned to a separately evolved specialist network. With 13 such experts, this design reaches 43% mean accuracy, a 106% relative improvement over the baseline. The architectural gain does not depend on data-driven aggregation: equal-weighted averaging, which uses no validation data, already yields a 70% improvement; the gain comes from partitioning, not the weighting. Receptive-field analysis shows the mechanism: partitioning forces evolution to discover features across the entire image, expanding active pixel coverage from 4% to 79%. Absolute accuracy stays below gradient-trained baselines, but the relative gain points to central bias, not the evolutionary search. Two tools are designed to generalize beyond MNIST: a receptive-field diagnostic for silent input-coverage collapse, and a spatial-partitioning remedy that restores coverage.

cs.NE

A Bio-Plausible Visual Neural Network for Locust-Inspired Collision Perception

Locust visual systems have long served as an important biological paradigm for studying looming perception and collision avoidance. Numerous computational models have successfully reproduced the selective responses of Lobula Giant Movement Detector (LGMD) neurons to approaching objects, thereby emulating the fundamental functionality of the biological system. However, existing models remain limited in biological plausibility and robustness when operating in complex and dynamic visual environments. To address these limitations, we propose a biologically plausible neural network for locust-inspired looming detection. The proposed framework incorporates a spatially isotropic sampling strategy that mimics the ommatidial organization of the locust compound eye, a population-voting mechanism inspired by population coding in biological neural systems, and leaky integrate-and-fire neuronal dynamics to replace conventional sigmoid-based membrane activation. Systematic experiments on synthetic stimuli, laboratory sequences, and real-world driving scenarios demonstrate that the proposed model improves robustness under challenging visual conditions while preserving computational efficiency and enhancing biological fidelity. These results highlight the potential of biologically grounded neural computation for robust and efficient collision perception.

cs.NE

Structural Fusion of Bayesian Networks with Limited Treewidth Using Genetic Algorithms

This paper introduces an evolutionary computation approach for consensus in structural Bayesian Network (BN) fusion under the constraint of limited treewidth. The consensus BN aims to reconcile multiple input BNs into a single one that retains key structural features present in the original networks. Treewidth, a graph-based parameter associated with computationally tractable inference, is utilized to restrict the complexity of the resulting network. A genetic algorithm is proposed to look for a BN that codifies as much information about the unrestricted fusion as possible while ensuring the treewidth restriction. Experimental evaluation demonstrates the genetic algorithm's ability to obtain consensus BNs with limited treewidth, providing a valuable tool for aggregating information from diverse sources while returning a computationally actionable model.

cs.NE