A trajectory-based sampling strategy for sequentially refined metamodel management of metamodel-based dynamic optimization in mechatronics

Dynamic optimization problems based on computationally expensive models that embody the dynamics of a mechatronic system can result in prohibitively long optimization runs. When facing optimization problems with static models, reduction in the computational time and thus attaining convergence can be established by means of a metamodel placed within a metamodel management scheme. This paper proposes a metamodel management scheme with a dedicated sampling strategy when using computationally demanding dynamic models in a dynamic optimization problem context. The dedicated sampling strategy enables to attain dynamically feasible solutions where the metamodel is locally refined during the optimization process upon satisfying a feasibility-based stopping condition. The samples are distributed along the iterate trajectories of the sequential direct dynamic optimization procedure. Algorithmic implementation of the trajectory-based metamodel management is detailed and applied on two case studies involving dynamic optimization problems. These numerical experiments illustrate the benefits of the presented scheme and its sampling strategy on the convergence properties. It is shown that the acceleration of the solution time of the dynamic optimization problem can be achieved when evaluating the metamodel that is lower than 90% compared to the computationally expensive model.Dynamic optimization problems based on computationally expensive models that embody the dynamics of a mechatronic system can result in prohibitively long optimization runs. When facing optimization problems with static models, reduction in the computational time and thus attaining convergence can be established by means of a metamodel placed within a metamodel management scheme. This paper proposes a metamodel management scheme with a dedicated sampling strategy when using computationally demanding dynamic models in a dynamic optimization problem context. The dedicated sampling strategy enables to attain dynamically feasible solutions where the metamodel is locally refined during the optimization process upon satisfying a feasibility-based stopping condition. The samples are distributed along the iterate trajectories of the sequential direct dynamic optimization procedure. Algorithmic implementation of the trajectory-based metamodel management is detailed and applied on two case studies involving dynamic optimization problems. These numerical experiments illustrate the benefits of the presented scheme and its sampling strategy on the convergence properties. It is shown that the acceleration of the solution time of the dynamic optimization problem can be achieved when evaluating the metamodel that is lower than 90% compared to the computationally expensive model.A