摘要
文中将三维实时航路重规划问题进行了形式化定义,使用航路惩罚度来评价航路的优劣,并提出了一种改进的粒子群优化算法(M-PSO),来求解实时航路重规划问题。试验结果表明,改进的粒子群优化算法在求解三维实时航路重规划问题上,具有较好的实时性和稳定性,能够快速搜索到可以躲避所有威胁区的航路,并且使得种群中的个体达到收敛状态。
In this paper,the 3 D real-time route re-planning problem is formally defined,and the route penalty degree is used to evaluate the route.An modified particle swarm optimization algorithm(M-PSO) is proposed to solve the real-time route re-planning problem.The experimental results show that the modified particle swarm optimization algorithm has better real-time and stability in solving the 3 D real-time route re-planning problem.It can quickly search for routes that can avoid all threat and make the individuals in the population reach convergence state.
作者
吕明伟
胡小兵
刘伟
LV Mingwei;HU Xiaobing;LIU Wei(Shenyang Aircraft Design&Research Institute,Shenyang 110035,China;Major Special Equipment Project Management Center of the Navy Equipment Department,Beijing 100071,China)
出处
《飞机设计》
2019年第5期61-68,共8页
Aircraft Design
关键词
实时航路重规划
A*算法
粒子群优化算法
real-time route re-planning
A* algorithm
particle swarm optimization