Please use this identifier to cite or link to this item: http://idr.nitk.ac.in/jspui/handle/123456789/10164
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNair, V.G.
dc.contributor.authorGuruprasad, K.R.
dc.date.accessioned2020-03-31T08:18:40Z-
dc.date.available2020-03-31T08:18:40Z-
dc.date.issued2018
dc.identifier.citationInternational Journal of Engineering and Technology(UAE), 2018, Vol.7, 2, pp.135-139en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/10164-
dc.description.abstractThis paper addresses the problem of Voronoi partitioning using Centroidal Voronoi configuration for a multi-robotic coverage strategy known as Voronoi Partition based Coverage (VPC) algorithm. In VPC, the area to be covered is divided into Voronoi cells and each robot covers the corresponding cell. We use the concept of Centroidal Voronoi Configuration (CVC) to achieve a more uniform load distribution among the robots in terms of the area covered. Instead of the robots moving physically into the CVC, we introduce a concept of virtual nodes, which are deployed into CVC. Once the Voronoi partition is created based on the virtual nods, the robots cover the corresponding Voronoi cells. A gradient based control law has been used for deployment of the virtual nodes. Simulation results are provided to demonstrate the proposed deployment and partitioning scheme. 2016 Authors.en_US
dc.titleCentroidal voronoi partitioning using virtual nodes for multirobot coverageen_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

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.