A Launch Vehicle Cluster Launch Mission Planning Method Based on Contract Network Protocol

Given the urgent need to launch a satellite network, several constraints must be taken into account, including the high number of satellite launches, the need for quick mission launch times, and a limited launch window. Additionally, the coordination of multi-wave cluster launches across multiple launch sites is necessary. To address these challenges, an algorithm based on a contract network and an adjacency window matrix is proposed. Method for planning launch missions for a cluster of launch vehicles. The mission planning process is primarily categorized into two tiers. The initial layer involves the allocation of satellites, taking into account window limits and utilizing the launch effectiveness of a single satellite and the equitable distribution of tasks among launch stations as indications. The second stage involves the assignment of launch vehicles, considering factors such as the availability of launch vehicle resources and the intersection of satellite windows at the launch site. Launch vehicle cost and deployment time are used as indicators in this process. First, the launch vehicle capability is determined to establish a bidding model under a single bidder. The “launch point-target” window is then calculated based on the orbit phase difference. Next, the contract network algorithm is used to allocate each target satellite in the constellation based on the bidding model. Finally, all possible launch plans are generated by traversing the satellites allocated at the launch site and their launch windows. By integrating the effectiveness function of launch time and cost, multiple plans are sorted and the optimal solution is selected as the task allocation result. The simulation results demonstrate that the suggested technique successfully deploys all target satellites in the constellation within the specified timeframe, confirming the effectiveness and superiority of the proposed algorithm.