Robust Design Optimization of Dual Thrust Solid Propellant Motors due to Burning Rate Uncertainties

Solid rocket motor design becomes a clamant task where fusion of design and non‐design parameters may lead to various design configurations, especially under uncertainties. This paper proposes a robust design optimization method for the performance of a dual thrust solid rocket motor under investiga...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Propellants, explosives, pyrotechnics explosives, pyrotechnics, 2012-08, Vol.37 (4), p.476-488
Hauptverfasser: Aamir Raza, Muhammad, Liang, Wang
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Solid rocket motor design becomes a clamant task where fusion of design and non‐design parameters may lead to various design configurations, especially under uncertainties. This paper proposes a robust design optimization method for the performance of a dual thrust solid rocket motor under investigation of the propellant burning rate and grain geometry uncertainties. It was found that due to uncertainties, the burning rate varies erratically during burning surface area regression, which may lead to catastrophic failure. The present approach aims at uncertainty quantification associated with burning rate and its influence on dual thrust motor performance. A first‐order orthogonal design is applied to estimate the worst case deviation coupled with motor internal ballistics. The robustness assessment is measured directly by a mean‐variance and average difference approach. A sensitivity analysis of performance parameters is performed to analyze the effects of variation of the design parameters. A hybrid genetic algorithm and simulated annealing approach is used as optimizer. The robust design solution obtained in the form of insensitive design and performance parameters shows the effectiveness and efficiency of the proposed methodology.
ISSN:0721-3115
1521-4087
DOI:10.1002/prep.201100060