Abstract

System design is a challenging and time-consuming task which often requires close collaboration between several multidisciplinary design teams to account for complex interactions between components and sub-systems. As such, there is a growing demand in industry to create better performing, efficient, and cost-effective development tools to assist in the system design process. Additionally, the ever-increasing complexity of systems today often necessitates a shift away from manual expertise and a movement towards computer-aided design tools. This work narrows the scope of the system design process by focusing on one critical design aspect: the packaging of system components. The algorithm presented in this paper was developed to optimize the packaging of system components with consideration of practical, system-level functionalities and constraints. Using a dynamic acceleration methodology, the algorithm packages components from an initial position to a final packed position inside of a constrained volume. The motion of components from initial to final positions is driven by several acceleration forces imposed on each component. These accelerations are based on physical interactions between components and their surrounding environment. Various system-level performance metrics such as center of mass alignment and rotational inertia reduction are also considered throughout optimization. Results of several numerical case studies are also presented to demonstrate the functionality and capability of the proposed packaging algorithm. These studies include packaging problems with known optimal solutions to verify the efficacy of the algorithm. Finally, the proposed algorithm was used in a more practical study for the packaging of an urban air mobility nacelle to demonstrate the algorithm’s prospective capabilities in solving real-world packaging problems.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call