T.W. Scholten, C. de Persis, P. Tesi

Slides:



Advertisements
Similar presentations
Application of the Root-Locus Method to the Design and Sensitivity Analysis of Closed-Loop Thermoacoustic Engines C Mark Johnson.
Advertisements

The Primal-Dual Method: Steiner Forest TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A AA A A A AA A A.
Lectures on NP-hard problems and Approximation algorithms
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
Dynamic Behavior of Closed-Loop Control Systems
DS.GR.14 Graph Matching Input: 2 digraphs G1 = (V1,E1), G2 = (V2,E2) Questions to ask: 1.Are G1 and G2 isomorphic? 2.Is G1 isomorphic to a subgraph of.
Yinghui Wu, LFCS DB talk Database Group Meeting Talk Yinghui Wu 10/11/ Simulation Revised for Graph Pattern Matching.
1 Product Flow Model May 2008 Product Flow Model Overview.
Nash Game and Mixed H 2 /H  Control by H. de O. Florentino, R.M. Sales, 1997 and by D.J.N. Limebeer, B.D.O. Anderson, and Hendel, 1994 Presensted by Hui-Hung.
PROCESS MODELLING AND MODEL ANALYSIS © CAPE Centre, The University of Queensland Hungarian Academy of Sciences Analysis of Dynamic Process Models C13.
ENGM 732 Formalization of Network Flows Network Flow Models.
EMIS 8374 Vertex Connectivity Updated 20 March 2008.
1 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modeling Yong Liu 09/19/2007.
FIRST AND SECOND-ORDER TRANSIENT CIRCUITS
Approximation Algorithm: Iterative Rounding Lecture 15: March 9.
NORM BASED APPROACHES FOR AUTOMATIC TUNING OF MODEL BASED PREDICTIVE CONTROL Pastora Vega, Mario Francisco, Eladio Sanz University of Salamanca – Spain.
Outline Max Flow Algorithm Model of Computation Proposed Algorithm Self Stabilization Contribution 1 A self-stabilizing algorithm for the maximum flow.
Near-Optimal Network Design with Selfish Agents By Elliot Anshelevich, Anirban Dasgupta, Eva Tardos, Tom Wexler STOC’03 Presented by Mustafa Suleyman CIFTCI.
1 Topology Design of Structured Campus Networks by Habib Youssef Sadiq M. SaitSalman A. Khan Department of Computer Engineering King Fahd University of.
Yashar Ganjali High Performance Networking Group Stanford University September 17, 2003 Minimum-delay Routing.
1 Topology Control of Multihop Wireless Networks Using Transmit Power Adjustment Infocom /12/20.
Package Transportation Scheduling Albert Lee Robert Z. Lee.
Flow Models and Optimal Routing. How can we evaluate the performance of a routing algorithm –quantify how well they do –use arrival rates at nodes and.
Approximating Minimum Bounded Degree Spanning Tree (MBDST) Mohit Singh and Lap Chi Lau “Approximating Minimum Bounded DegreeApproximating Minimum Bounded.
Low-Power Gated Bus Synthesis for 3D IC via Rectilinear Shortest-Path Steiner Graph Chung-Kuan Cheng, Peng Du, Andrew B. Kahng, and Shih-Hung Weng UC San.
CSE 421 Algorithms Richard Anderson Lecture 24 Network Flow Applications.
Linear Programming Data Structures and Algorithms A.G. Malamos References: Algorithms, 2006, S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani Introduction.
The minimum cost flow problem. Simplifying assumptions Network is connected (as an undirected graph). – We can consider each connected component separately.
Optimization of Wavelength Assignment for QoS Multicast in WDM Networks Xiao-Hua Jia, Ding-Zhu Du, Xiao-Dong Hu, Man-Kei Lee, and Jun Gu, IEEE TRANSACTIONS.
Cooperative Recovery of Distributed Storage Systems from Multiple Losses with Network Coding Yuchong Hu, Yinlong Xu, Xiaozhao Wang, Cheng Zhan and Pei.
Learning the Structure of Related Tasks Presented by Lihan He Machine Learning Reading Group Duke University 02/03/2006 A. Niculescu-Mizil, R. Caruana.
Flow Algorithms Prepared by John Reif, Ph.D. Distinguished Professor of Computer Science Duke University Analysis of Algorithms Week 9, Lecture 2.
Measuring Behavioral Trust in Social Networks
EMIS 8373: Integer Programming Combinatorial Relaxations and Duals Updated 8 February 2005.
Computing Branchwidth via Efficient Triangulations and Blocks Authors: F.V. Fomin, F. Mazoit, I. Todinca Presented by: Elif Kolotoglu, ISE, Texas A&M University.
CSCI-256 Data Structures & Algorithm Analysis Lecture Note: Some slides by Kevin Wayne. Copyright © 2005 Pearson-Addison Wesley. All rights reserved. 25.
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
Introduction to Multiple-multicast Routing Chu-Fu Wang.
1)Effect of Network Coding in Graphs Undirecting the edges is roughly as strong as allowing network coding simplicity is the main benefit 2)Effect of Network.
T.W.Scholten, C. de Persis, P. Tesi
CSCI2950-C Genomes, Networks, and Cancer
BIPARTITE GRAPHS AND ITS APPLICATIONS
The minimum cost flow problem
Modeling and Control of Heat Networks with Storage:
Introduction to Graph Theory
EMIS 8373: Integer Programming
FIRST AND SECOND-ORDER TRANSIENT CIRCUITS
Large Graph Mining: Power Tools and a Practitioner’s guide
En Wang 1,2 , Yongjian Yang 1 , and Jie Wu 2
ALGEBRA I - SECTION 6-6 (Systems of Linear Inequalities)
Koorde: A simple degree optimal DHT
3-3 Optimization with Linear Programming
3.5 Minimum Cuts in Undirected Graphs
Introduction Basic formulations Applications
Introduction Wireless Ad-Hoc Network
Flow Networks Topics Flow Networks Residual networks
Sungho Kang Yonsei University
Introduction to Process Control
Graphs.
Algorithms for Budget-Constrained Survivable Topology Design
Flow Networks and Bipartite Matching
CS224w: Social and Information Network Analysis
ALGEBRA I - SECTION 6-6 (Systems of Linear Inequalities)
INTRODUCTION TO NETWORK FLOWS
Sanguthevar Rajasekaran University of Connecticut
Maximum Flow Problems in 2005.
State-Variable Description Motivation
EMIS 8374 Max-Flow in Undirected Networks Updated 18 March 2008
Presentation transcript:

