Please use this identifier to cite or link to this item: https://idr.l4.nitk.ac.in/jspui/handle/123456789/7752
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHungerford, K.
dc.contributor.authorDasgupta, P.
dc.contributor.authorGuruprasad, K.R.
dc.date.accessioned2020-03-30T10:02:44Z-
dc.date.available2020-03-30T10:02:44Z-
dc.date.issued2014
dc.identifier.citation13th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2014, 2014, Vol.2, , pp.1453-1454en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/7752-
dc.description.abstractWe consider the problem of coverage path planning by multiple robots in an environment where the location and geometry of obstacles are initially unknown to the robots. We propose a novel algorithm where the robots initially partition the environment using Voronoi partitioning. Each robot then uses an auction-based algorithm to reallocate inaccessible portions of its initial Voronoi cell to robots in neighboring Voronoi cells so that each robot is responsible for covering a set of contiguous connected regions. We have verified the performance of our algorithm on e-puck robots within the Webots simulator in different environments with different obstacle geometries and shown that it performs complete, non-overlapping coverage. Copyright � 2014, International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.en_US
dc.titleDistributed, complete, multi-robot coverage of initially unknown environments using repartitioningen_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.