首页 /研究 /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

发表年份
2017
引用次数
191

关键词

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

相关论文

查看 SWARM 分类全部论文