A new algorithm suitable for fast onboard implementation is presented for designing attitude maneuver paths that achieve desired boresight alignment in the presence of multiple three-axis attitude constraints. It is based on a recently proposed algorithm in which possible attitudes are discretized in a three-dimensional distortion-minimizing projected space. In that space, grid points are enumerated and graph search pathfinding algorithms are employed to find the shortest constrained path between selected initial and target grid points. The new algorithm extends this approach from a single target point to a continuum of target points, representing all possible attitudes that maintain the desired boresight alignment. It augments the original algorithm with the transformation that makes it possible to assign a single value to estimated distances for the whole continuum of target points. This, in turn, allows the pathfinding algorithms to efficiently determine the shortest overall path to the whole continuum, which corresponds to the shortest attitude maneuver path that achieves the desired boresight alignment.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Fast Autonomous Three-Axis Constrained Attitude Pathfinding and Visualization for Boresight Alignment


    Contributors:

    Published in:

    Publication date :

    2017-02-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English