Ekaterina Smorodkina and Dr. Daniel Tauritz Department of Computer Science Power Grid Protection through Rapid Response Control of FACTS Devices.

Slides:



Advertisements
Similar presentations
Proactive Traffic Merging Strategies for Sensor-Enabled Cars
Advertisements

Dynamic Programming From An
Optimal PRAM algorithms: Efficiency of concurrent writing “Computer science is no more about computers than astronomy is about telescopes.” Edsger Dijkstra.
CS223 Advanced Data Structures and Algorithms 1 Greedy Algorithms Neil Tang 4/8/2010.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Solving POMDPs Using Quadratically Constrained Linear Programs Christopher Amato.
WATERLOO ELECTRICAL AND COMPUTER ENGINEERING 60s: Power Engineering 1 WATERLOO ELECTRICAL AND COMPUTER ENGINEERING 60s Power Engineering Department of.
DCC ‘99 - Adaptive Prediction Lossless Image Coding Adaptive Linear Prediction Lossless Image Coding Giovanni Motta, James A. Storer Brandeis University.
An Approach to Evaluate Data Trustworthiness Based on Data Provenance Department of Computer Science Purdue University.
Deterministic Wavelet Thresholding for Maximum-Error Metrics Minos Garofalakis Bell Laboratories Lucent Technologies 600 Mountain Avenue Murray Hill, NJ.
Cache Placement in Sensor Networks Under Update Cost Constraint Bin Tang, Samir Das and Himanshu Gupta Department of Computer Science Stony Brook University.
Path Planning on a Compressed Terrain Daniel M. Tracy, W. Randolph Franklin, Barbara Cutler, Franklin T. Luk, Marcus Andrade, Jared Stookey Rensselaer.
ICNP'061 Benefit-based Data Caching in Ad Hoc Networks Bin Tang, Himanshu Gupta and Samir Das Department of Computer Science Stony Brook University.
Eng 101 – Seeds of Success Social and Ethical Implications of Artificial Intelligence Daniel Tauritz, Ph.D. Associate Professor of Computer Science.
Comp 775: Deformable models: snakes and active contours Marc Niethammer, Stephen Pizer Department of Computer Science University of North Carolina, Chapel.
Vassilios V. Dimakopoulos and Evaggelia Pitoura Distributed Data Management Lab Dept. of Computer Science, Univ. of Ioannina, Greece
Protecting against national-scale power blackouts Daniel Bienstock, Columbia University Collaboration with: Sara Mattia, Universitá di Roma, Italy Thomas.
Department of Computer Science Undergraduate Events More
Impact of Problem Centralization on Distributed Constraint Optimization Algorithms John P. Davin and Pragnesh Jay Modi Carnegie Mellon University School.
Dynamic Programming Introduction to Algorithms Dynamic Programming CSE 680 Prof. Roger Crawfis.
Distributed Control of FACTS Devices Using a Transportation Model Bruce McMillin Computer Science Mariesa Crow Electrical and Computer Engineering University.
UNIVERSITY of NOTRE DAME COLLEGE of ENGINEERING Preserving Location Privacy on the Release of Large-scale Mobility Data Xueheng Hu, Aaron D. Striegel Department.
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
Transmission Reliability Performance Metrics November 5, 2009 © 2009 Blue Arc Energy Solutions, Inc. All Rights Reserved.
ITGD4207 Operations Research
ANTs PI Meeting, Nov. 29, 2000W. Zhang, Washington University1 Flexible Methods for Multi-agent distributed resource Allocation by Exploiting Phase Transitions.
Multiplication Facts. 1 x3 3 Think Fast… 2 x4 8.
1 Dr. Scott Schaefer Surface Simplification. 2/32 Surface Simplification Given a closed polygon model, reduce the number of polygons and maintain appearance.
Euro-Par, A Resource Allocation Approach for Supporting Time-Critical Applications in Grid Environments Qian Zhu and Gagan Agrawal Department of.
SUMMARY Introduction System Protection Philosophy
Secure Sensor Data/Information Management and Mining Bhavani Thuraisingham The University of Texas at Dallas October 2005.
Optimal Content Delivery with Network Coding Derek Leong, Tracey Ho California Institute of Technology Rebecca Cathey BAE Systems CISS 2009 March 19, 2009.
System On Chip Devices for High Performance Computing Design Automation Conference 2015 System On Chip Workshop Noel Wheeler
1 ECE 517: Reinforcement Learning in Artificial Intelligence Lecture 8: Dynamic Programming – Value Iteration Dr. Itamar Arel College of Engineering Department.
WHAT IS COMPUTER SCIENCE? Phil Sands K-12 Outreach Coordinator for Computer Science.
Project Design Alain Esteva-Ramirez School of Computing and Information Sciences Florida International University Bárbara Morales-Quiñones Department of.
1 CSE 4705 Artificial Intelligence Jinbo Bi Department of Computer Science & Engineering
Multiplication Facts. 9 6 x 4 = 24 5 x 9 = 45 9 x 6 = 54.
Nonsmooth Optimization for Optimal Power Flow over Transmission Networks GlobalSIP 2015 Authors: Y. Shi, H. D. Tuan, S. W. Su and H. H. M. Tam.
Natural Faults Mariesa Crow & Bruce McMillin
Learning Team Behavior Using Individual Decision Making in Multiagent Settings Using Interactive DIDs Muthukumaran Chandrasekaran THINC Lab, CS Department.
Finding Optimal Solutions to Cooperative Pathfinding Problems Trevor Standley Computer Science Department University of California, Los Angeles
FACTS Placement Optimization For Multi-Line Contignecies Josh Wilkerson November 30, 2005.
Multiplication Facts. 2x2 4 8x2 16 4x2 8 3x3.
Multiplication Facts Review: x 1 = 1 10 x 8 =
Occlusion Tracking Using Logical Models Summary. A Variational Partial Differential Equations based model is used for tracking objects under occlusions.
Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.
Managed by UT-Battelle for the Department of Energy 1 United States Grid Security and Reliability Control in High Load Conditions Presented to Associate.
MEER 111 – Global Research Solving Real-World Problems with Evolutionary Algorithms Daniel Tauritz, Ph.D. Associate Professor of Computer Science.
SEMINAR PRESENATATION ON WIDEAREA BLACKOUT (AN ELECTRICAL DISASTER) BY:Madhusmita Mohanty Electrical Engineering 7TH Semester Regd No
Zachary Starr Dept. of Computer Science, University of Missouri, Columbia, MO 65211, USA Digital Image Processing Final Project Dec 11 th /16 th, 2014.
Multiplication Facts All Facts. 0 x 1 2 x 1 10 x 5.
Simulation and Exploration of
Multiplication Facts.
Leveraging Mobile Telephony in Disaster Management
Classification Analytical methods classical methods
Chapter 15: Networking Services Design Optimization
Multiplication Facts.
Fast image deconvolution using Hyper-Laplacian Prior
A CASE STUDY INTRODUCING DYNAMIC PROGRAMMING IN CS2
Introduction to Scientific Computing II
Introduction to Scientific Computing II
Introduction to Scientific Computing II
Introduction to Scientific Computing II
AltaLink / Daniel Wong / 2009 Nov 05 / 1 of 2
Multiplication Facts.
How do we find the best linear regression line?
7. Ford-Fulkerson Algorithm with multiple optimal solutions
Introduction to Scientific Computing II
Fall 2018, COMP 562 Poster Session
Derivatives and Gradients
Presentation transcript:

