Pseudo Spanning Tree-based Complete and Competitive Robot Coverage using Virtual Nodes

详细信息    查看全文

• 作者：T.D. Ranjitha ^{ranjithatd.26@gmail.com" class="auth_mail" title="E-mail the corresponding author} ; K.R. Guruprasad ^{krgprao@gmail.com" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Coverage path planning ; Pseudo spanning tree ; robot motion planning
• 刊名：IFAC-PapersOnLine
• 出版年：2016
• 出版时间：2016
• 年：2016
• 卷：49
• 期：1
• 页码：195-200
• 全文大小：439 K

文摘

In this paper, we propose a new robot coverage algorithm using approximate cellular decomposition. The algorithm uses spanning tree on adjacency graph formed by the decomposed cells. We introduce a concept of a virtual node corresponding to a partially occupied cell, leading to a pseudo spanning tree. Unlike the existing approximate cellular decomposition based coverage algorithms reported in the literature, the proposed algorithm ensures complete coverage of even partially occupied cells, with minimal (or no) overlapping/retracing of the path. The algorithm is illustrated using examples comparing its coverage performance with that of the STC and Competitive-STC algorithms, two spanning tree based coverage algorithms using approximate cellular decomposition reported in the literature.