The reviewed record of science sign in
Pith

arxiv: 2607.06087 · v1 · pith:A7BE4L3U · submitted 2026-07-07 · cs.CE · cs.CG· cs.NA· cs.SY· eess.SY· math.NA

A Decomposition-Based Framework for Joint Optimization and Spatial Packaging of Interconnected Systems with Physical Interactions

Reviewed by Pithpith:A7BE4L3Uopen to challenge →

classification cs.CE cs.CGcs.NAcs.SYeess.SYmath.NA
keywords designoptimizationspi2system-levelapplicationcomponentcomputationalalignment
0
0 comments X
read the original abstract

This paper presents an approach and application of optimization of spatial packaging of interconnected systems with physical interactions (SPI2) in three-dimensional component placement problems. To enable its application for an automotive use case, SPI2 must support both initial design generation, including component alignment, and robust system-level coordination, requiring improved solution reliability and tractable computational cost. To address these requirements, the proposed methodology improves convergence rate and solution quality by enhancing numerical robustness in gradient-based optimization while reducing computational load. Existing SPI2 approaches are extended through the addition of alignment capabilities, enabling the representation of port-to-port alignments between components. Furthermore, the applicability of SPI2 is expanded by treating component placement locations as design variables, allowing for penalty-based coordination to ensure design feasibility and enabling integration within system-level optimization. The approach is validated using a multi-objective optimization framework based on Nondominated Sorting Genetic Algorithm II (NSGA-II), applied to a combined powertrain optimization and battery chassis integration problem. This demonstrates the effectiveness of the SPI2 in a system-level design context. The results show a twofold application of SPI2 in an automotive use case: first, as a tool for initial design generation, and second, as part of a system-level design coordinator that outperforms a discretized exhaustive search while requiring lower computational cost.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.