Home /Research /DARP: Divide Areas Algorithm for Optimal Multi-Robot Coverage Path Planning
SWARM

DARP: Divide Areas Algorithm for Optimal Multi-Robot Coverage Path Planning

Athanasios Ch. Kapoutsis, Savvas A. Chatzichristofis, Elias B. Kosmatopoulos

Year
2017
Citations
191

Keywords

RobotMotion planningAlgorithmBacktrackingComputer scienceTime complexityMathematical optimizationPath (computing)Mobile robotComputational complexity theory

Related papers

Browse all SWARM papers