Constraint-Satisfaction-Based Modeling and Solving for Spacecraft TT&C Scheduling in Complex Task Scenarios

Orbital spacecraft operations fundamentally depend on support from Tracking, Telemetry, and Command (TT&C) resources, including ground stations and relay satellites. This study addresses the TT&C resource scheduling problem under complex task scenarios, aiming to maximize task completion benefits while satisfying multidimensional constraints encompassing task execution durations, finite space-based and ground-based TT&C time windows, temporal and logical interdependencies, sun/shadow operational requirements, and sequential scheduling mandates. A Constraint Satisfaction Model is developed to formalize these operational challenges, integrating systematic constraint propagation mechanisms with heuristic backtracking search strategies. The proposed algorithm enhances computational efficiency through prioritized task sequencing based on multi-level heuristic rules while employing conflict-aware backtracking to resolve scheduling inconsistencies. Experimental results demonstrate that the design of the heuristic strategy effectively enhances the algorithm's runtime efficiency and achieves superior performance compared to the Ortools solver.