基于分解的多目标多小车充电路径规划算法OA
A Multi-objective Multi-vehicle Charging Path Planning Algorithm Based on Decomposition
随着无线能量传输技术的发展,为传感器节点充电来无限延长网络的使用寿命成为可能,许多学者为此提供了许多充电方案,然而大多充电方案仅仅考虑了普通网络的充电方案,针对采用多跳分簇路由协议的大型无线传感器网络的充电方案较少.为此,论文提出了多小车充电的多目标路径规划模型,由于是全覆盖式的充电方案,所以不会出现节点的死亡问题,通过以小车移动距离,节点的能量利用率,充电周期为优化目标,改进种群更新方式来设计基于分解的改进多目标优化算法求解最优的充电路径.仿真实验结果表明,提出的充电方案可以实现全覆盖式充电,且与已有的基于分解的多目标优化算法相比效果较好.
With the development of wireless energy transmission technology,it is possible to extend the service life of sensor networks indefinitely by charging sensor nodes.Many scholars have proposed various charging schemes for this purpose,but most schemes only consider ordinary networks,and few are designed for large wireless sensor networks using multi-hop clustering routing protocols.Therefore,this paper proposes a multi-objective path planning model for multi-vehicle charging.As a full-coverage charging scheme,it avoids the node death problem.To solve the optimal charging path,a decomposition-based multi-objective opti-mization algorithm is designed,which takes travel distance,node energy utilization rate,and charging cycle as optimization objec-tives and improves the population update method.Simulation results show that the proposed charging scheme can achieve full-cover-age charging and performs better than existing decomposition-based multi-objective optimization algorithms.
杨康杰;王丽芳
太原科技大学计算机科学与技术学院 太原 030024太原科技大学计算机科学与技术学院 太原 030024
信息技术与安全科学
分簇多跳路由协议无线可充电传感器网络多目标优化多小车路径规划
clustered multihop routing protocolWRSNsmulti-objective optimizationmulti-vehiclepath planning
《计算机与数字工程》 2026 (4)
911-916,6
国家自然科学基金项目(编号:61876123)资助.
评论