Research On Multi-satellites And Multi-task Collaborative Allocation Method

In recent decades,with the rapid development of space technology,remote sensing satellite imaging capability on the ground has tended to be mature,which has been extensively used in every field of human life,such as military reconnaissance,inertial navigation and so on.As the increasing number and complexity of earth observation tasks,single star can no longer satisfy the complicated macro task,and multiple star collaborative planning has become a key point and a hotspot of the research of various countries in the future.In particular,the planning mode of the multi-star and multi-task cooperating tasks has become one of the primary technologies researchers and space agencies in various countries to be conquered at present.Multi-satellite and multi-mission system collaborative planning is mainly based on the premise of meeting the demands of users,and considers the number of satellites,satellite-borne capacity,satellite timeliness and satellite comprehensive benefits as constraint condition,to establish a multi-satellite and multi-task collaborative planning model and solves.This paper studies the multi-satellite and multi-mission collaborative allocation method and focuses on solving the task allocation issue of multiple satellites in the observation of multiple task objects,to realize the optimal scheduling problem of high maneuvering autonomous flight satellites.The multi-mission system is composed of multi-satellite platforms with different orbital types at different altitudes and different loading capacities.By analyzing,assigning and planning a variety of different types of tasks,to realize the autonomous operation of satellites with as little human intervention as possible.The specific work is as follows:Aiming at the issue description of satellite autonomous mission planning,the description of imaging autonomous mission planning problem is completed considering the complicacy of observation mission,the problem characteristics of mission planning,the main difficulties of mission planning and other contents.Based on the problem description,the hierarchy and overall process of the task planning problem are built to provide basic support and basic thoughts for the subsequent task planning problem modeling and planning algorithm design.Aiming at the modeling of satellite autonomous mission planning,accorfing to the multi-satellite,multi-mission and timeliness and other requirements of satellite observation missions,it is firstly analyzed the various environmental and resource constraints involved,such as weather,energy,storage capacity,imaging quality,etc.Considering the features of practical engineering application,reasonable assumptions are made for planning problems,and on the basis of reasonable assumptions,unified modeling is conducted for tasks,satellites,asterism and other resources,to provide a model basis for subsequent planning algorithm design.In accordance with the established problem of satellite autonomous mission planning,the ant colony algorithm-based satellite autonomous mission planning algorithm is designed combined with the characteristics of the satellite mission planning model,considering the requirements of the timeliness of the satellite mission to efficiency and speed of the solution.According to the traits of discrete multi-objective optimization problem solving,the global solving ability of ant colony algorithm can be brought into play,to solve the problem of satellite mission planning.In the light of the established satellite autonomous task planning problem,a multi-satellite and multi-task collaborative planning algorithm based on the contract net is designed.In the designed algorithms,the relationship between satellites and missions between tenderers and bidders is firstly constructed.The bidding model is set up,then the bidding mechanism is established based on the satellite attributes and satellite-borne loads,the bidding mechanism is established on the basis of mission attributes,and the bond between satellite and mission is the negotiation mechanism between the bidder and the tenderer,on this basis,the optimization problem is evaluated and solved in the planning problems.