Equitable partitioning policies for robotic networks
Author(s)
Frazzoli, Emilio; Pavone, Marco; Bullo, Francesco; Arsie, Alessandro
DownloadPavone-2009-Equitable partitioning policies for robotic networks.pdf (330.6Kb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
The most widely applied resource allocation strategy is to balance, or equalize, the total workload assigned to each resource. In mobile multi-agent systems, this principle directly leads to equitable partitioning policies in which (i) the workspace is divided into subregions of equal measure, (ii) there is a bijective correspondence between agents and subregions, and (iii) each agent is responsible for service requests originating within its own subregion. In this paper, we provide the first distributed algorithm that provably allows m agents to converge to an equitable partition of the workspace, from any initial configuration, i.e., globally. Our approach is related to the classic Lloyd algorithm, and provides novel insights into the properties of power diagrams. Simulation results are presented and discussed.
Date issued
2009-07Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics; Massachusetts Institute of Technology. Laboratory for Information and Decision SystemsJournal
IEEE International Conference on Robotics and Automation, 2009. ICRA '09
Publisher
Institute of Electrical and Electronics Engineers
Citation
Pavone, M. et al. “Equitable partitioning policies for robotic networks.” Robotics and Automation, 2009. ICRA '09. IEEE International Conference on. 2009. 2356-2361. ©2009 IEEE.
Version: Final published version
Other identifiers
INSPEC Accession Number: 10748841
ISBN
978-1-4244-2788-8
ISSN
1050-4729