首页 /研究 /A Repartitioning Algorithm to Guarantee Complete, Non-overlapping Planar Coverage with Multiple Robots
OTHER

A Repartitioning Algorithm to Guarantee Complete, Non-overlapping Planar Coverage with Multiple Robots

Kurt Hungerford, Prithviraj Dasgupta, K. R. Guruprasad

发表年份
2016
引用次数
13

关键词

Voronoi diagramRobotObstacleComputer sciencePath (computing)A priori and a posterioriMotion planningMobile robotAlgorithmPlanar

相关论文

查看 OTHER 分类全部论文