Satellite observation schedule is investigated in this paper.A mission planning algorithm of task clustering is proposed to improve the observation efficiency of agile satellite.The newly developed method can make the...Satellite observation schedule is investigated in this paper.A mission planning algorithm of task clustering is proposed to improve the observation efficiency of agile satellite.The newly developed method can make the satellite observe more targets and therefore save observation resources.First,for the densely distributed target points,a preprocessing scheme based on task clustering is proposed.The target points are clustered according to the distance condition.Second,the local observation path is generated by Tabu algorithm in the inner layer of cluster regions.Third,considering the scatter and cluster sets,the global observation path is obtained by adopting Tabu algorithm in the outer layer.Simulation results show that the algorithm can effectively reduce the task planning time of large-scale point targets while ensuring the optimal solution quality.展开更多
Considering the flexible attitude maneuver and the narrow field of view of agile Earth observation satellite(AEOS)together,a comprehensive task clustering(CTC)is proposed to improve the observation scheduling problem ...Considering the flexible attitude maneuver and the narrow field of view of agile Earth observation satellite(AEOS)together,a comprehensive task clustering(CTC)is proposed to improve the observation scheduling problem for AEOS(OSPFAS).Since the observation scheduling problem for AEOS with comprehensive task clustering(OSWCTC)is a dynamic combination optimization problem,two optimization objectives,the loss rate(LR)of the image quality and the energy consumption(EC),are proposed to format OSWCTC as a bi-objective optimization model.Harnessing the power of an adaptive large neighborhood search(ALNS)algorithm with a nondominated sorting genetic algorithm II(NSGA-II),a bi-objective optimization algorithm,ALNS+NSGA-II,is developed to solve OSWCTC.Based on the existing instances,the efficiency of ALNS+NSGA-II is analyzed from several aspects,meanwhile,results of extensive computational experiments are presented which disclose that OSPFAS considering CTC produces superior outcomes.展开更多
Cloud computing has developed as an important information technology paradigm which can provide on-demand services. Meanwhile,its energy consumption problem has attracted a grow-ing attention both from academic and in...Cloud computing has developed as an important information technology paradigm which can provide on-demand services. Meanwhile,its energy consumption problem has attracted a grow-ing attention both from academic and industrial communities. In this paper,from the perspective of cloud tasks,the relationship between cloud tasks and cloud platform energy consumption is established and analyzed on the basis of the multidimensional attributes of cloud tasks. Furthermore,a three-way clustering algorithm of cloud tasks is proposed for saving energy. In the algorithm,f irst,t he cloud tasks are classified into three categories according to the content properties of the cloud tasks and resources respectively. Next,cloud tasks and cloud resources are clustered according to their computation characteristics( e. g. computation-intensive,data-intensive). Subsequently,greedy scheduling is performed. The simulation results showthat the proposed algorithm can significantly reduce the energy cost and improve resources utilization,compared with the general greedy scheduling algorithm.展开更多
A new heuristic approach that resembles the evolution of interpersonal relationships in human society is put forward for the problem of scheduling multitasks represented by a directed acyclic graph. The algorithm incl...A new heuristic approach that resembles the evolution of interpersonal relationships in human society is put forward for the problem of scheduling multitasks represented by a directed acyclic graph. The algorithm includes dynamic-group, detachgraph and front-sink components. The priority rules used are new. Relationship number, potentiality, weight and merge degree are defined for cluster's priority, and task potentiality for tasks' priority. Experiments show the algorithm could get good result in short time. The algorithm produces another optimal solution for the classic MJD benchmark. Its average performance is better than five latter-day representative algorithms, especially six benchmarks of the nines.展开更多
无人飞行器(unmanned aerial vehicle,UAV)自组网的路由研究多以性能指标出发、忽略无人飞行器网络的任务驱动性,与实际需求动态耦合弱、适用性不强。针对该问题基于无人飞行器多任务网络提出了面向任务的无人飞行器联盟组网架构,提出...无人飞行器(unmanned aerial vehicle,UAV)自组网的路由研究多以性能指标出发、忽略无人飞行器网络的任务驱动性,与实际需求动态耦合弱、适用性不强。针对该问题基于无人飞行器多任务网络提出了面向任务的无人飞行器联盟组网架构,提出了无人飞行器联盟的任务自适应优化链路状态路由协议(task adaptive optimized link state routing,TA-OLSR)。基于模糊逻辑设计拓扑稳定度计算方法,利用拓扑稳定度实现TA-OLSR控制消息的自适应广播,同时结合稳定度设计新的多点中继选择策略。仿真结果表明,TA-OLSR算法能从宏观面向任务的角度出发,实现不同任务下的良好自适应性,提升数据包投递率,减少冗余信息传播,降低网络开销,有效提高整体网络性能。展开更多
随着电力物联网(electric Internet of Things,eIoT)技术的快速发展,海量电力设备在网络边缘环境中产生了丰富的数据。移动边缘计算(Mobile Edge Computing,MEC)技术在靠近终端设备的位置部署边缘代理可以有效减少数据处理延迟,这使其...随着电力物联网(electric Internet of Things,eIoT)技术的快速发展,海量电力设备在网络边缘环境中产生了丰富的数据。移动边缘计算(Mobile Edge Computing,MEC)技术在靠近终端设备的位置部署边缘代理可以有效减少数据处理延迟,这使其非常适用于延迟敏感的电力物联网场景。然而,目前的大多数研究没有考虑到部分边缘终端设备也可以作为代理设备提供计算服务,造成了资源浪费。为了充分利用移动边缘计算过程中边缘代理以及边缘终端设备的计算能力,提出了一种基于设备聚类的任务卸载方案。首先,基于分层DBSCAN(hierarchical density-based spatial clustering of applications with noise)算法,对系统中的静态和动态边缘设备进行聚类。其次,将任务卸载问题建模为多臂老虎机(Multi-Armed Bandits,MAB)模型,目标为最小化卸载延迟。再次,提出了一种基于自适应置信上限算法的算法来寻找簇内与簇间的卸载策略。最后,仿真结果表明,该方案在平均延迟方面表现出了更好的性能,并且设备簇的存活时间延长了10%~20%。展开更多
The formation of the manned aerial vehicle/unmanned aerial vehicle(MAV/UAV) task coalition is considered. To reduce the scale of the problem, the formation progress is divided into three phases. For the task clusterin...The formation of the manned aerial vehicle/unmanned aerial vehicle(MAV/UAV) task coalition is considered. To reduce the scale of the problem, the formation progress is divided into three phases. For the task clustering phase, the geographical position of tasks is taken into consideration and a cluster method is proposed. For the UAV allocation phase, the UAV requirement for both constrained and unconstrained resources is introduced, and a multi-objective optimal algorithm is proposed to solve the allocation problem. For the MAV allocation phase, the optimal model is firstly constructed and it is decomposed according to the ideal of greed to reduce the time complexity of the algorithm. Based on the above phases, the MAV/UAV task coalition formation method is proposed and the effectiveness and practicability are demonstrated by simulation examples.展开更多
基金the National Key Research and Development Program of China(Grant No.2016YFB0500801)sponsored by Qing Lan Project.
文摘Satellite observation schedule is investigated in this paper.A mission planning algorithm of task clustering is proposed to improve the observation efficiency of agile satellite.The newly developed method can make the satellite observe more targets and therefore save observation resources.First,for the densely distributed target points,a preprocessing scheme based on task clustering is proposed.The target points are clustered according to the distance condition.Second,the local observation path is generated by Tabu algorithm in the inner layer of cluster regions.Third,considering the scatter and cluster sets,the global observation path is obtained by adopting Tabu algorithm in the outer layer.Simulation results show that the algorithm can effectively reduce the task planning time of large-scale point targets while ensuring the optimal solution quality.
文摘Considering the flexible attitude maneuver and the narrow field of view of agile Earth observation satellite(AEOS)together,a comprehensive task clustering(CTC)is proposed to improve the observation scheduling problem for AEOS(OSPFAS).Since the observation scheduling problem for AEOS with comprehensive task clustering(OSWCTC)is a dynamic combination optimization problem,two optimization objectives,the loss rate(LR)of the image quality and the energy consumption(EC),are proposed to format OSWCTC as a bi-objective optimization model.Harnessing the power of an adaptive large neighborhood search(ALNS)algorithm with a nondominated sorting genetic algorithm II(NSGA-II),a bi-objective optimization algorithm,ALNS+NSGA-II,is developed to solve OSWCTC.Based on the existing instances,the efficiency of ALNS+NSGA-II is analyzed from several aspects,meanwhile,results of extensive computational experiments are presented which disclose that OSPFAS considering CTC produces superior outcomes.
基金Supported by the Harbin Technology Bureau Youth Talented Project(2014RFQXJ073)China Postdoctoral Fund Projects(2014M561330)
文摘Cloud computing has developed as an important information technology paradigm which can provide on-demand services. Meanwhile,its energy consumption problem has attracted a grow-ing attention both from academic and industrial communities. In this paper,from the perspective of cloud tasks,the relationship between cloud tasks and cloud platform energy consumption is established and analyzed on the basis of the multidimensional attributes of cloud tasks. Furthermore,a three-way clustering algorithm of cloud tasks is proposed for saving energy. In the algorithm,f irst,t he cloud tasks are classified into three categories according to the content properties of the cloud tasks and resources respectively. Next,cloud tasks and cloud resources are clustered according to their computation characteristics( e. g. computation-intensive,data-intensive). Subsequently,greedy scheduling is performed. The simulation results showthat the proposed algorithm can significantly reduce the energy cost and improve resources utilization,compared with the general greedy scheduling algorithm.
基金Supported by the National Natural Science Foundation of China (7047107)the Ph.D. Programs Foundation of Ministry of Education of China (20020487046)
文摘A new heuristic approach that resembles the evolution of interpersonal relationships in human society is put forward for the problem of scheduling multitasks represented by a directed acyclic graph. The algorithm includes dynamic-group, detachgraph and front-sink components. The priority rules used are new. Relationship number, potentiality, weight and merge degree are defined for cluster's priority, and task potentiality for tasks' priority. Experiments show the algorithm could get good result in short time. The algorithm produces another optimal solution for the classic MJD benchmark. Its average performance is better than five latter-day representative algorithms, especially six benchmarks of the nines.
文摘无人飞行器(unmanned aerial vehicle,UAV)自组网的路由研究多以性能指标出发、忽略无人飞行器网络的任务驱动性,与实际需求动态耦合弱、适用性不强。针对该问题基于无人飞行器多任务网络提出了面向任务的无人飞行器联盟组网架构,提出了无人飞行器联盟的任务自适应优化链路状态路由协议(task adaptive optimized link state routing,TA-OLSR)。基于模糊逻辑设计拓扑稳定度计算方法,利用拓扑稳定度实现TA-OLSR控制消息的自适应广播,同时结合稳定度设计新的多点中继选择策略。仿真结果表明,TA-OLSR算法能从宏观面向任务的角度出发,实现不同任务下的良好自适应性,提升数据包投递率,减少冗余信息传播,降低网络开销,有效提高整体网络性能。
文摘随着电力物联网(electric Internet of Things,eIoT)技术的快速发展,海量电力设备在网络边缘环境中产生了丰富的数据。移动边缘计算(Mobile Edge Computing,MEC)技术在靠近终端设备的位置部署边缘代理可以有效减少数据处理延迟,这使其非常适用于延迟敏感的电力物联网场景。然而,目前的大多数研究没有考虑到部分边缘终端设备也可以作为代理设备提供计算服务,造成了资源浪费。为了充分利用移动边缘计算过程中边缘代理以及边缘终端设备的计算能力,提出了一种基于设备聚类的任务卸载方案。首先,基于分层DBSCAN(hierarchical density-based spatial clustering of applications with noise)算法,对系统中的静态和动态边缘设备进行聚类。其次,将任务卸载问题建模为多臂老虎机(Multi-Armed Bandits,MAB)模型,目标为最小化卸载延迟。再次,提出了一种基于自适应置信上限算法的算法来寻找簇内与簇间的卸载策略。最后,仿真结果表明,该方案在平均延迟方面表现出了更好的性能,并且设备簇的存活时间延长了10%~20%。
基金supported by the National Natural Science Foundation of China(61573017 61703425)the Aeronautical Science Fund(20175796014)
文摘The formation of the manned aerial vehicle/unmanned aerial vehicle(MAV/UAV) task coalition is considered. To reduce the scale of the problem, the formation progress is divided into three phases. For the task clustering phase, the geographical position of tasks is taken into consideration and a cluster method is proposed. For the UAV allocation phase, the UAV requirement for both constrained and unconstrained resources is introduced, and a multi-objective optimal algorithm is proposed to solve the allocation problem. For the MAV allocation phase, the optimal model is firstly constructed and it is decomposed according to the ideal of greed to reduce the time complexity of the algorithm. Based on the above phases, the MAV/UAV task coalition formation method is proposed and the effectiveness and practicability are demonstrated by simulation examples.