CCPortal
DOI10.1038/s41598-024-52676-2
Optimising peak energy reduction in networks of buildings
发表日期2024
ISSN2045-2322
起始页码14
结束页码1
卷号14期号:1
英文摘要Buildings are amongst the world's largest energy consumers and simultaneous peaks in demand from networks of buildings can decrease electricity system stability. Current mitigation measures either entail wasteful supply-side over-specification or complex centralised demand-side control. Hence, a simple schema is developed for decentralised, self-organising building-to-building load coordination that requires very little information exchange and no top-down management-analogous to other complex systems with short range interactions, such as coordination between flocks of birds or synchronisation in fireflies. Numerical and experimental results reveal that a high degree of peak flattening can be achieved using surprisingly small load-coordination networks. The optimum reductions achieved by the simple schema can outperform existing techniques, giving substantial peak-reductions as well as being remarkably robust to changes in other system parameters such as the interaction network topology. This not only demonstrates that significant reductions in network peaks are achievable using remarkably simple control systems but also reveals interesting theoretical results and new insights which will be of great interest to the complexity and network science communities.
语种英语
WOS研究方向Science & Technology - Other Topics
WOS类目Multidisciplinary Sciences
WOS记录号WOS:001163729100009
来源期刊SCIENTIFIC REPORTS
文献类型期刊论文
条目标识符http://gcip.llas.ac.cn/handle/2XKMVOVA/293773
作者单位University of Bath
推荐引用方式
GB/T 7714
. Optimising peak energy reduction in networks of buildings[J],2024,14(1).
APA (2024).Optimising peak energy reduction in networks of buildings.SCIENTIFIC REPORTS,14(1).
MLA "Optimising peak energy reduction in networks of buildings".SCIENTIFIC REPORTS 14.1(2024).
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
百度学术
百度学术中相似的文章
必应学术
必应学术中相似的文章
相关权益政策
暂无数据
收藏/分享

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。