Skip to content
naulon
Not checkedNot checked for notices yet.

Obstacle detection and tracking algorithm based on multi‐lidar fusion in urban environment

Jiong Li, Yu Zhang, Xixia Liu and 2 more

IET Intelligent Transport Systems · 2021

doi:10.1049/itr2.12105 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Abstract Adjacent obstacles are difficult to be distinguished, and remote obstacle is easily detected as multiple targets. Besides, occluded obstacles are difficult to track, and tracking velocity of the obstacles in rapid acceleration or deceleration converges slowly in the urban environment. In view of this, an obstacle detection and tracking method based on multi‐lidar is proposed. Firstly, based on the vehicle kinematics model, motion compensation is adopted to solve the space‐time synchronization problem among lidars after road segmentation, and data level fusion is completed. Next, the obstacles are detected by combining adaptive voxel grid DBSCAN (AVG‐DBSCAN) algorithm and Region Growing (RG) algorithm. Then, the Breadth First Search (BFS) algorithm and KD tree are adopted to improve the Evolutionary Hungarian algorithm for the fast association of obstacles. Finally, the occlusion rate and dynamic region selection are used to track obstacles accurately, based on the Kalman Filter of uniform acceleration model. The experimental results on the authors' extracted urban dataset show that the proposed method can effectively fuse multi‐lidar data and outperforms other methods in obstacle detection and tracking. Its average accuracy for detection is 97.53% and its average accuracy for tracking is 95.1%. The average duration of the entire process is only 30 ms.

Abstract licence: CC BY-ND

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.