| 注册
首页|期刊导航|计算机与数字工程|一种新型启发式PSO算法求解市区最优路径规划研究

一种新型启发式PSO算法求解市区最优路径规划研究

方昕

计算机与数字工程2018,Vol.46Issue(2):270-275,6.
计算机与数字工程2018,Vol.46Issue(2):270-275,6.DOI:10.3969/j.issn.1672-9722.2018.02.013

一种新型启发式PSO算法求解市区最优路径规划研究

Plan Research on a New Heuristic PSO to Solving Urban Optimal Path

方昕1

作者信息

  • 1. 安康学院电子与信息工程学院 安康725000
  • 折叠

摘要

Abstract

Aiming at the shortcomings of particle swarm optimization and poor local optimization ability,grid method with bi-nary information is used to model the environment.Combined with improved A*algorithm to initialize the particle group,improved PSO algorithm is proposed based on map data which mathematical model to derive the algorithmic environment model.The algorithm considers the collision avoidance constraint,the motion constraint and the distance constraint. The new heuristic function and the nonlinear dynamic adjustment are used to study inertia weight.Based on the path length,the concept of smoothness is introduced to find the optimal path.Compared with algorithms,the experimental results show that proposed model and improved algorithm can ef-fectively avoid obstacles,search the optimal path,reduce the running time,improve convergence rate and search ability of the algo-rithm.

关键词

最优路径/启发函数/PSO算法/惯性权重

Key words

optimal path/heuristic function/PSO algorithm/inertia weight

分类

信息技术与安全科学

引用本文复制引用

方昕..一种新型启发式PSO算法求解市区最优路径规划研究[J].计算机与数字工程,2018,46(2):270-275,6.

基金项目

陕西省教育厅项目(编号:12JK0536 ()

16JK1016 ()

16JK1015) ()

陕西省青年科协项目(编号:2015110) (编号:2015110)

安康学院培育项目(编号:2016AYPYZX09) (编号:2016AYPYZX09)

安康学院高层次人才项目(编号:2016AYQDZR06) (编号:2016AYQDZR06)

省级创新创业项目(编号:2016sxjy015 ()

2016sxjy017)资助. ()

计算机与数字工程

OACSTPCD

1672-9722

访问量0
|
下载量0
段落导航相关论文