Decentralized Multisubsystem Co-Design Optimization Using Direct Collocation and Decomposition-Based Methods
Multisubsystem co-design refers to the simultaneous optimization of physical plant and controller of a system decomposed into multiple interconnected subsystems. In this paper, two decentralized (multilevel and bilevel) approaches are formulated to solve multisubsystem co-design problems, which are...
Gespeichert in:
Veröffentlicht in: | Journal of mechanical design (1990) 2020-09, Vol.142 (9) |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Multisubsystem co-design refers to the simultaneous optimization of physical plant and controller of a system decomposed into multiple interconnected subsystems. In this paper, two decentralized (multilevel and bilevel) approaches are formulated to solve multisubsystem co-design problems, which are based on the direct collocation and decomposition-based optimization methods. In the multilevel approach, the problem is decomposed into two bilevel optimization problems, one for the physical plant and the other for the control part. In the bilevel approach, the problem is decomposed into subsystem optimization subproblems, with each subproblem having the optimization model for physical plant and control parts together. In both cases, the entire time horizon is discretized to convert the continuous optimal control problem into a finite-dimensional nonlinear program. The optimality condition decomposition method is employed to solve the converted problem in a decentralized manner. Using the proposed approaches, it is possible to obtain an optimal solution for more generalized multisubsystem co-design problems than was previously possible, including those with nonlinear dynamic constraints. The proposed approaches are applied to a numerical and engineering example. For both examples, the solutions obtained by the decentralized approaches are compared with a centralized (all-at-once) approach. Finally, a scalable version of the engineering example is solved to demonstrate that using a simulated parallelization with and without communication delays, the computational time of the proposed decentralized approaches can outperform a centralized approach as the size of the problem increases. |
---|---|
ISSN: | 1050-0472 1528-9001 |
DOI: | 10.1115/1.4046438 |