skip to main content

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: LMP decomposition with three-phase DCOPF for distribution system
This paper presents a three-phase iterative direct current optimal power flow (DCOPF) algorithm with fictitious nodal demand. Power losses and realistic distribution system operating constraints such as line flow limits and phase imbalance limits are carefully modeled in the DCOPF formulation. The definition of locational marginal prices (LMPs) is extended to three-phase distribution systems. The three-phase LMP decomposition is derived based on the Lagrangian function. The proposed algorithm is implemented in an IEEE test case and compared with three-phase alternating current optimal power flow (ACOPF) algorithm. The simulation results show that the proposed DCOPF algorithm is effective in coordinating the operations of distributed energy resources (DERs) and managing phase imbalance and thermal overloading. The proposed iterative three-phase DCOPF algorithm provides not only a computationally efficient solution but also a good approximation to the ACOPF solution.  more » « less
Award ID(s):
1637258
PAR ID:
10026382
Author(s) / Creator(s):
;
Date Published:
Journal Name:
2016 IEEE Innovative Smart Grid Technologies - Asia (ISGT-Asia)
Page Range / eLocation ID:
1 to 8
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ; ( , Wireless and Optical Communications Conference (WOCC))
    null (Ed.)
    Efficient arrangement of UAVs in a swarm formation is essential to the functioning of the swarm as a temporary communication network. Such a network could assist in search and rescue efforts by providing first responders with a means of communication. We propose a user-friendly and effective system for calculating and visualizing an optimal layout of UAVs. An initial calculation to gather parameter information is followed by the proposed algorithm that generates an optimal solution. A visualization is displayed in an easy-to-comprehend manner after the proposed iterative genetic algorithm finds an optimal solution. The proposed system runs iteratively, adding UAV at each intermediate conclusion, until a solution is found. Information is passed between runs of the iterative genetic algorithm to reduce runtime and complexity. The results from testing show that the proposed algorithm yields optimal solutions more frequently than the k-means clustering algorithm. This system finds an optimal solution 80% of the time while k-means clustering is unable to find a solution when presented with a complex problem. 
    more » « less
  2. ; ; ( , Energies)
    null (Ed.)
    Contingency Constrained Optimal Power Flow (CCOPF) differs from traditional Optimal Power Flow (OPF) because its generation dispatch is planned to work with state variables between constraint limits, considering a specific contingency. When it is not desired to have changes in the power dispatch after the contingency occurs, the CCOPF is studied with a preventive perspective, whereas when the contingency occurs and the power dispatch needs to change to operate the system between limits in the post-contingency state, the problem is studied with a corrective perspective. As current power system software tools mainly focus on the traditional OPF problem, having the means to solve CCOPF will benefit power systems planning and operation. This paper presents a Quadratically Constrained Quadratic Programming (QCQP) formulation built within the matpower environment as a solution strategy to the preventive CCOPF. Moreover, an extended OPF model that forces the network to meet all constraints under contingency is proposed as a strategy to find the power dispatch solution for the corrective CCOPF. Validation is made on the IEEE 14-bus test system including photovoltaic generation in one simulation case. It was found that in the QCQP formulation, the power dispatch calculated barely differs in both pre- and post-contingency scenarios while in the OPF extended power network, node voltage values in both pre- and post-contingency scenarios are equal in spite of having different power dispatch for each scenario. This suggests that both the QCQP and the extended OPF formulations proposed, could be implemented in power system software tools in order to solve CCOPF problems from a preventive or corrective perspective. 
    more » « less
  3. ; ; ; ( , International Conference on Probabilistic Methods Applied to Power Systems (PMAPS))
    Learning mappings between system loading and optimal dispatch solutions has been a recent topic of interest in the power systems and machine learning communities. However, previous works have ignored practical power system constraints such as generator ramp limits and other intertemporal requirements. Additionally, optimal power flow runs are not performed independently of previous timesteps - in most cases, an OPF solution representing the current state of the system is heavily related to the OPF solution from previous timesteps. In this paper, we train a recurrent neural network, which embeds natural relationships between timesteps, to predict the optimal solution of convex power systems optimization problems with intertemporal constraints. In contrast to traditional forecasting methods, the computational benefits from this technique can allow operators to rapidly simulate forecasts of system operation and corresponding optimal solutions to provide a more comprehensive view of future system states. 
    more » « less
  4. ; ( , IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids)
    As the number of distributed energy resources participating in power networks increases, it becomes increasingly more important to actively manage network constraints to ensure safe operation. One proposed method that has gained significant attention and implementation, particularly in Australia, is the use of dynamic operating envelopes. Operating envelopes represent net export limits set by the system operator on every node in the distribution network that change as system conditions change. They are calculated using an optimal power flow problem, frequently using a linearization or relaxation of the nonlinear power flow equations. This paper presents two case studies and some numerical analysis to explain why a second order cone relaxation of the power flow equations will lead to ineffective operating envelopes. A modification to the objective function which allows the second order cone relaxation to nearly recover the solution to the nonlinear formulation is also presented. 
    more » « less
  5. ; ; ; ; ( , Frontiers in Robotics and AI)
    A bounded cost path planning method is developed for underwater vehicles assisted by a data-driven flow modeling method. The modeled flow field is partitioned as a set of cells of piece-wise constant flow speed. A flow partition algorithm and a parameter estimation algorithm are proposed to learn the flow field structure and parameters with justified convergence. A bounded cost path planning algorithm is developed taking advantage of the partitioned flow model. An extended potential search method is proposed to determine the sequence of partitions that the optimal path crosses. The optimal path within each partition is then determined by solving a constrained optimization problem. Theoretical justification is provided for the proposed extended potential search method generating the optimal solution. The path planned has the highest probability to satisfy the bounded cost constraint. The performance of the algorithms is demonstrated with experimental and simulation results, which show that the proposed method is more computationally efficient than some of the existing methods. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email