Balanced Line Coverage in Large-scale Urban Scene
Hangsong Su, Feng Xue, Runze Guo, Anlong Ming

TL;DR
This paper introduces a heterogeneous multi-robot system with novel graph partitioning algorithms to efficiently cover large-scale urban linear infrastructure, significantly reducing time costs and improving robot utilization.
Contribution
It proposes balanced graph and ulusoy partitioning algorithms for effective large-scale urban line coverage using heterogeneous robots, addressing energy and imbalance issues.
Findings
Achieves 90% robot utilization
Minimizes total tour length with small increase in maximum tour length
Reduces overall time cost in large urban scenes
Abstract
Line coverage is to cover linear infrastructure modeled as 1D segments by robots, which received attention in recent years. With the increasing urbanization, the area of the city and the density of infrastructure continues to increase, which brings two issues: (1) Due to the energy constraint, it is hard for the homogeneous robot team to cover the large-scale linear infrastructure starting from one depot; (2) In the large urban scene, the imbalance of robots' path greatly extends the time cost of the multi-robot system, which is more serious than that in smaller-size scenes. To address these issues, we propose a heterogeneous multi-robot approach consisting of several teams, each of which contains one transportation robot (TRob) and several coverage robots (CRobs). Firstly, a balanced graph partitioning (BGP) algorithm is proposed to divide the road network into several similar-size…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topics3D Modeling in Geospatial Applications · Remote Sensing and LiDAR Applications · Data Management and Algorithms
