![](/jspui/image/dspace_header.jpg)
Please use this identifier to cite or link to this item:
https://idr.l3.nitk.ac.in/jspui/handle/123456789/7009
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Mohammad, Minhaz, Falaki, P.M. | |
dc.contributor.author | Padman, A. | |
dc.contributor.author | Nair, V.G. | |
dc.contributor.author | Guruprasad, K.R. | |
dc.date.accessioned | 2020-03-30T09:46:37Z | - |
dc.date.available | 2020-03-30T09:46:37Z | - |
dc.date.issued | 2020 | |
dc.identifier.citation | Lecture Notes in Electrical Engineering, 2020, Vol.581, , pp.33-41 | en_US |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/7009 | - |
dc.description.abstract | In this paper, we propose a problem of simultaneous exploration and coverage for a mobile robot, combining the problems of area coverage with exploration and mapping. The primary task here is to completely cover an initially unknown region. Here we combine the advantages of online and off-line coverage path planning algorithms by using the exploration as an aid. The robots perform intermittent exploration during coverage in order to update the map of the environment, which in turn is used to generate the coverage path. We illustrate and demonstrate the problem using the off-line version of Spanning Tree Coverage algorithm with a frontier-based exploration strategy. The simulation results demonstrate that the robot successfully achieves complete and non-repetitive coverage. � 2020, Springer Nature Singapore Pte Ltd. | en_US |
dc.title | Simultaneous exploration and coverage by a mobile robot | 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.