首页 /研究 /Efficient Boustrophedon Multi-Robot Coverage: an algorithmic approach
SWARM

Efficient Boustrophedon Multi-Robot Coverage: an algorithmic approach

Ioannis Rekleitis, Ai Peng New, Edward S. Rankin, Howie Choset

发表年份
2008
引用次数
200

关键词

RobotComputer scienceMobile robotSet (abstract data type)Task (project management)Distributed computingCover (algebra)Greedy algorithmAlgorithmReal-time computing

相关论文

查看 SWARM 分类全部论文