Equitable partitioning policies for robotic networks

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.

[1]  Donald F. Towsley,et al.  On the capacity of hybrid wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[2]  Dimitris Bertsimas,et al.  Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles , 1993, Oper. Res..

[3]  Qian Wang,et al.  The equitable location problem on the plane , 2007, Eur. J. Oper. Res..

[4]  Emilio Frazzoli,et al.  Distributed policies for equitable partitioning: Theory and applications , 2008, 2008 47th IEEE Conference on Decision and Control.

[5]  Jorge Cortes,et al.  Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms , 2009 .

[6]  Donald J. Newman,et al.  The hexagon theorem , 1982, IEEE Trans. Inf. Theory.

[7]  Franz Aurenhammer,et al.  Power Diagrams: Properties, Algorithms and Applications , 1987, SIAM J. Comput..

[8]  R. Ho.  Algebraic Topology , 2022 .

[9]  Hiroshi Imai,et al.  Voronoi Diagram in the Laguerre Geometry and its Applications , 1985, SIAM J. Comput..

[10]  Emilio Frazzoli,et al.  Equitable Partitioning Policies for Mobile Robotic Networks , 2009, ArXiv.

[11]  Francesco Bullo,et al.  Distributed Control of Robotic Networks , 2009 .

[12]  Haiping Xu.  Optimal policies for stochastic and dynamic vehicle routing problems , 1994 .

[13]  D. Bertsimas,et al.  Stochastic and dynamic vehicle routing with general demand and interarrival time distributions , 1993, Advances in Applied Probability.

[14]  Christoforos N. Hadjicostis,et al.  Distributed Algorithms for Voronoi Diagrams and Applications in Ad-hoc Networks , 2003 .

[15]  John Gunnar Carlsson,et al.  Solving Min-Max Multi-Depot Vehicle Routing Problem ⁄ , 2007 .