Abstract
The Satellite TT&C scheduling problem (STSP) is researching how to improve the execution of tasks. Among them, the heuristic algorithm is a kind of algorithm that can solve SRSP quickly and give a feasible solution, which has strong practical application value. However, in the previous research, there were few comparative analysis of different heuristic rules, and there was no application criterion. In this paper, we will sort out and experimentally analyze the different heuristic algorithms proposed in the previous research. First, a Task Location Selection Algorithm (TLSA) will be proposed, which is used to select the appropriate ground station time window for the task sequence as the communication time to achieve the goal of maximizing profit. After that, experiments with different heuristic rules will be taken. Analysis will be based on a series of satellites and multiple attributes. Through our analysis, the main significance is to discover the characteristics of the experimental scene and match the existing heuristic rules with the scenes with characteristics to guide the algorithm selection in the actual use process.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
