B-Spline Curve Fitting of Hungry Predation Optimization on Ship Line Design

Abstract

The ship line often describes by the offset table of discrete data points, which leads to the problems that three view coordinates may not correspond, the fitting error is large and the fitted curve cannot be easily modified. This will seriously affect the subsequent ship performance evaluation and op-timization. To solve this problem, this paper develops a B-spline curve fitting of hunger predation optimization on ship line design (HPA), which contains knot guidance technology, hungry preda-tion optimization technology and adaptive adjustment of algorithm input parameters. HPA transforms the discrete ship line into a continuous B-spline curve description, which improves the accuracy and modifiability of the ship line design. Through the real-time feedback of the results of each round of iteration, the knot vector is adaptively adjusted towards a better fitness, and then the optimal control point set that satisfies the error threshold can be obtained. The effectiveness and superiority of HPA are verified by comparing with related research and engineering software.

Keywords

• knot placement
• b-spline curve fitting
• ship line design
• optimization algorithm
• reverse engineering