TL;DR
This paper introduces an energy-efficient multi-robot coverage path planning framework for complex non-convex regions, outperforming existing methods in energy use and scalability, demonstrated through real-world experiments.
Contribution
The proposed MRCPP framework innovates by integrating global swath generation, safe turning buffers, workload balancing with an mTSP solver, and a modified visibility graph for disjoint segments.
Findings
Reduces energy consumption by 3% to 40% compared to state-of-the-art.
Decreases computation time by an order of magnitude.
Maintains balanced workload and scalability across multiple robots.
Abstract
This letter presents an energy-efficient multi-robot coverage path planning (MRCPP) framework for large, nonconvex Regions of Interest (ROI) containing obstacles and no-fly zones (NFZ). Existing minimum-energy coverage planning algorithms utilize meta-heuristic boustrophedon workspace decomposition. Therefore, even with minimum energy objectives and energy consumption constraints, they cannot achieve optimal energy efficiency. Moreover, most existing frameworks support only a single type of robotic platform. MRCPP overcomes these limitations by: generating globally-informed swath generation, creating parallel sweeping paths with minimal turns, calculating safety buffers to ensure safe turning clearance, using an efficient mTSP solver to balance workloads and minimize mission time, and connecting disjoint segments via a modified visibility graph that tracks heading angles while…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
