Distributed Control for Optimal Reactive Power Compensation in Smart Microgrid
|
|
- Ethan Daniels
- 5 years ago
- Views:
Transcription
1 Distributed Control for Optimal Reactive Power Compensation in Smart Microgrid S. Bolognani and S. Zampieri Royal Institute of Technology, KTH October 14, 2011
2 1 Outline 2 Outline 3 Microgrid Model 4 Optimal Problem Model The Gradient of the Cost Function 5 The Proposed Optimization Algorithm Optimal Strategy 6 Simulations Conclusions
3 What is microgrid? A microgrid is a portion of the low-voltage power distributed network that is managed autonomously from the rest of the network, to achieve better quality of the service,... What is reactive power? The portion of power flow that is temporarily stored in the form of electric or magnetic fields, due to inductive and capacitive network elements, and returned to source Q = V rms I rms sin φ
4 1 Outline 2 Outline 3 Microgrid Model 4 Optimal Problem Model The Gradient of the Cost Function 5 The Proposed Optimization Algorithm Optimal Strategy 6 Simulations Conclusions Microgrid Model
5 Microgrid Model where: V is the set of nodes E is the set of edges G = (V, E, σ, τ), σ, τ : E V are two functions such that e E goes from the source node σ(e) to the terminal node τ(e) The incidence matrix of the graphy G is defined by 1 if v = σ(e) [A] ev = 1 if v = τ(e). 0 otherwise
6 Microgrid Model Outline Microgrid Model Here it limits the study to the steady state behavior of the system. u : V C is the voltage at the nodes i : V C is the current injected by the nodes ξ : E C is the current flowing on the edges A T ξ + i = 0, 1 T i = 0 (1) Au + Zξ = 0 (2) u(v)i(v) = s v, v V\{ v} (3) u( v) = u 0 (4)
7 Microgrid Model Cont. Microgrid Model s : V C, where s(v) := u(v)i(v) is the complex power injected by node v into the grid; f σ : E C, where f σ (e) := u(σ(e))ξ(e) is the power flow entering the edge e; f τ : E C, where f τ (e) := u(τ(e))ξ(e) is the power flow exiting the edge e. where Y = Z 1 A T f σ + s = 0 (5) f σ + Y u 0 (Au) = 0 (6)
8 Microgrid Model Cont. Microgrid Model Assumption 1: The inductance-resistance ratio is fixed for all the edges, i.e. z(e) = e jθ d(e), d(e) R +, e E Then we have Z = e jθ D, where D = diag(d(e), e E). Introduce weighted Laplacian matrix L = A T D 1 A, and the Green matrix X = L # [1]. We get the approximated node voltages û = ejθ u0 (Xs e T v Xs 1) + u 0 1 (7)
9 1 Outline 2 Outline Optimal Problem Model The Gradient of the Cost Function 3 Microgrid Model 4 Optimal Problem Model The Gradient of the Cost Function 5 The Proposed Optimization Algorithm Optimal Strategy 6 Simulations Conclusions
10 Optimal Problem Model The Gradient of the Cost Function The toal active power losses on the edges are given by ξ(e) 2 Rez(e) = cos θ(u ) T Lu e E Rel(e) = e E = cos θ u 0 2 (s ) T Xs = cos θ u 0 2 (pt Xp + q T Xq), (8) where p = Re(s) and q = Im(s), such that 1 T p = 0 and 1 T q = 0.
11 Optimal Problem Model The Gradient of the Cost Function Cont. Since we are allowed to command only a subset C V of the electronic interfaces connected to the microgrid. Furthermore, we assume that we are only allowed to command the amount of reactive power injected into the grid. min qc T Mq C + m T q C, (9) 1 T q C =c where M = cos θ u 0 2 X CC > 0, m = 2 cos θ u 0 2 X C C and c = 1T q C.
12 The Gradient of the Cost Function Optimal Problem Model The Gradient of the Cost Function The gradient of the cost function can be obtained by J(q C ) = 2Mq C + m. Then, the component of the gradient corresponding to a node v results to be [ J] v = 2 cos θ u 0 2 et v Xq 2 cos θ û 0 2 et v Im(e jθ û 0 u ) (10)
13 1 Outline 2 Outline The Proposed Optimization Algorithm Optimal Strategy 3 Microgrid Model 4 Optimal Problem Model The Gradient of the Cost Function 5 The Proposed Optimization Algorithm Optimal Strategy 6 Simulations Conclusions
14 The Proposed Optimization Algorithm Optimal Strategy In each set of the compensators, C i, nodes drives their state in a new feasible state that minimizes J(q C ) and keep those nodes s state, which are not in C i. The optimization subproblem faced by the nodes in C i can be rewritthen as min q T C i M Ci C i q Ci + (2q C i M C i C i + m T C i )q Ci (11a) s.t. 1 T q Ci = c 1 T q C i (11b) The optimal increment q Ci can be obtained by q Ci = M 1 C i C i 2 [ J] C i + 1T M 1 C i C i [ J] Ci 1 T M 1 C i C i 1 M 1 C i C i 2 1.
15 The Proposed Optimization Algorithm The Proposed Optimization Algorithm Optimal Strategy 1) a set C i is chosen according to a sequence of symbols η(t) {1,..., l}; 2) agents in C i sense the network and obtain an estimate of the gradient; 3) they determine a feasible update step that minimizes the given cost function; 4) they actuate the system by updating their state (the injected reactive power). q C (t + 1) = T η(t) [q C (t)] := argmin q C S η(t) J(q C (t) + q C ) (12)
16 The Proposed Optimization Algorithm Optimal Strategy Optimal Strategy: Nearest-neighbor Gossip It is can be proven that the bound β on the convergence rate of the algorithm satisfies β 1 1 N C 1 Proposition: Consider the nearest-neighbor clustering choice, corresponding to the set of the clusters {C e, e E}, where C e = {σ(e), τ(e)}. Assume that each set is triggered with the same probability. Then R β, with β = 1 1 N C 1
17 1 Outline 2 Outline Simulations Conclusions 3 Microgrid Model 4 Optimal Problem Model The Gradient of the Cost Function 5 The Proposed Optimization Algorithm Optimal Strategy 6 Simulations Conclusions
18 Simulations for Microgrid Model Simulations Conclusions Figure: Comparison between the network state (node voltages) computed via the exact model induced by Eq. (1) and (2) (circles), and the approximated model induced by Eq. (5) and (6) (stars). Figure: Contour plot of the exact distribution losses (thick line) and of the cost function whose gradient is given by the voltage measurements, according to Eq. (10) (thin line)
19 Simulations Conclusions Simualtions for the Optimal Algorithm Figure: Network: where compensators are in white, loads in gray. Figure: The algorithm behavior has been plotted for two different choices: nearest-neighbor gossip (solid line) and star topology (dashed). The dotted line represent the best possible performance.
20 Conculsions Outline Simulations Conclusions For the problem of optimal reactive power compensation in smart microgrid modelling the problem into the framework of quadratic optimization For the performance of the algorithm providing a bound on the best achievable performance giving the optimal performance which shows that the optimal strategy requires short-range communication
21 References I Outline Simulations Conclusions A. Ghosh, S. Boyd and A. Saberi,Minimizing effective resistance of a graph, SIAM Review, vol. 50, no. 1, pp , Feb
Luca Schenato Workshop on cooperative multi agent systems Pisa, 6/12/2007
Distributed consensus protocols for clock synchronization in sensor networks Luca Schenato Workshop on cooperative multi agent systems Pisa, 6/12/2007 Outline Motivations Intro to consensus algorithms
More informationComplete Cototal Domination
Chapter 5 Complete Cototal Domination Number of a Graph Published in Journal of Scientific Research Vol. () (2011), 547-555 (Bangladesh). 64 ABSTRACT Let G = (V,E) be a graph. A dominating set D V is said
More informationA Random Variable Shape Parameter Strategy for Radial Basis Function Approximation Methods
A Random Variable Shape Parameter Strategy for Radial Basis Function Approximation Methods Scott A. Sarra, Derek Sturgill Marshall University, Department of Mathematics, One John Marshall Drive, Huntington
More informationCyber Security Analysis of State Estimators in Electric Power Systems
Cyber Security Analysis of State Estimators in Electric Power Systems H. Sandberg, G. Dán, A. Teixeira, K. C. Sou, O. Vukovic, K. H. Johansson ACCESS Linnaeus Center KTH Royal Institute of Technology,
More informationLearning Two-View Stereo Matching
Learning Two-View Stereo Matching Jianxiong Xiao Jingni Chen Dit-Yan Yeung Long Quan Department of Computer Science and Engineering The Hong Kong University of Science and Technology The 10th European
More informationSupport Vector Machines
Support Vector Machines RBF-networks Support Vector Machines Good Decision Boundary Optimization Problem Soft margin Hyperplane Non-linear Decision Boundary Kernel-Trick Approximation Accurancy Overtraining
More informationThe Capacity of Wireless Networks
The Capacity of Wireless Networks Piyush Gupta & P.R. Kumar Rahul Tandra --- EE228 Presentation Introduction We consider wireless networks without any centralized control. Try to analyze the capacity of
More information2014 Stat-Ease, Inc. All Rights Reserved.
What s New in Design-Expert version 9 Factorial split plots (Two-Level, Multilevel, Optimal) Definitive Screening and Single Factor designs Journal Feature Design layout Graph Columns Design Evaluation
More informationIn the Name of God. Lecture 17: ANFIS Adaptive Network-Based Fuzzy Inference System
In the Name of God Lecture 17: ANFIS Adaptive Network-Based Fuzzy Inference System Outline ANFIS Architecture Hybrid Learning Algorithm Learning Methods that Cross-Fertilize ANFIS and RBFN ANFIS as a universal
More informationEdge and local feature detection - 2. Importance of edge detection in computer vision
Edge and local feature detection Gradient based edge detection Edge detection by function fitting Second derivative edge detectors Edge linking and the construction of the chain graph Edge and local feature
More informationOn the Global Solution of Linear Programs with Linear Complementarity Constraints
On the Global Solution of Linear Programs with Linear Complementarity Constraints J. E. Mitchell 1 J. Hu 1 J.-S. Pang 2 K. P. Bennett 1 G. Kunapuli 1 1 Department of Mathematical Sciences RPI, Troy, NY
More informationLEAST COST ROUTING ALGORITHM WITH THE STATE SPACE RELAXATION IN A CENTRALIZED NETWORK
VOL., NO., JUNE 08 ISSN 896608 00608 Asian Research Publishing Network (ARPN). All rights reserved. LEAST COST ROUTING ALGORITHM WITH THE STATE SPACE RELAXATION IN A CENTRALIZED NETWORK Y. J. Lee Department
More informationData Analysis 3. Support Vector Machines. Jan Platoš October 30, 2017
Data Analysis 3 Support Vector Machines Jan Platoš October 30, 2017 Department of Computer Science Faculty of Electrical Engineering and Computer Science VŠB - Technical University of Ostrava Table of
More informationSensor Tasking and Control
Sensor Tasking and Control Outline Task-Driven Sensing Roles of Sensor Nodes and Utilities Information-Based Sensor Tasking Joint Routing and Information Aggregation Summary Introduction To efficiently
More informationManifolds Pt. 1. PHYS Southern Illinois University. August 24, 2016
Manifolds Pt. 1 PHYS 500 - Southern Illinois University August 24, 2016 PHYS 500 - Southern Illinois University Manifolds Pt. 1 August 24, 2016 1 / 20 Motivating Example: Pendulum Example Consider a pendulum
More informationEstimating the Free Region of a Sensor Node
Estimating the Free Region of a Sensor Node Laxmi Gewali, Navin Rongratana, Jan B. Pedersen School of Computer Science, University of Nevada 4505 Maryland Parkway Las Vegas, NV, 89154, USA Abstract We
More informationIteratively Re-weighted Least Squares for Sums of Convex Functions
Iteratively Re-weighted Least Squares for Sums of Convex Functions James Burke University of Washington Jiashan Wang LinkedIn Frank Curtis Lehigh University Hao Wang Shanghai Tech University Daiwei He
More informationLecture-12: Closed Sets
and Its Examples Properties of Lecture-12: Dr. Department of Mathematics Lovely Professional University Punjab, India October 18, 2014 Outline Introduction and Its Examples Properties of 1 Introduction
More informationCHAPTER 3 WAVEFRONT RECONSTRUCTION METHODS. 3.1 Spatial Correlation Method
CHAPTER 3 WAVEFRONT RECONSTRUCTION METHODS Pierce [9] defines a wavefront as any moving surface along which a waveform feature is being simultaneously received. The first step in performing ray tracing
More informationPrinciples of Wireless Sensor Networks. Fast-Lipschitz Optimization
http://www.ee.kth.se/~carlofi/teaching/pwsn-2011/wsn_course.shtml Lecture 5 Stockholm, October 14, 2011 Fast-Lipschitz Optimization Royal Institute of Technology - KTH Stockholm, Sweden e-mail: carlofi@kth.se
More informationSplitting-Based Statistical X-Ray CT Image Reconstruction with Blind Gain Correction
Splitting-Based Statistical X-Ray CT Image Reconstruction with Blind Gain Correction Hung Nien and Jeffrey A. Fessler Department of Electrical Engineering and Computer Science University of Michigan, Ann
More informationConsensus and Synchronization of Multi-Agent Systems
Consensus and Synchronization of Multi-Agent Systems (Combinatorial) optimization on matrix semigroups Raphaël Jungers UCLouvain L aquila, April 2016 Smart cities Consensus of multiagent systems Gossip
More informationMathematics of a Multiple Omni-Directional System
Mathematics of a Multiple Omni-Directional System A. Torii A. Sugimoto A. Imiya, School of Science and National Institute of Institute of Media and Technology, Informatics, Information Technology, Chiba
More informationFast Radial Basis Functions for Engineering Applications. Prof. Marco Evangelos Biancolini University of Rome Tor Vergata
Fast Radial Basis Functions for Engineering Applications Prof. Marco Evangelos Biancolini University of Rome Tor Vergata Outline 2 RBF background Fast RBF on HPC Engineering Applications Mesh morphing
More informationLevel-set and ALE Based Topology Optimization Using Nonlinear Programming
10 th World Congress on Structural and Multidisciplinary Optimization May 19-24, 2013, Orlando, Florida, USA Level-set and ALE Based Topology Optimization Using Nonlinear Programming Shintaro Yamasaki
More informationVideo 9.1 Jianbo Shi. Property of Penn Engineering, Jianbo Shi
Video 9.1 Jianbo Shi 1 Exmples of resizing 2 820 546 3 3 420 546 3 (a) (b) (c) Guess We use crop, scaling and carving for resizing the given image Guess which one is for carving? 4 5 6 Guess which one
More informationThe Pre-Image Problem in Kernel Methods
The Pre-Image Problem in Kernel Methods James Kwok Ivor Tsang Department of Computer Science Hong Kong University of Science and Technology Hong Kong The Pre-Image Problem in Kernel Methods ICML-2003 1
More informationChapter 6. Curves and Surfaces. 6.1 Graphs as Surfaces
Chapter 6 Curves and Surfaces In Chapter 2 a plane is defined as the zero set of a linear function in R 3. It is expected a surface is the zero set of a differentiable function in R n. To motivate, graphs
More informationGlobal and clustered approaches for stress constrained topology optimization and deactivation of design variables
th World Congress on Structural and Multidisciplinary Optimization May 9-24, 23, Orlando, Florida, USA Global and clustered approaches for stress constrained topology optimization and deactivation of design
More informationExact Optimized-cost Repair in Multi-hop Distributed Storage Networks
Exact Optimized-cost Repair in Multi-hop Distributed Storage Networks Majid Gerami, Ming Xiao Communication Theory Lab, Royal Institute of Technology, KTH, Sweden, E-mail: {gerami, mingx@kthse arxiv:14012774v1
More informationVersion 5.0. Alexander Friedman and Jamie Raymond. June 6, 2010
PLoT: Graph Plotting Version 5.0 Alexander Friedman and Jamie Raymond June 6, 2010 PLoT (a.k.a. PLTplot) provides a basic interface for producing common types of plots such as line and vector field plots
More informationCooperative Conveyance by Vehicle Swarms with Dynamic Network Topology
SICE Annual Conference 2 September 3-8, 2, Waseda University, Tokyo, Japan Cooperative Conveyance by Vehicle Swarms with Dynamic Network Topology Koji Ishimura and Toru Namerikawa Department of System
More informationHOUGH TRANSFORM CS 6350 C V
HOUGH TRANSFORM CS 6350 C V HOUGH TRANSFORM The problem: Given a set of points in 2-D, find if a sub-set of these points, fall on a LINE. Hough Transform One powerful global method for detecting edges
More informationTask selection for control of active vision systems
The 29 IEEE/RSJ International Conference on Intelligent Robots and Systems October -5, 29 St. Louis, USA Task selection for control of active vision systems Yasushi Iwatani Abstract This paper discusses
More informationElectric Power Systems Research
Electric Power Systems Research 110 (2014) 45 54 Contents lists available at ScienceDirect Electric Power Systems Research j o ur na l ho mepage: www.elsevier.com/locate/epsr Multi-agent control of community
More informationOP-029. INTERPRETATION OF CIU TEST
INTERPRETATION OF CIU TEST Page 1 of 7 WORK INSTRUCTIONS FOR ENGINEERS KYW Compiled by : Checked by LCH : TYC Approved by : OP-09. INTERPRETATION OF CIU TEST INTERPRETATION OF CIU TEST Page of 7 9. INTERPRETATION
More informationFormation shape and orientation control using projected collinear tensegrity structures
Proceedings of the 2009 American Control Conference, St. Louis, MO, June 2009 Formation shape and orientation control using projected collinear tensegrity structures Darren Pais, Ming Cao and Naomi Ehrich
More informationProcessing of binary images
Binary Image Processing Tuesday, 14/02/2017 ntonis rgyros e-mail: argyros@csd.uoc.gr 1 Today From gray level to binary images Processing of binary images Mathematical morphology 2 Computer Vision, Spring
More informationPrinciples of Wireless Sensor Networks. Routing, Zigbee, and RPL
http://www.ee.kth.se/~carlofi/teaching/pwsn-2011/wsn_course.shtml Lecture 8 Stockholm, November 11, 2011 Routing, Zigbee, and RPL Royal Institute of Technology - KTH Stockholm, Sweden e-mail: carlofi@kth.se
More informationUNIVERSITY OF OSLO. Faculty of Mathematics and Natural Sciences
UNIVERSITY OF OSLO Faculty of Mathematics and Natural Sciences Exam: INF 43 / INF 935 Digital image analysis Date: Thursday December 4, 4 Exam hours: 4.3-8.3 (4 hours) Number of pages: 6 pages Enclosures:
More informationImage Formation and the Lens: Object Beyond The Focal Point
Image Formation and the Lens: Object Beyond The Focal Point A convex lens is shown below with its focal points displayed (the dots). An object is located to the left of and at a distance of 2f to the lens.
More informationVisual Representations for Machine Learning
Visual Representations for Machine Learning Spectral Clustering and Channel Representations Lecture 1 Spectral Clustering: introduction and confusion Michael Felsberg Klas Nordberg The Spectral Clustering
More informationA Derivative-Free Approximate Gradient Sampling Algorithm for Finite Minimax Problems
1 / 33 A Derivative-Free Approximate Gradient Sampling Algorithm for Finite Minimax Problems Speaker: Julie Nutini Joint work with Warren Hare University of British Columbia (Okanagan) III Latin American
More informationDistributed Alternating Direction Method of Multipliers
Distributed Alternating Direction Method of Multipliers Ermin Wei and Asuman Ozdaglar Abstract We consider a network of agents that are cooperatively solving a global unconstrained optimization problem,
More informationRecommendation System Using Yelp Data CS 229 Machine Learning Jia Le Xu, Yingran Xu
Recommendation System Using Yelp Data CS 229 Machine Learning Jia Le Xu, Yingran Xu 1 Introduction Yelp Dataset Challenge provides a large number of user, business and review data which can be used for
More informationDS Machine Learning and Data Mining I. Alina Oprea Associate Professor, CCIS Northeastern University
DS 4400 Machine Learning and Data Mining I Alina Oprea Associate Professor, CCIS Northeastern University September 20 2018 Review Solution for multiple linear regression can be computed in closed form
More informationTree-GP: A Scalable Bayesian Global Numerical Optimization algorithm
Utrecht University Department of Information and Computing Sciences Tree-GP: A Scalable Bayesian Global Numerical Optimization algorithm February 2015 Author Gerben van Veenendaal ICA-3470792 Supervisor
More informationComputational Methods. Constrained Optimization
Computational Methods Constrained Optimization Manfred Huber 2010 1 Constrained Optimization Unconstrained Optimization finds a minimum of a function under the assumption that the parameters can take on
More informationDS Machine Learning and Data Mining I. Alina Oprea Associate Professor, CCIS Northeastern University
DS 4400 Machine Learning and Data Mining I Alina Oprea Associate Professor, CCIS Northeastern University January 22 2019 Outline Practical issues in Linear Regression Outliers Categorical variables Lab
More informationSubdivision Curves and Surfaces: An Introduction
Subdivision Curves and Surfaces: An Introduction Corner Cutting De Casteljau s and de Boor s algorithms all use corner-cutting procedures. Corner cutting can be local or non-local. A cut is local if it
More informationProcessing Missing Values with Self-Organized Maps
Processing Missing Values with Self-Organized Maps David Sommer, Tobias Grimm, Martin Golz University of Applied Sciences Schmalkalden Department of Computer Science D-98574 Schmalkalden, Germany Phone:
More informationAlgorithms for LTS regression
Algorithms for LTS regression October 26, 2009 Outline Robust regression. LTS regression. Adding row algorithm. Branch and bound algorithm (BBA). Preordering BBA. Structured problems Generalized linear
More informationSingularity Loci of Planar Parallel Manipulators with Revolute Joints
Singularity Loci of Planar Parallel Manipulators with Revolute Joints ILIAN A. BONEV AND CLÉMENT M. GOSSELIN Département de Génie Mécanique Université Laval Québec, Québec, Canada, G1K 7P4 Tel: (418) 656-3474,
More informationIntroduction to Optimization Problems and Methods
Introduction to Optimization Problems and Methods wjch@umich.edu December 10, 2009 Outline 1 Linear Optimization Problem Simplex Method 2 3 Cutting Plane Method 4 Discrete Dynamic Programming Problem Simplex
More informationWE consider the gate-sizing problem, that is, the problem
2760 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: REGULAR PAPERS, VOL 55, NO 9, OCTOBER 2008 An Efficient Method for Large-Scale Gate Sizing Siddharth Joshi and Stephen Boyd, Fellow, IEEE Abstract We consider
More informationUnstructured Mesh Generation for Implicit Moving Geometries and Level Set Applications
Unstructured Mesh Generation for Implicit Moving Geometries and Level Set Applications Per-Olof Persson (persson@mit.edu) Department of Mathematics Massachusetts Institute of Technology http://www.mit.edu/
More informationCalibration of Recorded Digital Counts to Radiance
Graduate Radiometry, 1051-719 Laboratory No. 2 Fall Quarter, 2006 Calibration of Recorded Digital Counts to Radiance INTRODUCTION The goal of this experiment is to calibrate your digital camera, using
More informationIso-surface cell search. Iso-surface Cells. Efficient Searching. Efficient search methods. Efficient iso-surface cell search. Problem statement:
Iso-Contouring Advanced Issues Iso-surface cell search 1. Efficiently determining which cells to examine. 2. Using iso-contouring as a slicing mechanism 3. Iso-contouring in higher dimensions 4. Texturing
More informationSpeed of Light in Glass
Name Date Regents Physics Lab #R Period Mrs. Nadworny Research Problem Materials Speed of Light in Glass Due Date When a ray of light passes obliquely (at an angle) from air to glass, it is refracted.
More information1. What is the law of reflection?
Name: Skill Sheet 7.A The Law of Reflection The law of reflection works perfectly with light and the smooth surface of a mirror. However, you can apply this law to other situations. For example, how would
More informationDigital Image Processing Laboratory: MAP Image Restoration
Purdue University: Digital Image Processing Laboratories 1 Digital Image Processing Laboratory: MAP Image Restoration October, 015 1 Introduction This laboratory explores the use of maximum a posteriori
More informationIntroduction to Modern Control Systems
Introduction to Modern Control Systems Convex Optimization, Duality and Linear Matrix Inequalities Kostas Margellos University of Oxford AIMS CDT 2016-17 Introduction to Modern Control Systems November
More informationDistributed Consensus in Multivehicle Cooperative Control: Theory and Applications
Distributed Consensus in Multivehicle Cooperative Control: Theory and Applications Wei Ren and Randal W. Beard Springer ISBN: 978-1-84800-014-8 Tutorial Slides Prepared by Wei Ren Department of Electrical
More informationLecture Notes: Euclidean Traveling Salesman Problem
IOE 691: Approximation Algorithms Date: 2/6/2017, 2/8/2017 ecture Notes: Euclidean Traveling Salesman Problem Instructor: Viswanath Nagarajan Scribe: Miao Yu 1 Introduction In the Euclidean Traveling Salesman
More informationCHAPTER 6 PERCEPTUAL ORGANIZATION BASED ON TEMPORAL DYNAMICS
CHAPTER 6 PERCEPTUAL ORGANIZATION BASED ON TEMPORAL DYNAMICS This chapter presents a computational model for perceptual organization. A figure-ground segregation network is proposed based on a novel boundary
More information6.867 Machine Learning
6.867 Machine Learning Problem set - solutions Thursday, October What and how to turn in? Turn in short written answers to the questions explicitly stated, and when requested to explain or prove. Do not
More informationConvexization in Markov Chain Monte Carlo
in Markov Chain Monte Carlo 1 IBM T. J. Watson Yorktown Heights, NY 2 Department of Aerospace Engineering Technion, Israel August 23, 2011 Problem Statement MCMC processes in general are governed by non
More informationMarkov chain Monte Carlo methods
Markov chain Monte Carlo methods (supplementary material) see also the applet http://www.lbreyer.com/classic.html February 9 6 Independent Hastings Metropolis Sampler Outline Independent Hastings Metropolis
More informationAdvanced Topics In Machine Learning Project Report : Low Dimensional Embedding of a Pose Collection Fabian Prada
Advanced Topics In Machine Learning Project Report : Low Dimensional Embedding of a Pose Collection Fabian Prada 1 Introduction In this project we present an overview of (1) low dimensional embedding,
More informationFinite Element Methods for the Poisson Equation and its Applications
Finite Element Methods for the Poisson Equation and its Applications Charles Crook July 30, 2013 Abstract The finite element method is a fast computational method that also has a solid mathematical theory
More informationStable Trajectory Design for Highly Constrained Environments using Receding Horizon Control
Stable Trajectory Design for Highly Constrained Environments using Receding Horizon Control Yoshiaki Kuwata and Jonathan P. How Space Systems Laboratory Massachusetts Institute of Technology {kuwata,jhow}@mit.edu
More informationDistributed Averaging on Asynchronous Communication Networks
2005 Conference on Decision and Control (CDC) http://www.cds.caltech.edu/~murray/papers/2005m_meh+05-cdc.html Distributed Averaging on Asynchronous Communication Networks Mortada Mehyar, Demetri Spanos,
More informationLevel-set MCMC Curve Sampling and Geometric Conditional Simulation
Level-set MCMC Curve Sampling and Geometric Conditional Simulation Ayres Fan John W. Fisher III Alan S. Willsky February 16, 2007 Outline 1. Overview 2. Curve evolution 3. Markov chain Monte Carlo 4. Curve
More informationLQR-RRT : Optimal Sampling-Based Motion Planning with Automatically Derived Extension Heuristics
LQR-RRT : Optimal Sampling-Based Motion Planning with Automatically Derived Extension Heuristics Alejandro Perez, Robert Platt Jr., George Konidaris, Leslie Kaelbling and Tomas Lozano-Perez Computer Science
More informationAutomorphism Groups of Cyclic Polytopes
8 Automorphism Groups of Cyclic Polytopes (Volker Kaibel and Arnold Waßmer ) It is probably well-known to most polytope theorists that the combinatorial automorphism group of a cyclic d-polytope with n
More informationOptimization Plugin for RapidMiner. Venkatesh Umaashankar Sangkyun Lee. Technical Report 04/2012. technische universität dortmund
Optimization Plugin for RapidMiner Technical Report Venkatesh Umaashankar Sangkyun Lee 04/2012 technische universität dortmund Part of the work on this technical report has been supported by Deutsche Forschungsgemeinschaft
More informationRefraction of Light. Research Problem. Materials. Procedure. Due Date. Glass Block Protractor Ruler PENCIL 4 Pins Cardboard
Name SI Physics Period Date Lab #0(90 pts) Mrs. Nadworny Due Date Research Problem Materials Refraction of Light When a ray of light passes obliquely (at an angle) from air to glass, it is refracted. The
More informationState Estimation for Continuous-Time Systems with Perspective Outputs from Discrete Noisy Time-Delayed Measurements
State Estimation for Continuous-Time Systems with Perspective Outputs from Discrete Noisy Time-Delayed Measurements António Pedro Aguiar aguiar@ece.ucsb.edu João Pedro Hespanha hespanha@ece.ucsb.edu Dept.
More informationA MATLAB PHYSICAL OPTICS RCS PREDICTION CODE
A MATLAB PHYSICAL OPTICS RCS PREDICTION CODE Elmo E. Garrido, Jr. and David C. Jenn Naval Postgraduate School Monterey, CA 93943 SUMMARY POFACETS is an implementation of the physical optics approximation
More informationCONFORMAL MAPPING POTENTIAL FLOW AROUND A WINGSECTION USED AS A TEST CASE FOR THE INVISCID PART OF RANS SOLVERS
European Conference on Computational Fluid Dynamics ECCOMAS CFD 2006 P. Wesseling, E. Oñate and J. Périaux (Eds) c TU Delft, The Netherlands, 2006 CONFORMAL MAPPING POTENTIAL FLOW AROUND A WINGSECTION
More informationElectromagnetic migration of marine CSEM data in areas with rough bathymetry Michael S. Zhdanov and Martin Čuma*, University of Utah
Electromagnetic migration of marine CSEM data in areas with rough bathymetry Michael S. Zhdanov and Martin Čuma*, University of Utah Summary In this paper we present a new approach to the interpretation
More informationForward Time-of-Flight Detector Efficiency for CLAS12
Forward Time-of-Flight Detector Efficiency for CLAS12 D.S. Carman, Jefferson Laboratory ftof eff.tex May 29, 2014 Abstract This document details an absolute hit efficiency study of the FTOF panel-1a and
More informationPrinciples of Wireless Sensor Networks
Principles of Wireless Sensor Networks www.kth.se/student/program-kurser/kurshemsidor/kurshemsidor/control/el2745 Lecture 6 Stockholm, February 6, 2012 Carlo Fischione Royal Institute of Technology - KTH
More informationMultilevel Optimization for Multi-Modal X-ray Data Analysis
Multilevel Optimization for Multi-Modal X-ray Data Analysis Zichao (Wendy) Di Mathematics & Computer Science Division Argonne National Laboratory May 25, 2016 2 / 35 Outline Multi-Modality Imaging Example:
More informationA new implementation of the dqds algorithm
Kinji Kimura Kyoto Univ. Kinji Kimura (Kyoto Univ.) 1 / 26 We propose a new implementation of the dqds algorithm for the bidiagonal SVD. Kinji Kimura (Kyoto Univ.) 2 / 26 Our aim(1) srand(1); n=70000;
More informationRegents Physics Lab #30R. Due Date. Refraction of Light
Name Date Regents Physics Lab #0R Period Mrs. Nadworny Research Problem Materials Refraction of Light Due Date When a ray of light passes obliquely (at an angle) from air to glass, it is refracted. The
More informationEdges, interpolation, templates. Nuno Vasconcelos ECE Department, UCSD (with thanks to David Forsyth)
Edges, interpolation, templates Nuno Vasconcelos ECE Department, UCSD (with thanks to David Forsyth) Edge detection edge detection has many applications in image processing an edge detector implements
More information2D vector fields 3. Contents. Line Integral Convolution (LIC) Image based flow visualization Vector field topology. Fast LIC Oriented LIC
2D vector fields 3 Scientific Visualization (Part 8) PD Dr.-Ing. Peter Hastreiter Contents Line Integral Convolution (LIC) Fast LIC Oriented LIC Image based flow visualization Vector field topology 2 Applied
More informationOptimal Proxy-Limited Lines for Representing Voltage Constraints in a DC Optimal Powerflow
Optimal Proxy-Limited Lines for Representing Voltage Constraints in a DC Optimal Powerflow by Michael Schlindwein A thesis submitted in fulfillment of the requirements for the degree of Master of Science
More informationVisible Color. 700 (red) 580 (yellow) 520 (green)
Color Theory Physical Color Visible energy - small portion of the electro-magnetic spectrum Pure monochromatic colors are found at wavelengths between 380nm (violet) and 780nm (red) 380 780 Color Theory
More informationEdge detection. Gradient-based edge operators
Edge detection Gradient-based edge operators Prewitt Sobel Roberts Laplacian zero-crossings Canny edge detector Hough transform for detection of straight lines Circle Hough Transform Digital Image Processing:
More informationPrinciples of Wireless Sensor Networks
Principles of Wireless Sensor Networks https://www.kth.se/social/course/el2745/ Lecture 6 Routing Carlo Fischione Associate Professor of Sensor Networks e-mail:carlofi@kth.se http://www.ee.kth.se/ carlofi/
More informationLecture 4 Duality and Decomposition Techniques
Lecture 4 Duality and Decomposition Techniques Jie Lu (jielu@kth.se) Richard Combes Alexandre Proutiere Automatic Control, KTH September 19, 2013 Consider the primal problem Lagrange Duality Lagrangian
More informationDUAL energy X-ray radiography [1] can be used to separate
IEEE TRANSACTIONS ON NUCLEAR SCIENCE, VOL. 53, NO. 1, FEBRUARY 2006 133 A Scatter Correction Using Thickness Iteration in Dual-Energy Radiography S. K. Ahn, G. Cho, and H. Jeon Abstract In dual-energy
More informationELEG Compressive Sensing and Sparse Signal Representations
ELEG 867 - Compressive Sensing and Sparse Signal Representations Gonzalo R. Arce Depart. of Electrical and Computer Engineering University of Delaware Fall 211 Compressive Sensing G. Arce Fall, 211 1 /
More informationLoad Flow Analysis. I Objectives
EE342 Electrical Power Lab Experiment PS3 Load Flow Analysis I Objectives To demonstrate load flow concepts. To study system performance under different operating conditions. To experience the real feel
More informationThroughput-Optimal Broadcast in Wireless Networks with Point-to-Multipoint Transmissions
Throughput-Optimal Broadcast in Wireless Networks with Point-to-Multipoint Transmissions Abhishek Sinha Laboratory for Information and Decision Systems MIT MobiHoc, 2017 April 18, 2017 1 / 63 Introduction
More informationDelaunay-based Derivative-free Optimization via Global Surrogate. Pooriya Beyhaghi, Daniele Cavaglieri and Thomas Bewley
Delaunay-based Derivative-free Optimization via Global Surrogate Pooriya Beyhaghi, Daniele Cavaglieri and Thomas Bewley May 23, 2014 Delaunay-based Derivative-free Optimization via Global Surrogate Pooriya
More informationLecture 8: Fitting. Tuesday, Sept 25
Lecture 8: Fitting Tuesday, Sept 25 Announcements, schedule Grad student extensions Due end of term Data sets, suggestions Reminder: Midterm Tuesday 10/9 Problem set 2 out Thursday, due 10/11 Outline Review
More informationDecentralized Computation of Homology Groups in Networks by Gossip
Decentralized Computation of Homology Groups in Networks by Gossip Abubakr Muhammad and Ali Jadbabaie Department of Electrical and Systems Engineering University of Pennsylvania, Philadelphia, PA {abubakr,jadbabai}@seas.upenn.edu
More information