一种空间碎片主动清除任务规划方法

When planning the mission of carrying multiple payloads to clear a large amount of space debris from multiple launch points, it is necessary to minimize the cost of the carrier. The proposed method is divided into three components to solve at the problem of vehicles' cost in multi-launch site, multi-vehicle, multi-payload, and multi-target mission planning. Firstly, a target window calculation scheme is designed to build the single matching of the launch site, vehicle, payload and target, in which multiple constraints and multiple stages are considered. Secondly, based on the multiple launch site, vehicle, payload and target, the launch matrix is generated which can describe the feasibility of multi-matching of multi-launce site, multi-vehicle, multi-payload, and multi-target. Finally, the Hungarian algorithm is adopted to solve the problem of target mission planning with launch matrix dynamic adjustment strategy with the policy of minimizing the vehicle consumption. The simulation results show that the proposed method can fully remove active debris with minimum vehicle consumption, which verifies the effectiveness and superiority of the proposed method.