Please use this identifier to cite or link to this item: https://idr.l1.nitk.ac.in/jspui/handle/123456789/16449
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNair V.G.
dc.contributor.authorGuruprasad K.R.
dc.date.accessioned2021-05-05T10:30:31Z-
dc.date.available2021-05-05T10:30:31Z-
dc.date.issued2020
dc.identifier.citationComputers and Electrical Engineering Vol. 85 , , p. -en_US
dc.identifier.urihttps://doi.org/10.1016/j.compeleceng.2020.106680
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/16449-
dc.description.abstractIn this paper, we present a novel problem of simultaneous exploration and area coverage by multiple cooperating mobile robots. As the robots cover an initially unknown region, they perform intermittent exploration of the region and build a map, which in turn is used to plan the coverage path. We use a Voronoi partition based multi-robot coverage strategy using the Manhattan distance metric to solve the coverage problem and a frontier based exploration strategy for exploration mapping. We provide results of simulation using Matlab/V-rep environments to demonstrate the proposed multi-robot simultaneous exploration and coverage (MR-SimExCoverage) problem using the spanning tree based coverage (STC) algorithm. © 2020 Elsevier Ltden_US
dc.titleMR-SimExCoverage: Multi-robot Simultaneous Exploration and 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.