• Login
    View Item 
    •   DSpace Home
    • ASME
    • Journal of Dynamic Systems, Measurement, and Control
    • View Item
    •   DSpace Home
    • ASME
    • Journal of Dynamic Systems, Measurement, and Control
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Centroidal Area Constrained Partitioning for Robotic Networks

    Thumbnail
    View/Open
    ds_136_03_031024.pdf (452.5Kb)
    Date
    2014
    Author
    Patel, Rushabh
    Frasca, Paolo
    Bullo, Francesco
    Metadata
    Show full item record
    Abstract
    We 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.
    URI
    http://yetl.yabesh.ir/yetl/handle/yetl/154339
    Collections
    • Journal of Dynamic Systems, Measurement, and Control

    DSpace software copyright © 2002-2015  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    @mire NV
     

     

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Statistics

    View Usage Statistics

    DSpace software copyright © 2002-2015  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    @mire NV