Obstacle Detection by Autonomous Vehicles: An Adaptive Neighborhood Search Radius Clustering Approach

Abstract

For autonomous vehicles, obstacle detection results using 3D lidar are in the form of point clouds, and are unevenly distributed in space. Clustering is a common means for point cloud processing; however, improper selection of clustering thresholds can lead to under-segmentation or over-segmentation of point clouds, resulting in false detection or missed detection of obstacles. In order to solve these problems, a new obstacle detection method was required. Firstly, we applied a distance-based filter and a ground segmentation algorithm, to pre-process the original 3D point cloud. Secondly, we proposed an adaptive neighborhood search radius clustering algorithm, based on the analysis of the relationship between the clustering radius and point cloud spatial distribution, adopting the point cloud pitch angle and the horizontal angle resolution of the lidar, to determine the clustering threshold. Finally, an autonomous vehicle platform and the offline autonomous driving KITTI dataset were used to conduct multi-scene comparative experiments between the proposed method and a Euclidean clustering method. The multi-scene real vehicle experimental results showed that our method improved clustering accuracy by 6.94%, and the KITTI dataset experimental results showed that the F1 score increased by 0.0629.

Keywords

• autonomous vehicle
• adaptive neighborhood search radius
• clustering
• obstacle detection