Two-stage algorithm for automatic repair of pavement cracks

Purpose To develop an automated system for identifying and repairing cracks in asphalt pavements, addressing the urgent need for efficient pavement maintenance solutions amidst increasing workloads and decreasing budgets. Design/methodology/approach The research was conducted in two main stages: Crack identification: Utilizing the U-Net deep learning model for pixel-level segmentation to identify pavement cracks, followed by morphological operations such as thinning and spur removal to refine the crack trajectories. Automated crack repair path planning: Developing an enhanced hybrid ant colony greedy algorithm (EAC-GA), which integrates the ant colony (AC) algorithm, greedy algorithm (GA) and three local enhancement strategies – PointsExchange, Cracks2OPT and Nearby Cracks 2OPT – to plan the most efficient repair paths with minimal redundant distance. Findings The EAC-GA demonstrated significant advantages in solution quality compared to the GA, the traditional AC and the AC-GA. Experimental validation on repair areas with varying numbers of cracks (16, 26 and 36) confirmed the effectiveness and scalability of the proposed method. Originality/value The originality of this research lies in the application of advanced deep learning and optimization algorithms to the specific problem of pavement crack repair. The value is twofold: Technological innovation in the field of pavement maintenance, offering a more efficient and automated approach to a common and costly issue. The potential for significant economic and operational benefits, particularly in the context of reduced maintenance budgets and increasing maintenance demands.