• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2016, Vol. 38 ›› Issue (01): 95-101.

• 论文 • 上一篇    下一篇

改进生成树算法的多机器人在线地图覆盖

陈泽涛,戴学丰   

  1. (齐齐哈尔大学计算机与控制工程学院,黑龙江 齐齐哈尔 161006)
  • 收稿日期:2014-11-03 修回日期:2015-05-20 出版日期:2016-01-25 发布日期:2016-01-25
  • 基金资助:

    黑龙江省自然科学基金(F201331)

An improved spanning tree covering algorithm
for multirobot online map coverage 

CHEN Zetao,DAI Xuefeng   

  1. (College of Computer and Control Engineering,Qiqihar University,Qiqihar 161006,China)
  • Received:2014-11-03 Revised:2015-05-20 Online:2016-01-25 Published:2016-01-25

摘要:

研究在线多机器人地图覆盖。在单机器人生成树STC算法基础上做出改进,融入了市场拍卖算法,使机器人团体扩散地生成树,并沿各自生成树完成地图覆盖。通过两种不同环境地图覆盖仿真,结果验证改进后的IMPSTC算法,能够使机器人团队在更少的时间和重复覆盖区域情况下完成在线覆盖地图任务。

关键词: 生成树, 多机器人, 覆盖, 市场拍卖

Abstract:

We discusses multirobot online map coverage. We introduce the market auction algorithm to improve the spanning tree covering algorithm of a single robot, make robot team diffuse a spanning tree and cover the map completely along their own spanning trees. Two simulation experiments are conducted and the results of two different environment map coverage show that the improved spanning tree covering algorithm can make the robot team accomplish online map coverage with less time and less repeated coverage.

Key words: spanning tree;multirobot;coverage;market auction