Please use this identifier to cite or link to this item: https://idr.l2.nitk.ac.in/jspui/handle/123456789/8537
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNair, V.G.
dc.contributor.authorGuruprasad, K.R.
dc.date.accessioned2020-03-30T10:22:24Z-
dc.date.available2020-03-30T10:22:24Z-
dc.date.issued2020
dc.identifier.citationLecture Notes in Electrical Engineering, 2020, Vol.581, , pp.59-66en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/8537-
dc.description.abstractIn this paper we propose Geodesic-VPC, a �partition� and �cover� strategy for a multi-robot system using Voronoi partitioning based on geodesic distance metric in the place of the usual Euclidean distance. Each robot is responsible for covering the corresponding geodesic-Voronoi cell using a single-robot coverage strategy. The proposed partitioning scheme ensures that Voronoi cells are contiguous even in the presence of obstacles. We demonstrate that if the single-robot coverage strategy is capable of providing a complete and non-repetitive coverage, then the proposed Geodesic-VPC strategy provides a complete and non-repetitive coverage. We use spanning tree-based coverage algorithm as the underlying single-robot coverage strategy for the purpose of demonstration, though any existing single-robot coverage algorithm can be used. � 2020, Springer Nature Singapore Pte Ltd.en_US
dc.titleMulti-robot coverage using Voronoi partitioning based on geodesic distanceen_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.