Please use this identifier to cite or link to this item: https://idr.nitk.ac.in/jspui/handle/123456789/6946
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGuruprasad, K.R.
dc.date.accessioned2020-03-30T09:46:28Z-
dc.date.available2020-03-30T09:46:28Z-
dc.date.issued2019
dc.identifier.citationACM International Conference Proceeding Series, 2019, Vol., , pp.-en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/6946-
dc.description.abstractIn this paper, we propose a simple extension to the spanning tree based coverage (STC) algorithm for a mobile robot. The proposed extended spanning tree based coverage (X-STC) algorithm attempts to cover even the partially occupied cells, unlike the spiral-STC, the basic STC algorithm. The properties of the X-STC algorithms are discussed and illustrated with examples. We compare the coverage performance of the proposed X-STC algorithm with two existing STC based algorithms, namely spiral-STC and full-STC. The results show that the proposed algorithm substantially improves the amount of coverage compared to that with the existing STC based algorithms. � 2019 Association for Computing Machinery.en_US
dc.titleX-STC: An extended spanning tree-based coverage algorithm for mobile robotsen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.