Ekaterina Smorodkina and Dr. Daniel Tauritz Department of Computer Science Power Grid Protection through Rapid Response Control of FACTS Devices

Motivation Major blackouts in Italy and North America Rapid response may prevent blackouts FACTS: Flexible AC Transmission System FACTS devices allow rapid response FACTS placement & control is complex

Outline Impact Analysis of FACTS devices Rapid response to contingencies Power Flow control algorithm Introducing Partial Power Flow Results & Analysis Future applications of Partial Power Flow

Impact Analysis (1)

Impact Analysis (2)

Rapid Response Optimization objective: minimize performance metric Control algorithm To evaluate metric, power flow must be computed Gradient descent method – a sequence of solutions U 1, U 2, … U M Power flow must be recomputed multiple times to optimize control

Partial Power Flow (PPF) Use result of impact analysis that not all lines are effected How do we know which lines will be effected? Recall the sequence of solutions: U 1, U 2, … U M Idea: lines effected by solution U k will also be effected by solution U k+1

Results

Summary Preventing blackouts is essential Significant part of the grid can be influenced with few FACTS devices The Partial Power Flow Algorithm speeds up control of FACTS devices

Future Applications of PPF Other algorithms that re-compute power flow multiple times Multi-agent control of power systems Each agent controls a part of the grid Power flow must be computed locally