This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satell...This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.展开更多
In the imaging observation system, imaging task scheduling is an important topic. Most scholars study the imaging task scheduling from the perspective of static priority, and only a few from the perspective of dynamic...In the imaging observation system, imaging task scheduling is an important topic. Most scholars study the imaging task scheduling from the perspective of static priority, and only a few from the perspective of dynamic priority. However,the priority of the imaging task is dynamic in actual engineering. To supplement the research on imaging observation, this paper proposes the task priority model, dynamic scheduling strategy and Heuristic algorithm. At first, this paper analyzes the relevant theoretical basis of imaging observation, decomposes the task priority into four parts, including target priority, imaging task priority, track, telemetry & control(TT&C)requirement priority and data transmission requirement priority, summarizes the attribute factors that affect the above four types of priority in detail, and designs the corresponding priority model. Then, this paper takes the emergency tasks scheduling problem as the background, proposes the dynamic scheduling strategy and heuristic algorithm. Finally, the task priority model,dynamic scheduling strategy and heuristic algorithm are verified by experiments.展开更多
针对包含复杂约束条件的约束多目标优化问题(CMOP),在确保算法满足严格约束的同时,有效平衡算法的收敛性与多样性是重大挑战。因此,提出一种双种群双阶段的进化算法(DPDSEA)。该算法引入2个独立进化种群:主种群和副种群,并分别利用可行...针对包含复杂约束条件的约束多目标优化问题(CMOP),在确保算法满足严格约束的同时,有效平衡算法的收敛性与多样性是重大挑战。因此,提出一种双种群双阶段的进化算法(DPDSEA)。该算法引入2个独立进化种群:主种群和副种群,并分别利用可行性规则和改进的epsilon约束处理方法进行更新。在第一阶段,主种群和副种群分别探索约束Pareto前沿(CPF)与无约束Pareto前沿(UPF),从而获取UPF和CPF的位置信息;在第二阶段,设计一种分类方法,根据UPF与CPF的位置对CMOP进行分类,从而对不同类型的CMOP执行特定的进化策略;此外,提出一种随机扰动策略,在副种群进化到CPF附近时,对它进行随机扰动以产生一些位于CPF上的个体,从而促进主种群在CPF上的收敛与分布。把所提算法与6个具有代表性的算法:CMOES(Constrained Multi-objective Optimization based on Even Search)、dp-ACS(dual-population evolutionary algorithm based on Adaptive Constraint Strength)、c-DPEA(DualPopulation based Evolutionary Algorithm for constrained multi-objective optimization)、CAEAD(Constrained Evolutionary Algorithm based on Alternative Evolution and Degeneration)、BiCo(evolutionary algorithm with Bidirectional Coevolution)和DDCMOEA(Dual-stage Dual-population Evolutionary Algorithm for Constrained Multiobjective Optimization)在LIRCMOP和DASCMOP两个测试集上进行实验比较。实验结果表明,DPDSEA在23个问题中取得了15个最优反转世代距离(IGD)值和12个最优超体积(HV)值,展现了DPDSEA在处理复杂CMOP时显著的性能优势。展开更多
基金supported by the National Natural Science Foundation of China(7127106671171065+1 种基金71202168)the Natural Science Foundation of Heilongjiang Province(GC13D506)
文摘This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.
基金supported by the National Natural Science Foundation of China(61773120,61473301,71501180,71501179,61603400)。
文摘In the imaging observation system, imaging task scheduling is an important topic. Most scholars study the imaging task scheduling from the perspective of static priority, and only a few from the perspective of dynamic priority. However,the priority of the imaging task is dynamic in actual engineering. To supplement the research on imaging observation, this paper proposes the task priority model, dynamic scheduling strategy and Heuristic algorithm. At first, this paper analyzes the relevant theoretical basis of imaging observation, decomposes the task priority into four parts, including target priority, imaging task priority, track, telemetry & control(TT&C)requirement priority and data transmission requirement priority, summarizes the attribute factors that affect the above four types of priority in detail, and designs the corresponding priority model. Then, this paper takes the emergency tasks scheduling problem as the background, proposes the dynamic scheduling strategy and heuristic algorithm. Finally, the task priority model,dynamic scheduling strategy and heuristic algorithm are verified by experiments.
基金国家自然科学基金(62272077,72301050)重庆市教委科技重大项目(KJZD-M202400604)资助+1 种基金the Natural ScienceFoundation of Chongqing,China(No.cstc2021jcyj msxmX0557)the MOE Layout Foundation of Humanities and Social Sciences,China(No.20YJAZH102).
文摘针对包含复杂约束条件的约束多目标优化问题(CMOP),在确保算法满足严格约束的同时,有效平衡算法的收敛性与多样性是重大挑战。因此,提出一种双种群双阶段的进化算法(DPDSEA)。该算法引入2个独立进化种群:主种群和副种群,并分别利用可行性规则和改进的epsilon约束处理方法进行更新。在第一阶段,主种群和副种群分别探索约束Pareto前沿(CPF)与无约束Pareto前沿(UPF),从而获取UPF和CPF的位置信息;在第二阶段,设计一种分类方法,根据UPF与CPF的位置对CMOP进行分类,从而对不同类型的CMOP执行特定的进化策略;此外,提出一种随机扰动策略,在副种群进化到CPF附近时,对它进行随机扰动以产生一些位于CPF上的个体,从而促进主种群在CPF上的收敛与分布。把所提算法与6个具有代表性的算法:CMOES(Constrained Multi-objective Optimization based on Even Search)、dp-ACS(dual-population evolutionary algorithm based on Adaptive Constraint Strength)、c-DPEA(DualPopulation based Evolutionary Algorithm for constrained multi-objective optimization)、CAEAD(Constrained Evolutionary Algorithm based on Alternative Evolution and Degeneration)、BiCo(evolutionary algorithm with Bidirectional Coevolution)和DDCMOEA(Dual-stage Dual-population Evolutionary Algorithm for Constrained Multiobjective Optimization)在LIRCMOP和DASCMOP两个测试集上进行实验比较。实验结果表明,DPDSEA在23个问题中取得了15个最优反转世代距离(IGD)值和12个最优超体积(HV)值,展现了DPDSEA在处理复杂CMOP时显著的性能优势。
