Distributed policies for equitable partitioning: Theory and applications

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) each agent is assigned to a unique subregion, and (iii) each agent is responsible for service requests originating within its own subregion. In this paper, we design distributed and adaptive policies to allow a team of agents to achieve a convex and equitable partition of a convex workspace. Our approach is related to the classic Lloyd algorithm, and exploits the unique features of Power Diagrams. We discuss possible applications to routing of vehicles in stochastic and dynamic environments, and to wireless networks. Simulation results are presented and discussed.

[1]  Emilio Frazzoli,et al.  Decentralized algorithms for stochastic and dynamic vehicle routing with general demand distribution , 2007, 2007 46th IEEE Conference on Decision and Control.

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

[3]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

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

[5]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[6]  Sonia Martínez,et al.  Energy-balancing cooperative strategies for sensor deployment , 2007, 2007 46th IEEE Conference on Decision and Control.

[7]  Sonia Martínez,et al.  Coverage control for mobile sensing networks , 2002, IEEE Transactions on Robotics and Automation.

[8]  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).

[9]  I. Chavel.  Eigenvalues in Riemannian geometry , 1984 .

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

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

[12]  Qiang Du,et al.  Centroidal Voronoi Tessellations: Applications and Algorithms , 1999, SIAM Rev..

[13]  Yinyu Ye,et al.  Finding equitable convex partitions of points in a polygon efficiently , 2010, TALG.

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

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

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

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