5,153 research outputs found
Agent-based control for decentralised demand side management in the smart grid
Central to the vision of the smart grid is the deployment of smart meters that will allow autonomous software agents, representing the consumers, to optimise their use of devices and heating in the smart home while interacting with the grid. However, without some form of coordination, the population of agents may end up with overly-homogeneous optimised consumption patterns that may generate significant peaks in demand in the grid. These peaks, in turn, reduce the efficiency of the overall system, increase carbon emissions, and may even, in the worst case, cause blackouts. Hence, in this paper, we introduce a novel model of a Decentralised Demand Side Management (DDSM) mechanism that allows agents, by adapting the deferment of their loads based on grid prices, to coordinate in a decentralised manner. Specifically, using average UK consumption profiles for 26M homes, we demonstrate that, through an emergent coordination of the agents, the peak demand of domestic consumers in the grid can be reduced by up to 17% and carbon emissions by up to 6%. We also show that our DDSM mechanism is robust to the increasing electrification of heating in UK homes (i.e. it exhibits a similar efficiency)
Sub-agent elements for control methods in multi-agent energy management system
Increased penetration of generation and decentralised control are considered to be feasible and effective solution for reducing cost and emissions and hence efficiency associated with power generation and distribution. Distributed generation in combination with the multi-agent technology are perfect candidates for this solution. Pro-active and autonomous nature of multi-agent systems can provide an effective platform for decentralised control whilst improving reliability and flexibility of the grid
Catching Cheats: Detecting Strategic Manipulation in Distributed Optimisation of Electric Vehicle Aggregators
Given the rapid rise of electric vehicles (EVs) worldwide, and the ambitious
targets set for the near future, the management of large EV fleets must be seen
as a priority. Specifically, we study a scenario where EV charging is managed
through self-interested EV aggregators who compete in the day-ahead market in
order to purchase the electricity needed to meet their clients' requirements.
With the aim of reducing electricity costs and lowering the impact on
electricity markets, a centralised bidding coordination framework has been
proposed in the literature employing a coordinator. In order to improve privacy
and limit the need for the coordinator, we propose a reformulation of the
coordination framework as a decentralised algorithm, employing the Alternating
Direction Method of Multipliers (ADMM). However, given the self-interested
nature of the aggregators, they can deviate from the algorithm in order to
reduce their energy costs. Hence, we study the strategic manipulation of the
ADMM algorithm and, in doing so, describe and analyse different possible attack
vectors and propose a mathematical framework to quantify and detect
manipulation. Importantly, this detection framework is not limited the
considered EV scenario and can be applied to general ADMM algorithms. Finally,
we test the proposed decentralised coordination and manipulation detection
algorithms in realistic scenarios using real market and driver data from Spain.
Our empirical results show that the decentralised algorithm's convergence to
the optimal solution can be effectively disrupted by manipulative attacks
achieving convergence to a different non-optimal solution which benefits the
attacker. With respect to the detection algorithm, results indicate that it
achieves very high accuracies and significantly outperforms a naive benchmark
Decentralised demand response market model based on reinforcement learning
A new decentralised demand response (DR) model relying on bi-directional communications is developed in this study. In this model, each user is considered as an agent that submits its bids according to the consumption urgency and a set of parameters defined by a reinforcement learning algorithm called Q-learning. The bids are sent to a local DR market, which is responsible for communicating all bids to the wholesale market and the system operator (SO), reporting to the customers after determining the local DR market clearing price. From local markets’ viewpoint, the goal is to maximise social welfare. Four DR levels are considered to evaluate the effect of different DR portions in the cost of the electricity purchase. The outcomes are compared with the ones achieved from a centralised approach (aggregation-based model) as well as an uncontrolled method. Numerical studies prove that the proposed decentralised model remarkably drops the electricity cost compare to the uncontrolled method, being nearly as optimal as a centralised approach.© 2020 The Institution of Engineering and Technology. This is an open access article published by the IET under the Creative Commons Attribution License (http://creativecommons.org/licenses/by/3.0/)fi=vertaisarvioitu|en=peerReviewed
Models for the modern power grid
This article reviews different kinds of models for the electric power grid
that can be used to understand the modern power system, the smart grid. From
the physical network to abstract energy markets, we identify in the literature
different aspects that co-determine the spatio-temporal multilayer dynamics of
power system. We start our review by showing how the generation, transmission
and distribution characteristics of the traditional power grids are already
subject to complex behaviour appearing as a result of the the interplay between
dynamics of the nodes and topology, namely synchronisation and cascade effects.
When dealing with smart grids, the system complexity increases even more: on
top of the physical network of power lines and controllable sources of
electricity, the modernisation brings information networks, renewable
intermittent generation, market liberalisation, prosumers, among other aspects.
In this case, we forecast a dynamical co-evolution of the smart grid and other
kind of networked systems that cannot be understood isolated. This review
compiles recent results that model electric power grids as complex systems,
going beyond pure technological aspects. From this perspective, we then
indicate possible ways to incorporate the diverse co-evolving systems into the
smart grid model using, for example, network theory and multi-agent simulation.Comment: Submitted to EPJ-ST Power Grids, May 201
Multi-Agent System Control and Coordination of an Electrical Network
Multi-Agent Systems (MAS) have the potential to solve Active Network Management (ANM) problems arising from an increase in Distributed Energy Resources (DER). The aim of this research is to integrate a MAS into an electrical network emulation for the purpose of implementing ANM. Initially an overview of agents and MAS and how their characteristics can be used to control and coordinate an electrical network is presented. An electrical network comprising a real-time emulated transmission network connected to a live DER network controlled and coordinated by a MAS is then constructed. The MAS is then used to solve a simple ANM problem: the control and coordination of an electrical network in order to maintain frequency within operational limits. The research concludes that a MAS is successful in solving this ANM problem and also that in the future the developed MAS can be applied to other ANM problems. © 2012 IEEE
A multi-agent based scheduling algorithm for adaptive electric vehicles charging
This paper presents a decentralized scheduling algorithm for electric vehicles charging. The charging control model follows the architecture of a Multi-Agent System (MAS). The MAS consists of an Electric Vehicle (EV)/Distributed Generation (DG) aggregator agent and “Responsive” or “Unresponsive” EV agents. The EV/DG aggregator agent is responsible to maximize the aggregator’s profit by designing the appropriate virtual pricing policy according to accurate power demand and generation forecasts. “Responsive” EV agents are the ones that respond rationally to the virtual pricing signals, whereas “Unresponsive” EV agents define their charging schedule regardless the virtual cost. The performance of the control model is experimentally demonstrated through different case studies at the micro-grid laboratory of the National Technical University of Athens (NTUA) using Real Time Digital Simulator. The results highlighted the adaptive behaviour of “Responsive” EV agents and proved their ability to charge preferentially from renewable energy sources
Robust and cheating-resilient power auctioning on Resource Constrained Smart Micro-Grids
The principle of Continuous Double Auctioning (CDA) is known to provide an efficient way of matching supply and demand among distributed selfish participants with limited information. However, the literature indicates that the classic CDA algorithms developed for grid-like applications are centralised and insensitive to the processing resources capacity, which poses a hindrance for their application on resource constrained, smart micro-grids (RCSMG). A RCSMG loosely describes a micro-grid with distributed generators and demand controlled by selfish participants with limited information, power storage capacity and low literacy, communicate over an unreliable infrastructure burdened by limited bandwidth and low computational power of devices. In this thesis, we design and evaluate a CDA algorithm for power allocation in a RCSMG. Specifically, we offer the following contributions towards power auctioning on RCSMGs. First, we extend the original CDA scheme to enable decentralised auctioning. We do this by integrating a token-based, mutual-exclusion (MUTEX) distributive primitive, that ensures the CDA operates at a reasonably efficient time and message complexity of O(N) and O(logN) respectively, per critical section invocation (auction market execution). Our CDA algorithm scales better and avoids the single point of failure problem associated with centralised CDAs (which could be used to adversarially provoke a break-down of the grid marketing mechanism). In addition, the decentralised approach in our algorithm can help eliminate privacy and security concerns associated with centralised CDAs. Second, to handle CDA performance issues due to malfunctioning devices on an unreliable network (such as a lossy network), we extend our proposed CDA scheme to ensure robustness to failure. Using node redundancy, we modify the MUTEX protocol supporting our CDA algorithm to handle fail-stop and some Byzantine type faults of sites. This yields a time complexity of O(N), where N is number of cluster-head nodes; and message complexity of O((logN)+W) time, where W is the number of check-pointing messages. These results indicate that it is possible to add fault tolerance to a decentralised CDA, which guarantees continued participation in the auction while retaining reasonable performance overheads. In addition, we propose a decentralised consumption scheduling scheme that complements the auctioning scheme in guaranteeing successful power allocation within the RCSMG. Third, since grid participants are self-interested we must consider the issue of power theft that is provoked when participants cheat. We propose threat models centred on cheating attacks aimed at foiling the extended CDA scheme. More specifically, we focus on the Victim Strategy Downgrade; Collusion by Dynamic Strategy Change, Profiling with Market Prediction; and Strategy Manipulation cheating attacks, which are carried out by internal adversaries (auction participants). Internal adversaries are participants who want to get more benefits but have no interest in provoking a breakdown of the grid. However, their behaviour is dangerous because it could result in a breakdown of the grid. Fourth, to mitigate these cheating attacks, we propose an exception handling (EH) scheme, where sentinel agents use allocative efficiency and message overheads to detect and mitigate cheating forms. Sentinel agents are tasked to monitor trading agents to detect cheating and reprimand the misbehaving participant. Overall, message complexity expected in light demand is O(nLogN). The detection and resolution algorithm is expected to run in linear time complexity O(M). Overall, the main aim of our study is achieved by designing a resilient and cheating-free CDA algorithm that is scalable and performs well on resource constrained micro-grids. With the growing popularity of the CDA and its resource allocation applications, specifically to low resourced micro-grids, this thesis highlights further avenues for future research. First, we intend to extend the decentralised CDA algorithm to allow for participants’ mobile phones to connect (reconnect) at different shared smart meters. Such mobility should guarantee the desired CDA properties, the reliability and adequate security. Secondly, we seek to develop a simulation of the decentralised CDA based on the formal proofs presented in this thesis. Such a simulation platform can be used for future studies that involve decentralised CDAs. Third, we seek to find an optimal and efficient way in which the decentralised CDA and the scheduling algorithm can be integrated and deployed in a low resourced, smart micro-grid. Such an integration is important for system developers interested in exploiting the benefits of the two schemes while maintaining system efficiency. Forth, we aim to improve on the cheating detection and mitigation mechanism by developing an intrusion tolerance protocol. Such a scheme will allow continued auctioning in the presence of cheating attacks while incurring low performance overheads for applicability in a RCSMG
- …