This article presents a semianalytical method for motion planning with pointing and dynamic constraints in two stages where the path-planning problem with pointing constraints is addressed using parameter optimization of an analytically defined cost function on the virtual domain and dynamic constraints are addressed on the real time domain. The analytical formulation of the problem allows a simple method for reshaping the path between two prescribed rotations so that it can avoid forbidden regions. The approach described in this article has the advantage that it is simple to implement, deterministic, does not require discretization or integration, is easily adjusted to satisfy actuator constraints, and is expressed explicitly on the special orthogonal group SO(3).


    Access

    Download


    Export, share and cite



    Title :

    Geometric attitude motion planning for spacecraft with pointing and actuator constraints



    Publication date :

    2016-01-01



    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    629