Abstract Localization is the foundation of automatic driving and it has always been a topic of research hotspot and difficult to deal with. The DV-Hop algorithm is most widely used in node localization research, and it will be used together with particle swarm optimization algorithm. In this paper, an NJPDH algorithm is proposed to compensate for the inferior accuracy of DV-Hop localization algorithm. Based on the DV-Hop location algorithm, the algorithm is added to the weight of each beacon node, the average distance is weighted, the particle swarm optimization is optimized from two aspects of the inertia weight and the active factor to avoid the particles trapped in the local optimization, and then get the location of the unknown nodes better. The simulation results show that under the same hardware conditions, compared with the particle swarm based PSO-DV-Hop algorithm, it can effectively reduce the impact of the jump distance, increase the coverage of the nodes, improve the positioning accuracy and robustness of the positioning process, and have better applicability.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Research on the DV-Hop Location Algorithm Based on the Particle Swarm Optimization for the Automatic Driving Vehicle


    Contributors:


    Publication date :

    2019-01-01


    Size :

    11 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    Vehicle Path Planning Method Based on Particle Swarm Optimization Algorithm

    Yu, Sheng Long ;Bo, Yu Ming ;Chen, Zhi Min | Trans Tech Publications | 2012