Selective laser melting (SLM) is an additive manufacturing (AM) technique designed to use a high energy density laser to fuse metallic powders for producing three-dimensional parts. So far, most studies of SLM have been focused on using virgin metal powders. There are few comprehensive studies on the microstructure and mechanical properties of SLM-produced parts using recycled powders, especially for maraging steels. In this study, we employ recycled steel powder (reused after 113 building cycles) in the SLM process to print multiple shaped components and systematically characterize the microstructure and mechanical properties (indentation, tensile, and Charpy testing). Our results show that maraging steel produced with recycled powder exhibit the nearly identical microstructure and mechanical properties (940 MPa yield strength, 1127 MPa ultimate tensile strength, 11 pct elongation, and 47.5 J room temperature impact fracture energy) to those produced using virgin powders. This study provides a useful generic guide towards using recycled metal powders in the SLM processing, promoting an economic solution to industrial productions.
In the application of moving horizon estimation (MHE) algorithm, the window length will affect the estimation accuracy and the computing efficiency. For this kind of problem, a method of parameter optimization is proposed to obtain suitable window length. Firstly, in order to facilitate online solution, the optimization problem involved in the algorithm is transformed into a quadratic programming (QP) problem in matrix form. Secondly, for the time index and the estimated residual index that measure different properties, the normalization idea is adopted to incorporate them into the same dimension to design the fitness function, and a genetic optimization algorithm based on simulated annealing mechanism is given to search for the optimal window length. Finally, the proposed parameter optimization method is verified by two cases. The results show that the parameter optimization method has the advantages of excellent local search ability and sufficient convergence, and the window length obtained by this method can better take into account the two performance indexes of the MHE algorithm and improve the estimation performance. 相似文献
This paper mainly discusses distributed constrained optimization problem for second-order multi-agent system under undirected communication network. The task of all agents is to minimize the sum of the local convex functions, where each agent is individual and only accesses to one objective function. Different from the most existing results, where the objective functions are assumed to be time-invariable, this paper considers the situation of time-varying objective function. Besides, we don't require that the Hessian matrices are identical and the gradients are bounded. First, a novel time-varying optimization algorithm is proposed based on the projection algorithm. Second, by using convex analysis and Lyapunov theory, it is shown that the states of all agents can reach consensus and asymptotically converge to the neighborhood of the optimal solution. Finally, some numerical examples are given to verify the effectiveness of our algorithms. 相似文献