The complexity, heterogeneity and scale of electrical networks have grown far beyond the limits of exclusively human-based management at the Smart Grid (SG). Likewise, researchers cogitate the use of artificial intelligence and heuristics techniques to create cognitive and autonomic management tools that aim better assist and enhance SG management processes like in the grid reconfiguration. The development of self-healing management approaches towards a cognitive and autonomic distribution power network reconfiguration is a scenario in which the scalability and on-the-fly computation are issues. This paper proposes the use of Case-Based Reasoning (CBR) coupled with the HATSGA algorithm for the fast reconfiguration of large distribution power networks. The suitability and the scalability of the CBR-based reconfiguration strategy using HATSGA algorithm are evaluated. The evaluation indicates that the adopted HATSGA algorithm computes new reconfiguration topologies with a feasible computational time for large networks. The CBR strategy looks for managerial acceptable reconfiguration solutions at the CBR database and, as such, contributes to reduce the required number of reconfiguration computation using HATSGA. This suggests CBR can be applied with a fast reconfiguration algorithm resulting in more efficient, dynamic and cognitive grid recovery strategy.
In recent years, significant research has been done to minimize power loss in the process of reconfiguring distribution power systems. The reconfiguring of distribution power system has a combinatorial nature and the search of the best computational time for supporting the decision-making process in real time has been focused on @cite_1 , @cite_12 , @cite_4 .
@cite_4 @cite_1 @cite_12
2075914509 1984585304 2963342040 2024605755
This paper considers a two-user Gaussian interference channel with energy harvesting transmitters. Different than conventional battery powered wireless nodes, energy harvesting transmitters have to adapt transmission to availability of energy at a particular instant. In this setting, the optimal power allocation problem to maximize the sum throughput with a given deadline is formulated. The convergence of the proposed iterative coordinate descent method for the problem is proved and the short-term throughput maximizing offline power allocation policy is found. Examples for interference regions with known sum capacities are given with directional waterfilling interpretations. Next, stochastic data arrivals are addressed. Finally, online and or distributed near-optimal policies are proposed. Performance of the proposed algorithms are demonstrated through simulations. This paper aims at presenting a new method for the evaluation of technical (demand and energy) losses in electrical power distribution systems. A computational tool was developed and implemented at Eletropaulo, the largest distribution company in Brazil. The methodology divides the distribution system into eight different segments, namely: energy meters, customer connections to the network, low voltage network, distribution transformers, medium voltage network, distribution substations, subtransmission system and other technical losses. The latter segment includes equipment losses in capacitors, voltage regulators, connectors, insulators and so forth. The computational tool comprises two modules. The first one determines technical losses in specific networks in a hierarchical way. From the evaluation of losses in a representative part of the distribution system, per unit loss indices for each segment are readily computed. Such indices are transferred to a second module, which is responsible for the assessment of a global energy balance for the overall distribution system. The power grid is a complex and vital system that necessitates careful reliability management. Managing the grid is a difficult problem with multiple time scales of decision making and stochastic behavior due to renewable energy generations, variable demand and unplanned outages. Solving this problem in the face of uncertainty requires a new methodology with tractable algorithms. In this work, we introduce a new model for hierarchical decision making in complex systems. We apply reinforcement learning (RL) methods to learn a proxy, i.e., a level of abstraction, for real-time power grid reliability. We devise an algorithm that alternates between slow time-scale policy improvement, and fast time-scale value function approximation. We compare our results to prevailing heuristics, and show the strength of our method. The penetration of renewable distributed generation (DG) sources has been increased in active distribution networks due to their unique advantages. However, non-dispatchable DGs such as wind turbines raise the risk of distribution networks. Such a problem could be eliminated using the proper application of energy storage units. In this paper, optimal planning of batteries in the distribution grid is presented. The optimal planning determines the location, capacity and power rating of batteries while minimizing the cost objective function subject to technical constraints. The optimal long-term planning is based on the short-term optimal power flow considering the uncertainties. The point estimate method (PEM) is employed for probabilistic optimal power flow. The batteries are scheduled optimally for several purposes to maximize the benefits. A hybrid Tabu search particle swarm optimization (TS PSO) algorithm is used to solve the problem. The numerical studies on a 21-node distribution system show the advantages of the proposed methodology. The proposed approach can also be applied to the realistic sized networks when some sensitive nodes are considered as candidate locations for installing the storage units.