Logga in
insikt - Multi-Robot Coverage Path Planning
Large-Scale Multi-Robot Coverage Path Planning on Grids with Path Deconfliction: An Algorithmic Framework
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.
Large-Scale Multi-Robot Coverage Path Planning via Local Search
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.
Produkter
© 2024 by Linnk AI