This work introduces a novel distributed path planning algorithm for multiple spacecraft operating in close proximity. This study builds on the geometric path planner the other previously developed. The aforementioned geometric planner is a centralized algorithm that leveraged theoretical foundations from nonlinear geometric control to generate fuel-efficient and collision-free trajectories for spacecraft flying in formation. The path planning problem is reframed into a partial differential equation whose solution is geodesic (path of least resistance) of the solution manifold. This study distributes the computation of the path planner to every agent in the system. The resulting algorithm allows for application to large constellations while retaining the fuel-efficiency characteristics of the geometric path planner. The fast convergence of the optimization scheme, coupled with the low/distributed computation requirement, makes the distributed path planner suitable for online implementation.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Fuel-Efficient Distributed Path Planning for Spacecraft Formation Flying


    Contributors:


    Publication date :

    2022-03-05


    Size :

    16962265 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Optimal Path Planning for Spacecraft Formation Flying: Planning Architecture and Operations (AAS 07-424)

    Burgon, R. / Roberts, J.A. / Roberts, P.C.E. et al. | British Library Conference Proceedings | 2008



    On Calculus of Variations in Aircraft and Spacecraft Formation Flying Path Planning

    L Afflitto, A. / Sultan, C. / American Institute of Aeronautics and Astronautics | British Library Conference Proceedings | 2010