Planning And Analysis Of Multisatellite Flyby Inspection Mission With Multiple Constraints

Multisatellite flyby inspection(MSFI)can obtain information of a large number of targets with less propellant consumption in a short time,which is an important development direction of space-based situation awareness and other tasks.During close inspection,the working requirements of sensors such as cameras bring inspection constraints to the terminal flyby state,and there are certain path and maneuver constraints such as minimum altitude and maximum single maneuver size in the process of orbit transfer.When these constraints are coupled with assignment,order,and maneuver scheme variables,the solution of this kind of programming problem becomes very difficult.This thesis studies the planning and analysis of the MSFI mission with multi constraints.The main research contents and results are as follows.1.The feasible region based on constraint propagation characterization and fast judgment algorithm for flyby inspection feasibility are proposed.Firstly,the task flow and constraints of a single flyby inspection mission are analyzed.Various constraints such as sunlight line-of-sight angle,relative speed,single maneuver upper limit,and perigee altitude are analytically propagated and characterized as the feasible range of flight direction angle and velocity of the end flyby state.Then a feasibility estimation method of flyby inspection is proposed.The simulation application of two typical scenarios shows that: The accuracy of the proposed algorithm is more than 93%,and compared with the genetic algorithm(GA),the computational efficiency of a single judgment is greatly increased.The constraint satisfaction range is simple in form,which provides a basis for the algorithm design of constraint satisfaction difficult problems.2.The sequence optimization of the MSFI mission with multiple constraints based on the hybrid-encoding genetic algorithm(HEGA)are proposed.For the sequence optimization of the difficult constraint satisfaction problem,combined with the represented feasible region and transformation of the design variables,based on the HEGA,a two-layer optimization method with the shortest task time based on HEGA is proposed.The outer layer searches for variables such as inspection order and transfer time,and the inner layer searches for the maneuver time of a single task.For the problem of minimum propellant consumption,a single-layer HEGA based on constraint repairing is proposed to repair the unsatisfied constraints to the feasible region for optimization.The simulation results show that when the constraints are difficult to meet,the proposed two-layer optimization method and the constraint repairing method are better than the one-level non-repairing method in optimization effect,and the computational efficiency is more than twice that of the onelevel non-repairing method;Among the constraint parameters,the sunlight line-of-sight angle constraint has a great influence on the results.3.The target screening and task allocation of MSFI mission with multiple constraints based on the greedy search(GS)algorithm are proposed.For the large-scale target screening problem,taking the maximum number of flyby inspection targets as the objective function,combined with the feasibility estimation method,the heuristic greedy screening method of MSFI is studied.For the task allocation problem of MSFI,based on the perturbed orbit integral model of coplanar phase maneuver,the platform-target greedy allocation method combined with the task index decision table is studied.The simulation results show that the efficiency of the heuristic greedy screening method is about 1.33 times higher than that of no preliminary estimation method when the number of targets is the same;The platform-target greedy allocation method can obtain slightly better results than the hybrid coding genetic algorithm in 0.5% of the calculation time.This thesis studies the constraint propagation analysis,sequence planning,target screening,and task assignment of MSFI missions considering the complex constraints of inspection points and processes.The proposed method can provide a reference for the design of space-based situation awareness and other related tasks.