Scheduling Algorithm for Intentional Constellation Conjunctions

Satellite constellations have become an integral part of military communication, navigation, and remote sensing systems for both the United States and its adversaries. As our reliance on satellite technology grows, so do the risks and challenges of maintaining or protecting space-based services during military operations. One method of enabling satellite maintenance is to conduct rendezvous and proximity operations (RPO) with other satellites. With the increasing proliferation of satellite constellations and their use in military applications, there is a growing need to do this efficiently across constellations. One aspect of efficiency is having a scheduling algorithm that can optimize satellite selection and timing to maneuver a given constellation to another for conjunction in support of RPO. This paper presents an optimized scheduling algorithm for intentional constellation conjunctions between a maneuvering and constant orbit satellite constellation that minimizes the overall change in velocity (delta V) of the maneuvering constellation, while constraining the conjunctions to a desired window of time. This scheduling algorithm optimizes the timing and delta V requirements by considering the orbital parameters of the satellite constellation, as well as the current and future positions of the operational satellites in the scheduling queue. In a simulation environment, the application of this algorithm yielded an average delta V savings of over 20% compared to other methods, showcasing its efficiency and scalability in orchestrating constellation conjunctions between maneuvering and constant orbit satellite constellations. This algorithm offers a promising solution to the growing need for efficient satellite maneuvering in support of RPO across satellite constellations, thus enhancing the flexibility and resilience of military satellite systems amidst evolving strategic challenges in space.