This paper addresses the rendezvous and proximity operations constellation assignment problem by developing a responsive utility function for tasking a constellation of low Earth orbit satellites to several spacecraft servicing tasks. The paper develops the utility function that considers both score of servicing resident space object spacecraft in conjunction with the associated Δ V cost. A highly capable and operationally relevant task allocation method, called the consensus-based bundle algorithm, is leveraged for distributed processing and task allocation. This paper demonstrates that this methodology provides a robust technique for rendezvous and proximity operations scheduling within resource-constrained agent constellations.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Resource-Constrained Constellation Scheduling for Rendezvous and Servicing Operations


    Contributors:

    Published in:

    Publication date :

    2022-03-15


    Size :

    11 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Hubble Space Telescope Servicing Mission 3A Rendezvous Operations

    Lee, S. / Anandakrishnan, S. / Connor, C. et al. | NTRS | 2001




    Hubble Space Telescope Servicing Mission 3A Rendezvous Operations (AAS 01-073)

    Lee, S. / Anandakrishnan, S. / Connor, C. et al. | British Library Conference Proceedings | 2001


    AIAA-2002-4907 Optimal Scheduling for Servicing Multiple Satellites in a Circular Constellation

    Tsiotras, P. / Shen, H. / American Institute of Aeronautics and Astronautics | British Library Conference Proceedings | 2002