Show simple item record

dc.contributor.authorPatel, Rushabh
dc.contributor.authorFrasca, Paolo
dc.contributor.authorBullo, Francesco
dc.date.accessioned2017-05-09T01:06:27Z
dc.date.available2017-05-09T01:06:27Z
dc.date.issued2014
dc.identifier.issn0022-0434
dc.identifier.otherds_136_03_031024.pdf
dc.identifier.urihttp://yetl.yabesh.ir/yetl/handle/yetl/154339
dc.description.abstractWe consider the problem of optimal coverage with areaconstraints in a mobile multiagent system. For a planar environment with an associated density function, this problem is equivalent to dividing the environment into optimal subregions such that each agent is responsible for the coverage of its own region. In this paper, we design a continuoustime distributed policy which allows a team of agents to achieve a convex areaconstrained partition of a convex workspace. Our work is related to the classic Lloyd algorithm, and makes use of generalized Voronoi diagrams. We also discuss practical implementation for real mobile networks. Simulation methods are presented and discussed.
dc.publisherThe American Society of Mechanical Engineers (ASME)
dc.titleCentroidal Area Constrained Partitioning for Robotic Networks
dc.typeJournal Paper
dc.journal.volume136
dc.journal.issue3
dc.journal.titleJournal of Dynamic Systems, Measurement, and Control
dc.identifier.doi10.1115/1.4026344
dc.journal.fristpage31024
dc.journal.lastpage31024
dc.identifier.eissn1528-9028
dc.treeJournal of Dynamic Systems, Measurement, and Control:;2014:;volume( 136 ):;issue: 003
dc.contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record