检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《装甲兵工程学院学报》2012年第5期72-79,共8页Journal of Academy of Armored Force Engineering
基 金:军队科研计划项目
摘 要:针对不同类型威胁体存在的战场环境中无人车辆战术机动路径规划问题,提出了一种基于威胁代价地图的粒子群优化(Particle Swarm Optimization,PSO)方法。借助极坐标系中关键点的极角进行路径描述,并使用分段3次Hermite插值方法形成光滑路径,将路径规划问题转化为关键点极角的参数优化问题。针对基本PSO(BPSO)算法存在的早熟收敛和后期迭代效率低的缺陷,借鉴以群集方式生活的物种按照不同任务对种群进行分工的机制,提出了一种基于多任务子群协同的改进粒子群优化(Particle Swarm Optimization based on the Multi-tasking Subpopu-lation Cooperation,PSO-MSC)算法。借助该算法的快速收敛和全局寻优特性实现了最优路径规划。实验结果表明:该算法可以快速有效地实现战场环境下无人车辆的战术机动路径规划,且规划路径安全、平滑。A novel algorithm of improved Particle Swarm Optimization (PSO) based on threat cost map is proposed for military unmanned vehicle tactical path planning in battlefield existing different types of threats. The path is described by some key points' polar angle in polar coordinates, and it is smoothed by piecewise cubic Hermite interpolation method, thus the path planning is equivalent to parameter optimiza- tion of polar angles. Because Basic Particle Swarm Optimization (BPSO) is easy to fall into the local op- timum as the swarm activity of population gets worse during the evolution, an improved PSO based on the Multi-tasking Subpopulation Cooperation (PSO-MSC) is developed by introducing the idea of multi-tas- king subpopulation mechanism used by gregarious species. PSO-MSC is introduced to get the optimal path for its fast convergence and global search character. Experimental results show that a safe and smooth tacti- cal path can be found fleetly and effectively in complicated battlefield environment by the proposed method.
关 键 词:无人车辆 战术路径规划 威胁代价地图 粒子群优化 HERMITE插值
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.43