Please use this identifier to cite or link to this item:
https://idr.nitk.ac.in/jspui/handle/123456789/6644Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Guruprasad, K.R. | |
| dc.contributor.author | Ranjitha, T.D. | |
| dc.date.accessioned | 2020-03-30T09:45:56Z | - |
| dc.date.available | 2020-03-30T09:45:56Z | - |
| dc.date.issued | 2015 | |
| dc.identifier.citation | ACM International Conference Proceeding Series, 2015, Vol.02-04-July-2015, , pp.- | en_US |
| dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/6644 | - |
| dc.description.abstract | In 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. | en_US |
| dc.title | ST-CTC: A spanning tree-based competitive and truly complete coverage algorithm for mobile robots | en_US |
| dc.type | Book chapter | en_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.