Quasi-trivial stacking sequences for the design of thick laminates

Abstract

Quasi-trivial (QT) sequences have largely proven to be an extremely powerful tool in the design and optimisation of composites laminates. In this paper new interesting properties of this class of stacks are derived. These properties allow to obtain QT sequences by superposing (according to some prescribed rules) any number of QT elementary stacks. In this way, QT solutions with arbitrary large number of plies can be readily obtained, overcoming the computational issues arising in the search of QT solutions with huge number of layers. Moreover, a general version of the combinatorial algorithm to find QT stacks is proposed in this work. It is also proven that the previous estimation of the number of QT solutions, for a given number of plies and saturated groups, is not correct because a larger number of solutions has been found in this study.