In order to further improve the stability of UAV trajectory tracking, this paper proposes a dynamic tracking method of UAV Landing Trajectory Based on chaos genetic algorithm. Firstly, the dynamics model of quadrotor UAV is established, and the landing mark which is easy to identify is designed. Using Zhang Zhengyou calibration algorithm, the transformation from real world 3D coordinates to image 2D coordinates is obtained, and the internal parameters of the computer are quickly calculated. On this basis, feature points are detected and identified to facilitate landing trajectory tracking. Using chaos genetic algorithm to divide the priority of landing path, the dynamic tracking of landing trajectory is realized. Experimental results show that the performance of the proposed method is stable. The proposed method has strong robustness in noise environment.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Dynamic tracking method for landing trajectory of power line patrol UAV Based on Chaos Genetic Algorithm


    Contributors:
    Yan, Jiawen (author) / Liu, Zhe (author) / Chen, Chagjin (author) / Zhao, Jintao (author)


    Publication date :

    2021-07-01


    Size :

    309139 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Power transmission line patrol device

    LI RUIBO / WANG YI / LU XINGWANG et al. | European Patent Office | 2022

    Free access

    Automatic line patrol method and automatic line patrol unmanned aerial vehicle

    CHEN XUJIE / HUANG DENGCHENG / HUANG SIHAO et al. | European Patent Office | 2021

    Free access

    OVERHEAD LINE PATROL INSPECTION SYSTEM AND OVERHEAD LINE PATROL INSPECTION METHOD

    AKIYAMA HIYOYUKI / IMAHASHI HIDEAKI / AMAZAKI FUMIAKI et al. | European Patent Office | 2024

    Free access

    Exact trajectory tracking control of automatic landing

    Jun, C. / Xinguo, Z. | British Library Online Contents | 2005