Centroidal area-constrained partitioning for robotic networks

Rushabh Patel, Paolo Frasca, Francesco Bullo

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    3 Citations (Scopus)
    64 Downloads (Pure)

    Abstract

    We consider the problem of optimal coverage with area constraints in a mobile multi-agent 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 continuous-time distributed policy which allows a team of agents to achieve a convex area-constrained 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.
    Original languageUndefined
    Title of host publicationProceedings of the ASME 2013 6th Annual Dynamic Systems and Control Conference
    Place of PublicationUSA
    PublisherAmerican Society of Mechanical Engineers (ASME)
    Pages-
    Number of pages5
    ISBN (Print)not assigned
    Publication statusPublished - Oct 2013
    EventASME 2013 6th Annual Dynamic Systems and Control Conference - Stanford, CA, USA
    Duration: 21 Oct 201323 Oct 2013

    Publication series

    Name
    PublisherAmerican Society of Mechanical Engineers (ASME)

    Conference

    ConferenceASME 2013 6th Annual Dynamic Systems and Control Conference
    Period21/10/1323/10/13
    Other21-23 October 2013

    Keywords

    • EWI-24166
    • METIS-300251
    • IR-88317

    Cite this