Distributed policies for equitable partitioning: Theory and applications

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2008, Pages 4191-4197

  Pavone, Marco ^a   Frazzoli, Emilio ^a   Bullo, Francesco ^b  

^a Massachusetts Institute of Technology Cambridge   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

STOCHASTIC SYSTEMS;

ADAPTIVE POLICY; DISTRIBUTED POLICIES; DYNAMIC ENVIRONMENTS; EQUITABLE PARTITIONS; LLOYD ALGORITHM; MOBILE MULTI-AGENT SYSTEMS; RESOURCE ALLOCATION STRATEGIES; SERVICE REQUESTS;

MULTI AGENT SYSTEMS;

EID: 62949180244     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2008.4739483     Document Type: Conference Paper

References (18)

1. D. J. Bertsimas and G. J. van Ryzin. Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles. Advances in Applied Probability, 25(4):947-978, 1993.
2. O. Baron, O. Berman, D. Krass, and Q. Wang. The equitable location problem on the plane. European Journal of Operational Research, 183(2):578-590, 2007.
3. B. Liu, Z. Liu, and D. Towsley. On the capacity of hybrid wireless networks. In IEEE INFOCOM 2003, pages 1543-1552, San Francisco, CA, April 2003.
4. J. Carlsson, D. Ge, A. Subramaniam, A. Wu, and Y. Ye. Solving min-max multi-depot vehicle routing problem. Report, 2007.
5. S. P. Lloyd. Least-squares quantization in PCM. IEEE Trans. Information Theory, 28(2):129-137, 1982.
6. A. Kwok and S. Martinez. Energy-balancing cooperative strategies for sensor deployment. In Proc. IEEE Conf. on Decision and Control, pages 6136-6141, New Orleans, LA, December 2007.
7. J.G. Carlsson, B. Armbruster, and Y. Ye. Finding equitable convex partitions of points in a polygon efficiently. To appear in The ACM Transactions on Algorithms, 2008.
8. I. Chavel. Eigenvalues in Riemannian Geometry. Academic Press, New York, NY, 1984.
9. A. Okabe, B. Boots, K. Sugihara, and S. N. Chiu. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley & Sons, New York, NY, 2000.
10. H. Imai, M. Iri, and K. Murota. Voronoi diagram in the Laguerre geometry and its applications. SIAM Journal on Computing, 14(1):93-105, 1985.
11. F. Aurenhammer. Power diagrams: properties, algorithms and applications. SIAM Journal on Computing, 16(1):78-96, 1987.
12. M. Cao and C. N. Hadjicostis. Distributed algorithms for Voronoi diagrams and applications in ad-hoc networks. Technical Report UILU-ENG-03-2222, UIUC Coordinated Science Laboratory, 2003.
13. M. Pavone, E. Frazzoli, and F. Bullo. Decentralized algorithms for stochastic and dynamic vehicle routing with general demand distribution. In Proc. IEEE Conf. on Decision and Control, pages 4869-4874, New Orleans, LA, December 2007.
14. A. Bressan. Personal Communication, 2008.
15. J. Cortés, S. Mart́nez, T. Karatas, and F. Bullo. Coverage control for mobile sensing networks. IEEE Transactions On Robotics and Automation, 20(2):243-255, 2004.
16. Q. Du, V. Faber, and M. Gunzburger. Centroidal voronoi tessellations: Applications and algorithms. SIAM Review, 41(4):637-676, 1999.
17. D. J. Bertsimas and G. J. van Ryzin. Stochastic and dynamic vehicle routing with general interarrival and service time distributions. Advances in Applied Probability, 25:947-978, 1993.
18. H. Xu. Optimal policies for stochastic and dynamic vehicle routing problems. Dept. of Civil and Environmental Engineering, Massachusetts Institute of Technology, Cambridge, MA., 1995.