1 resultado para Grapes -- Cluster thinning
em CaltechTHESIS
Filtro por publicador
- Aberystwyth University Repository - Reino Unido (2)
- Academic Research Repository at Institute of Developing Economies (9)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (10)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (10)
- Andina Digital - Repositorio UASB-Digital - Universidade Andina Simón Bolívar (1)
- Aquatic Commons (1)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (11)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (6)
- Biblioteca Digital | Sistema Integrado de Documentación | UNCuyo - UNCUYO. UNIVERSIDAD NACIONAL DE CUYO. (5)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (17)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (17)
- Biblioteca Valenciana Digital - Ministerio de Educación, Cultura y Deporte - Valencia - Espanha (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (66)
- Boston University Digital Common (2)
- Brock University, Canada (8)
- Bucknell University Digital Commons - Pensilvania - USA (3)
- CaltechTHESIS (1)
- Cámara de Comercio de Bogotá, Colombia (2)
- Cambridge University Engineering Department Publications Database (47)
- CentAUR: Central Archive University of Reading - UK (62)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (82)
- Clark Digital Commons--knowledge; creativity; research; and innovation of Clark University (1)
- Cochin University of Science & Technology (CUSAT), India (7)
- Collection Of Biostatistics Research Archive (3)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (16)
- CORA - Cork Open Research Archive - University College Cork - Ireland (1)
- Dalarna University College Electronic Archive (3)
- Deakin Research Online - Australia (152)
- Department of Computer Science E-Repository - King's College London, Strand, London (1)
- DI-fusion - The institutional repository of Université Libre de Bruxelles (2)
- Digital Commons - Michigan Tech (1)
- Digital Repository at Iowa State University (1)
- DigitalCommons@The Texas Medical Center (5)
- DigitalCommons@University of Nebraska - Lincoln (2)
- Diposit Digital de la UB - Universidade de Barcelona (3)
- Duke University (4)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (5)
- FAUBA DIGITAL: Repositorio institucional científico y académico de la Facultad de Agronomia de la Universidad de Buenos Aires (1)
- Greenwich Academic Literature Archive - UK (5)
- Helda - Digital Repository of University of Helsinki (8)
- Indian Institute of Science - Bangalore - Índia (50)
- Instituto Politécnico do Porto, Portugal (6)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (2)
- Massachusetts Institute of Technology (1)
- Ministerio de Cultura, Spain (3)
- National Center for Biotechnology Information - NCBI (30)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (5)
- Publishing Network for Geoscientific & Environmental Data (26)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (103)
- Queensland University of Technology - ePrints Archive (68)
- Repositório Científico da Universidade de Évora - Portugal (1)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (4)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (1)
- Repositório Digital da Universidade Municipal de São Caetano do Sul - USCS (5)
- Repositório Institucional da Universidade de Aveiro - Portugal (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (55)
- Research Open Access Repository of the University of East London. (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (2)
- Savoirs UdeS : plateforme de diffusion de la production intellectuelle de l’Université de Sherbrooke - Canada (1)
- Universidad Autónoma de Nuevo León, Mexico (2)
- Universidad del Rosario, Colombia (6)
- Universidad Politécnica de Madrid (8)
- Universidade Federal do Pará (2)
- Universidade Metodista de São Paulo (2)
- Universidade Técnica de Lisboa (1)
- Universitat de Girona, Spain (2)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (5)
- Université de Lausanne, Switzerland (6)
- Université de Montréal, Canada (3)
- WestminsterResearch - UK (1)
Resumo:
Real-time demand response is essential for handling the uncertainties of renewable generation. Traditionally, demand response has been focused on large industrial and commercial loads, however it is expected that a large number of small residential loads such as air conditioners, dish washers, and electric vehicles will also participate in the coming years. The electricity consumption of these smaller loads, which we call deferrable loads, can be shifted over time, and thus be used (in aggregate) to compensate for the random fluctuations in renewable generation.
In this thesis, we propose a real-time distributed deferrable load control algorithm to reduce the variance of aggregate load (load minus renewable generation) by shifting the power consumption of deferrable loads to periods with high renewable generation. The algorithm is model predictive in nature, i.e., at every time step, the algorithm minimizes the expected variance to go with updated predictions. We prove that suboptimality of this model predictive algorithm vanishes as time horizon expands in the average case analysis. Further, we prove strong concentration results on the distribution of the load variance obtained by model predictive deferrable load control. These concentration results highlight that the typical performance of model predictive deferrable load control is tightly concentrated around the average-case performance. Finally, we evaluate the algorithm via trace-based simulations.