Computational & Technology Resources
an online resource for computational,
engineering & technology publications
Civil-Comp Conferences
ISSN 2753-3239
CCC: 7
PROCEEDINGS OF THE SIXTH INTERNATIONAL CONFERENCE ON RAILWAY TECHNOLOGY: RESEARCH, DEVELOPMENT AND MAINTENANCE
Edited by: J. Pombo
Paper 4.2

Automated Detection of Vegetation Close to Catenary Wires using LiDAR Data

A.-S. Onody, M. Convert, F. Viguier, N. Abdallah, N. Ben Drihem, R. Guerand, J. Sanchez and B. Salavati

Direction Générale Industrielle et Ingénierie, SNCF Réseau, France

Full Bibliographic Reference for this paper
A.-S. Onody, M. Convert, F. Viguier, N. Abdallah, N. Ben Drihem, R. Guerand, J. Sanchez, B. Salavati, "Automated Detection of Vegetation Close to Catenary Wires using LiDAR Data", in J. Pombo, (Editor), "Proceedings of the Sixth International Conference on Railway Technology: Research, Development and Maintenance", Civil-Comp Press, Edinburgh, UK, Online volume: CCC 7, Paper 4.2, 2024, doi:10.4203/ccc.7.4.2
Keywords: LiDAR, cloud point, random forest, vegetation management, maintenance automation, railway maintenance.

Abstract
The vegetation near railway catenary wires can have various impacts on both the safety and efficiency of the railway system. If vegetation is too close to the catenary wires, it increases the risk of fire, especially during dry periods. Excessive vegetation near catenary wires can lead to electrical interference. This can disrupt the proper functioning of the railway electrical system, affecting trains’ power supply quality. LiDAR plays a crucial role in the detection and analysis of vegetation. This work leverages LiDAR to identify geographical areas where vegetation is close to the catenaries and thus may pose a risk of damaging them. This information will facilitate organizing maintenance and preventing incidents related to vegetation. The process involves the following steps: Determine, within the point cloud, the wire points corresponding to the contact wire and the vegetation points using a classification algorithm. For each vegetation point, compute a deviation corresponding to the shortest distance between the vegetation point and the nearest wire point. Estimate the number of vegetation points associated with deviations lower than a specified threshold distance in order to evaluate the maintenance need at each longitudinal section of the railway track.

download the full-text of this paper (PDF, 9 pages, 1448 Kb)

go to the previous paper
go to the next paper
return to the table of contents
return to the volume description