采用动态规划思想解决0-1背包问题，更好的理解动态规划思想，理解递归的理念- It uses dynamic programming to solve the 0-1 knapsack problem, a better understanding of dynamic programming, understanding the concept of recursion

不确定环境下的机器人路径规划的多目标粒子群优化算法-Robot path planning in uncertain environment using multi-objective particle swarm optimization