This paper presents a path planning algorithm for a flight vehicle operating between two consecutive nodes. At first, a nonlinear particle model describing kinematics in horizontal plane is founded. Taking all of constrains into consideration, such as turn acceleration constrain, both initial and final waypoints constrain, and Bank-to-turn control constrain, a method based on geometric principle to find a continuous curvature path is given. Assembling the clockwise turn, counter-clockwise turn, and straight primitive creates a flyable path, and then we reduce the path planning to an integral equation problem with single variable; with combination of analytical solution and numerical computation, opposite dividing method is adopted to solve the equation, whose convergence is proved in theory. The contribution of this paper offers strong support for mission planning. Finally, the effectiveness and rapidity of the algorithm is demonstrated by a mathematical simulation.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Path planning method for flight vehicle between two consecutive nodes


    Contributors:
    Fan Shipeng (author) / Qinghai Gong (author) / Sun, You (author) / Jian Hou (author) / Chen Yicheng (author) / Li, Ling (author)


    Publication date :

    2016-08-01


    Size :

    149656 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    UAS Flight Path Planning for Dynamic, Multi-Vehicle Environment

    He, Tong / Mantegh, Iraj / Chen, Long et al. | IEEE | 2020


    Vehicle path planning method and vehicle path planning device

    TAI YUZHUO / CHU JINGKAI | European Patent Office | 2021

    Free access

    Interface for planning flight path

    HU BOTAO / ZHANG JIAJIE | European Patent Office | 2018

    Free access

    INTERFACE FOR PLANNING FLIGHT PATH

    HU BOTAO / ZHANG JIAJIE | European Patent Office | 2017

    Free access