
This research proposes a novel algorithmic framework, LS-MCPP, for optimizing multi-robot coverage path planning on grid graphs, addressing limitations of traditional approaches by directly optimizing paths on the grid and incorporating conflict resolution.


coremsg

large-scale-multi-robot-coverage-path-planning-on-grids-with-path-deconfliction-an-algorithmic-framework


Large-Scale Multi-Robot Coverage Path Planning on Grids with Path Deconfliction: An Algorithmic Framework


title_rewrite


The author introduces LS-MCPP, a local search framework that explores MCPP solutions directly on decomposed graphs, showcasing significant improvements in efficiency and solution quality.


Large-Scale-Multi-Robot-Coverage-Path-Planning-via-Local-Search


Large-Scale Multi-Robot Coverage Path Planning via Local Search
