This paper proposes a command generation approach based on the smooth interpolation without twist constraints and the input–output relation developed by the generalized model predictive static programming. Commands are efficiently generated to achieve the desired terminal condition at a specified final time in an interpolative manner featuring a noniterative nature. The effectiveness of this approach is demonstrated through three different simulation studies including a double integrator benchmark, a soft lunar landing problem, and a cluster missile guidance problem.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Smooth Interpolation-Based Fixed-Final-Time Command Generation


    Contributors:


    Publication date :

    2019-12-01


    Size :

    2864612 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English