T.W. Scholten, C. de Persis, P. Tesi Optimal Steady State Regulation of Distribution Networks with Input and Flow Constraints T.W. Scholten, C. de Persis, P. Tesi

Outline Motivation Problem description Model Control goal 1 Introduction Motivation Problem description Model Unsaturated Control goal 1 Controller design 1 Stability result Saturated Control goal 2 Controller design 2 Main result Case study Conclusion Conclusions Future work

Introduction Unsaturated Saturated conclusion Motivation Introduction Unsaturated Saturated conclusion

Introduction Unsaturated Saturated conclusion Problem description Introduction Unsaturated Saturated conclusion

Introduction Unsaturated Saturated conclusion Problem description Introduction Unsaturated Saturated conclusion

Introduction Unsaturated Saturated conclusion Model Introduction Unsaturated Saturated conclusion

Introduction Unsaturated Saturated conclusion Control goal 1 Design distributed controllers and such that (flow on the edges) (input at the nodes) where Introduction Unsaturated Saturated conclusion

Introduction Unsaturated Saturated conclusion Controller design Flow on the edges suitable gains. Input on the nodes Recall: suitable gains. Introduction Unsaturated Saturated conclusion

Introduction Unsaturated Saturated conclusion Closed loop Introduction Unsaturated Saturated conclusion

Introduction Unsaturated Saturated conclusion Result If: undirected graph G is connected there exists a of s.t. then Problem 1 Solved Introduction Unsaturated Saturated conclusion

Introduction Unsaturated Saturated conclusion Saturation Motivation: Introduction Unsaturated Saturated conclusion

Introduction Unsaturated Saturated conclusion Control problem 2 Design distributed controllers (flow on the edges) (input at the nodes) such that given positive real (arbitrarily small) numbers with and for all Introduction Unsaturated Saturated conclusion

Introduction Unsaturated Saturated conclusion Controller design Flow on the edges suitable gains. Input on the nodes suitable gains. Introduction Unsaturated Saturated conclusion

Introduction Unsaturated Saturated conclusion Closed loop system Steady state deviation from optimum Introduction Unsaturated Saturated conclusion

Introduction Unsaturated Saturated conclusion Matching condition Let be the optimal steady state input and a corresponding flowrate. Then, the matching condition is satisfied if Introduction Unsaturated Saturated conclusion

Introduction Unsaturated Saturated conclusion Main result If Matching condition is satisfied There exists at least one pair of s.t. The directed graph G is strongly connected The directed graph G is balanced and Details skipped Then Problem 2 is solved Introduction Unsaturated Saturated conclusion

Introduction Unsaturated Saturated conclusion Case study: Discharge (volume) Store (volume) Unsaturated flows Saturated flow Saturated input Optimal input Transient behavior Introduction Unsaturated Saturated conclusion

Introduction Unsaturated Saturated conclusion Conclusions Considered distribution network Disturbances Costs associated to input Controller design Flows on links Input on nodes Considered saturation of flows and input (practical) stability results Applied to district heating networks Introduction Unsaturated Saturated conclusion

Introduction Unsaturated Saturated conclusion Future work Remove assumption of balanced graphs Relax or remove bounds on Relax restriction More general model Including pressures Algebraic nodes (no storage) Introduction Unsaturated Saturated conclusion

Introduction Model Control conclusion