摘要
针对利用多个移动节点采集散布在固定区域内固定传感器节点上的信息时的路径规划问题,提出了一种基于无性繁殖的遗传算法.该遗传算法采用了二分染色体编码方案和随机联赛选择算子,并分别对染色体第一部分和第二部分提出了优化机制以扩大解空间的搜索能力,增加种群的多样性.仿真实验结果表明:针对总路线最短优先、路径均衡优先和最短完成时间优先3种路径选择策略,该算法均取得较好结果.
In order to solve the problem of path planning when multiple mobile nodes are used to collect information in fixed sensor nodes spread in a certain area,this paper proposes a genetic algorithm with an asexual reproduction plan,which uses two-part chromosome technique and stochastic tournament model.Besides,optimization mechanisms of first part and second part of the chromosome are added to the solution,expanding the size of searching solution space and increasing the diversity of genetic population.Simulation results proved that the algorithm performs well under each of three path planning strategies,that is,the shortest total path first,the balance path first and the shortest finishing time first.
出处
《南通大学学报（自然科学版）》
CAS
2010年第3期40-46,共7页
Journal of Nantong University(Natural Science Edition)
基金
国家自然科学基金项目(60903163)
关键词
多移动节点
路径规划
无性繁殖
遗传算法
multiple mobile nodes
path planning
asexual reproduction
genetic algorithm
