The application discloses a method for solving the multi-objective
optimization problem, comprising the following steps: S1), designing a target function, constructing a weighted single-target function to realize collaborative optimization; S2), an initialization stage: adopting
refraction reverse learning and an elite
selection strategy; S3), a rolling ball stage: fusing a Pareto guide and an Osprey search thought; S4), a breeding
dung beetle stage: introducing an adaptive t-distribution disturbance mechanism; S5), a foraging
dung beetle stage; S6), a stealing
dung beetle stage: fusing a multi-objective collaborative sharing mechanism of the Pareto guide; S7), merging
offspring and parent populations and updating an external solution set; and S8), after iteration termination, outputting an optimal track. The application has excellent performance in
path search and
obstacle avoidance ability under complex
terrain, and introduces an adaptive t-distribution disturbance and a Jacobian
curve smoothing mechanism, which significantly enhances global
jumping and local fine search, and guarantees the smoothness of the planned track and the multi-objective convergence quality.