Abstract

Compared to standard navigation maps, HD maps contain precise additional information for automated vehicles. To exploit this information, a lane-level accurate localization estimate within the HD map needs to be available. Here, the computation and memory overhead of the localization algorithm needs to be as small as possible to enable a reasonable usage of HD map information. Since the accuracy of GNSS measurements is insufficient for an accurate localization at lane-level, HD maps commonly contain geo-referenced landmarks like lane markings and boundaries that can be detected by series-production camera sensors, especially on highways. These measurements are fused with the motion measurements provided by the ABS and ESP sensors of the vehicle within a Bayesian filtering framework. Here, the most popular localization algorithm coming from the field of robotics is the particle filter (PF). However, for a robust estimation, a sufficiently high number of particles is required which is in contradiction to the objective to minimize the computational and memory overhead of the localization algorithm. Hence, in this contribution a memory and run-time efficient Extended Kalman-Filter (EKF) based solution is proposed employing measurements from series-production vehicle sensors and a public HD map from two highways near Dusseldorf. Experimental results achieved with the EKF are comparable with the localization accuracy provided by the PF while run-time and memory consumption are considerably reduced.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.