ST-CTC: A spanning tree-based competitive and truly complete coverage algorithm for mobile robots

Simple item page
dc.contributor.authorGuruprasad, K.R.
dc.contributor.authorRanjitha, T.D.
dc.date.accessioned2026-02-06T06:39:32Z
dc.date.issued2015
dc.description.abstractIn this paper, we propose a new robot coverage algorithm using approximate cellular decomposition. While in most coverage algorithms using approximate cellular decomposition, only a resolution-complete coverage is achievable, the proposed algorithm achieves complete coverage in true sense by covering even partially occupied cells, with minimal (or no) overlapping/retracing of the path. The algorithm is implemented at graph level in Matlab. Further, the performance of the proposed algorithm is compared with that of STC and Competitive-STC, two representative approximate cellular decomposition based coverage algorithms reported in the literature. © 2015 ACM.
dc.identifier.citationACM International Conference Proceeding Series, 2015, Vol.02-04-July-2015, , p. -
dc.identifier.issn21531633
dc.identifier.urihttps://doi.org/10.1145/2783449.2783492
dc.identifier.urihttps://idr.nitk.ac.in/handle/123456789/32352
dc.publisherAssociation for Computing Machinery acmhelp@acm.org
dc.subjectCoverage path planning
dc.subjectMinor nodes
dc.subjectSpanning tree
dc.subjectTruly-complete coverage
dc.titleST-CTC: A spanning tree-based competitive and truly complete coverage algorithm for mobile robots

Files

Collections

Conference Papers