Abstract
This letter illustrates two multi-agent greedy demand-side response control schemes for networks of Thermostatically Controlled Loads. The objective is to provide simple but effective local control actions such that the overall power consumption tracks an aggregated desired profile. Compared with the existing literature the novelties are twofold. Since model-free, our schemes possess certain robustness features to the model deterioration and exogenous disturbances. Since greedy, they are of easy implementation also on cheap development boards which do not support optimization software, moreover because asynchronous do not require any network-wide synchronization event. Specifically, Algorithm 1 is very simple but it is applicable only on <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula> -regular communication topologies. Such prerequisite is then removed in Algorithm 2 by including within its instruction list a dynamic consensus protocol to estimate the mean network power consumption. Performance analysis and numerical simulations confirm the effectiveness of the schemes.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
