# Complete and Near-Optimal Robotic Crack Coverage and Filling in Civil Infrastructure

Source: [Complete and Near-Optimal Robotic Crack Coverage and Filling in Civil Infrastructure](<https://www.sota2.com/research/paper/68fa74f71e209131cea64e43>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2026-03-18T05:00:11.457Z

Authors: Vishnu Veeraraghavan, Kyle Hunte, Jingang Yi, Kaiyan Yu

Published: 2024-03-01T15:38:26.000Z

## Abstract

We present a simultaneous sensor-based inspection and footprint coverage (SIFC) planning and control design with applications to autonomous robotic crack mapping and filling. The main challenge of the SIFC problem lies in the coupling of complete sensing (for mapping) and robotic footprint (for filling) coverage tasks. Initially, we assume known target information (e.g., cracks) and employ classic cell decomposition methods to achieve complete sensing coverage of the workspace and complete robotic footprint coverage using the least-cost route. Subsequently, we generalize the algorithm to handle unknown target information, allowing the robot to scan and incrementally construct the target map online while conducting robotic footprint coverage. The online polynomial-time SIFC planning algorithm minimizes the total robot traveling distance, guarantees complete sensing coverage of the entire workspace, and achieves near-optimal robotic footprint coverage, as demonstrated through experiments. For the demonstrated application, we design coordinated nozzle motion control with the planned robot trajectory to efficiently fill all cracks within the robot's footprint. Experimental results illustrate the algorithm's design, performance, and comparisons. The SIFC algorithm offers a high-efficiency motion planning solution for various robotic applications requiring simultaneous sensing and actuation coverage.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

- [Coverage path planning for crack filling on U100 crack map](<https://www.sota2.com/research/sota/coverage-path-planning-for-crack-filling-on-u100-crack-map.md>): Coverage path planning for crack filling; U100 crack map; Robot Path Length (m): 29.

- [Coverage path planning for crack filling on U80 crack map](<https://www.sota2.com/research/sota/coverage-path-planning-for-crack-filling-on-u80-crack-map.md>): Coverage path planning for crack filling; U80 crack map; Robot Path Length (m): 17.

- [Coverage path planning for crack filling on G100 crack map](<https://www.sota2.com/research/sota/coverage-path-planning-for-crack-filling-on-g100-crack-map.md>): Coverage path planning for crack filling; G100 crack map; Robot Path Length (m): 13.

- [Coverage path planning for crack filling on G20 crack map](<https://www.sota2.com/research/sota/coverage-path-planning-for-crack-filling-on-g20-crack-map.md>): Coverage path planning for crack filling; G20 crack map; Robot Path Length (m): 12.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2403.00613>)

[PDF](<https://arxiv.org/pdf/2403.00613.pdf>)
