期刊文献+

最佳维变异粒子群优化算法在传感器调度中应用

Application of best-dimension mutation particle swarm optimization algorithm in sensor scheduling
在线阅读 下载PDF
导出
摘要 粒子群优化(PSO)算法的主要特点是能快速得到问题的解,缺点是容易陷入局部最优。提出了一种利用最佳维变异技术和量子理论方法改进的PSO算法,并应用于目标跟踪传感器调度问题。目标的动力学模型为线性高斯模型,传感器观测值被高斯噪声污染并与目标状态线性相关。对于多传感器单目标跟踪的数学问题,引入提出的最佳维变异PSO算法,在整个时间轴上产生最小成本。仿真实验结果表明:提出的算法比已有的算法收敛速度更快,全局搜索能力更强,传感器调度效率更高。 The main characteristic of the particle swarm optimization (PSO) algorithm is that it can get the solution quickly, and its disadvantage is easy to fall into a local optimum in the process. An improved PSO algorithm is proposed using best dimension mutation technique and quantum theory. It is applied to the sensor scheduling problem for target tracking. The dynamics model of the target is linear Gaussian model, and the sensor measurements impaired by white Gaussian noise are linearly related to the state of the target. A numerical problem of single target tracking with muhiple sensors is studied using the proposed best dimension mutation particle swarm optimization(BDMPSO) algorithm to get the minimal cost on the whole timeline. The simulation results show that the proposed algorithm has much faster convergence, stronger global search ability and more scheduling efficient than the existing algorithms.
出处 《传感器与微系统》 CSCD 北大核心 2011年第12期145-148,152,共5页 Transducer and Microsystem Technologies
基金 中央高校基本科研业务费专项资金资助项目(JUSRP111A46) 国家自然科学基金资助项目(61170119)
关键词 传感器调度 粒子群优化 目标跟踪 sensor scheduling particle swarm optimization(PSO) target tracking
  • 相关文献

参考文献11

  • 1He Y, Chong K. Sensor scheduling for target tracking in sensor networks[ C ]//43rd IEEE Conference on Decision and Control, CDC ,2004:743-748.
  • 2Baskar S, Suganthan P. A novel concurrent particle swarm optimization[ C l//Congress on Evolutionary Computation, CEC2004, 2004:792-796.
  • 3Wang X H, Li J J. Hybrid particle swarm optimization with simu- lated annealing [ C ]//Proceedings of 2004 International Confe- rence on Machine Learning and Cybernetics,2004:2402 -2405.
  • 4Stacey M G I ,Jancic A. Particle swarm optimization with mutation [ C ] // Congress on Evolutionary Computation, CEC' 03,2003 : 1425 -1430.
  • 5Kalman R E. A new approach to linear filtering and prediction problems [ J ]. Transactions of the ASME-Joumal of Basic F, ngi- neering, 1960,82( 1 ) :35-45.
  • 6Nearchou A. Solving the single machine total weighted tardiness scheduling problem using a hybrid simulated annealing algori- thm[ C]//2nd IEEE International Conference on Industrial lnlor- matics, INDIN' 04,2004:513-516.
  • 7Bertsekas D P. Dynamic programming and optimal control [ M ]. 3rd ed. Nashua, US : Athena Scientific Press,2005.
  • 8Maheswararajah S, Halgamuge S. Sensor scheduling for target tracking using particle swarm optimization [ C ]//IEEE 63 rd, Ve- hicular Technology Conference, VTC 2006-Spring, 2006 : 573 - 577.
  • 9Ong Y S, Keane A, Lamarckian M. Learning in memetic algo- rithms [ J ]. IEEE Transactions on Evolutionary Computation, 2004,8(2) :99-110.
  • 10Levin F S. An introduction to quantum theory [M]. New York : Cambridge Univ Press,2002.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部