Message passing for optimization and control of a power grid: Model of a distribution system with redundancy

Physical Review E - Statistical, Nonlinear, and Soft Matter Physics

Volumn 80, Issue 4, 2009, Pages

  Zdeborová, Lenka ^a   Decelle, Aurélien ^a,b   Chertkov, Michael ^a  

^a CENTER FOR NONLINEAR STUDIES   (United States)

^b UNIVERSITÉ PARIS SUD   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC LIMITS; ASYMPTOTICALLY OPTIMAL; BIPARTITE GRAPHS; CONSUMER DEMANDS; DESIGN HEURISTICS; DISTRIBUTION SYSTEMS; GRAPH COVERING; GRAPHICAL MODEL; GRID OPTIMIZATION; LOAD FLUCTUATIONS; MAXIMUM POWER; OPTIMIZATION AND CONTROL; POWER GRID MODELS; POWER GRIDS; REALISTIC MODELING;

ASYMPTOTIC ANALYSIS; ELECTRIC POWER TRANSMISSION NETWORKS; GRAPHIC METHODS; HEURISTIC ALGORITHMS; MESSAGE PASSING; OPTIMIZATION; POWER GENERATION; SET THEORY;

GRAPH THEORY;

EID: 70449124108     PISSN: 15393755     EISSN: 15502376     Source Type: Journal    
DOI: 10.1103/PhysRevE.80.046112     Document Type: Article

References (40)

1. The Smart Grid: An Introduction, 2008, (http://www.oe.energy.gov/1165. htm).
2. Smart Grid at Wikipedia (http://en.wikipedia.org/wiki/Smart-grid).
3. M. Amin and S. Wollenberg, Power and Energy Mag. 3, 34 (2005). 10.1109/MPAE.2005.1507024
4. M. Ilic, Proc. IEEE 95, 1060 (2007). 10.1109/JPROC.2007.894711
5. S. Amin, Power and Energy Mag. 6, 48 (2008). 10.1109/MPE.2008.929745
6. C. Shannon, Bell Syst. Tech. J. 27, 379 (1948).
7. A. J. Wood and B. F. Wollenberg, Power Generation Operation And Control, 2nd ed (Elsevier, New York, 1996).
8. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms (MIT Press, New York, 1990).
9. R. Baldick and W. Hogan, University of California Energy Institute, 2001.
10. M. Mézard and G. Parisi, J. Phys. Lett. 46, L771 (1985). 10.1051/jphyslet:019850046017077100
11. M. Mézard and G. Parisi, Eur. Phys. J. B 20, 217 (2001). 10.1007/PL00011099
12. M. Mezard, G. Parisi, and R. Zecchina, Science 297, 812 (2002) 10.1126/science.1073287
13. T. Richardson and R. Urbanke, Modern Coding Theory (Cambridge University Press, Cambridge, 2008).
14. M. Mezard and A. Montanari, Information, Physics, and Computation (Oxford University Press, Oxford, 2009).
15. H. Bethe, Proc. R. Soc. Lond. A Math. Phys. Sci. 150, 552 (1935). 10.1098/rspa.1935.0122
16. H. Peierls, Math. Proc. Cambridge Philos. Soc. 32, 477 (1936). 10.1017/S0305004100019174
17. R. Gallager, Low Density Parity Check Codes (MIT PressCambridhe, MA, 1963).
18. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference (Morgan Kaufmann, Palo Alto, CA, 1988).
19. B. Lehmann, D. Lehmann, and N. Nisan, Games Econ. Behav. 55, 270 (2006). 10.1016/j.geb.2005.02.006
20. N. Andelman and Y. Mansour, in Algorithm Theory-SWAT 2004 (Springer, Heidelberg, 2004), pp. 26 - 36.
21. Y. Azar, B. Birnbaum, A. Karlin, C. Mathieu, and C. Nguyen, Lecture Notes in Computer Science 5125 (Springer, New York, 2008), p. 186.
22. F. Altarelli, A. Braunstein, J. Realpe-Gomez, and R. Zecchina, J. Stat. Mech. (2009) P07002. 10.1088/1742-5468/2009/07/P07002
23. K. Talwar and U. Wieder, STOC '07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (ACM, New York, NY, 2007), pp. 256-265.
24. P. Berenbrink, T. Friedetzky, Z. Hu, and R. Martin, Theor. Comput. Sci. 409, 511 (2008). 10.1016/j.tcs.2008.09.023
25. P. Sanders, S. Egner, and J. Korst, in SODA '00: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia, PA, 2000), pp. 849-858.
26. J. Yedidia, W. Freeman, and Y. Weiss, Generalized Belief Propagation (MIT Press, Cambridge, MA, 2001), Vol. 13, pp. 689-695.
27. L. Zdeborovà, Acta Physica Slovaca 59, 169 (2009).
28. B. Selman, H. A. Kautz, and B. Cohen, in Proceedings of the 12th AAAI (AAAI Press, Menlo Park, CA, USA, 1994), pp. 337-343.
29. J. Ardelius and E. Aurell, Phys. Rev. E 74, 037702 (2006). 10.1103/PhysRevE.74.037702
30. J. Chavas, C. Furtlehner, M. Mézard, and R. Zecchina, J. Stat. Mech. (2005) P11016. 10.1088/1742-5468/2005/11/P11016
31. A. Braunstein and R. Zecchina, Phys. Rev. Lett. 96, 030201 (2006). 10.1103/PhysRevLett.96.030201
32. B. Bollobas, Modern Graph Theory (Springer, New York, 1998).
33. R. Walawalkar, S. Blumsack, J. Apt, and S. Fernands, Energy Policy 36, 3692 (2008). 10.1016/j.enpol.2008.06.036
34. M. Huneault and F. Galiana, IEEE Trans. Power Syst. 6, 762 (1991). 10.1109/59.76723
35. K. Pandya and S. Joshi, J. Theor. Appl. Tech., 4 pp. 450 (2008).
36. F. Hutter, B. Ng, and R. Dearden, Incremental Thin Junction Trees for Dynamic Bayesian Networks, 2004, (http://www.eecs.harvard.edu/bmng/papers/tud- tr04-itjt.pdf).
37. I. Dobson, B. A. Carreras, V. E. Lynch, and D. E. Newman, Chaos 17, 026103 (2007). 10.1063/1.2737822
38. P. Hines and S. Talukdar, Proceedings of the International Conference on Infrastructure Systems, Rotterdam, 2008 (unpublished).
39. V. Chernyak, M. Chertkov, M. G. Stepanov, and B. Vasic, Phys. Rev. Lett. 93, 198702 (2004). 10.1103/PhysRevLett.93.198702
40. M. Chertkov and M. Stepanov, IEEE Trans. Inf. Theory 54, 1514 (2008). 10.1109/TIT.2008.917682