天临空协同对地观测任务规划模型与并行竞争模因算法

Planning model and parallel competing memetic algorithm for space-near space-air based cooperative earth observation missions

针对天基、临空基和空基协同的对地观测发展新趋势和"看得见、盯得住、跟得上"的对地观测应用新要求,研究面向3种典型对地观测任务的天临空协同任务规划模型与算法.首先,构建统一化的观测路径决策模型,为不同资源的观测路径提供统一的描述手段;其次,建立差异化的约束与收益模型,指明区域目标覆盖、定点目标监视和移动目标跟踪等3种典型对地观测任务,以及覆盖率、监视率和跟踪率等3种收益函数,同时提出一种并行竞争的模因算法,通过并行、竞争和进化操作逐代发挥算法、算子优势和计算机算力,提供灵活、易用和自适应的模型求解手段;然后,开展3种典型对地观测任务仿真实验,检验天临空协同对地观测任务规划模型和并行竞争模因算法,呈现出天临空对地观测的时、空协同性;最后,讨论模型和算法在天临空协同对地观测实际应用中的可行性和改进方向.

To address the novel space-near space-air based cooperative earth observation(SNA-EO) with coverage,monitoring, and tracking requirements, this paper studies the planning models and the algorithm for three typical SNA-EO missions. Firstly, a general routing decision model is built to describe the observation routes of different SNA-EO resources. Then, a differentiated constraint and objective model is given to formulize the SNA-EO missions,including regional target coverage, fixed target monitoring, and moving target tracking. Also, the coverage rate,monitoring rate, and tracking rate are defined as objective functions of these three missions, respectively. To solve the models in a flexible, easy-to-use, and self-adaptive manner, a parallel competing memetic algorithm that makes full use of inner algorithms and operators via parallel, competing, and evolutionary strategies is proposed. The models and the algorithm are experimentally examined in cases of the three SNA-EO missions, where the SNA-EO cooperation in space and time domain is properly presented. Finally, the feasibility and suggestions of the models and the algorithm in real-world applications are discussed.