Time-average constraints in stochastic Model Predictive Control
|
|
- Roland Daniel
- 5 years ago
- Views:
Transcription
1 Time-average constraints in stochastic Model Predictive Control James Fleming Mark Cannon ACC, May 2017 James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
2 Outline 1. Motivation 2. Problem statement 3. MPC for parametric uncertainty 4. Handling time-average constraints 5. Numerical example James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
3 Motivation For linear dynamics + additive disturbances parameter uncertainty state/control constraints: Enforcing constraints for all uncertainty realisations can be conservative Some applications allow non-zero constraint violation rate e.g. engine knock control wind turbine control building climate control hence consider constraint softening methods: Chance constraints Schwarm 99, Oldewurtel 08, Cannon 11 Time-average constraints Oldewurtel 13, Korda 14 James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
4 Motivation Chance constraints: computationally hard & possibly non-convex if invoked explicitly Prékopa 95 hold with confidence < 1 if imposed approximately Campi 08, Calafiore 10 Time-average constraints constraints tightened according to observed violation frequency asymptotic limit on average violation rate Oldewurtel 13, Korda 14 This paper s approach: limit on number of violations on any time-interval of a given length James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
5 Problem formulation Control objective: regulate state x t to 0 subject to F x t 1 sufficiently frequently System model: x t+1 = A(ω t )x t + B(ω t )u t + w(ω t ) ω t : unknown parameter with polytopic bound, hence x t+1 Conv { A (i) x t + B (i) u t + w (i)}, i = 1,..., p Stabilizability assumption: K, V, g exist such that {x R n : V x g} is: invariant for x t+1 Conv { (A (i) + B (i) K)x t + w (i)} a subset of {x : F x 1} James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
6 Problem formulation Consider two types of time-average constraint Type 1: average number of violations in interval T must not exceed ε for all t and given T, t+t 1 1 require M k ε T k=t { 0, F x t 1 where M t = 1, F x t 1 implies 1 t 1 M k ε for all t T t k=0 analogous to chance constraint: P { F x t 1 } ɛ James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
7 Problem formulation Consider two types of time-average constraint Type 2: average loss over interval T must not exceed l for all t and given T, require t+t 1 1 l(f x k 1) T l k=t where l : R q R convex loss function allows higher penalties on larger violations analogous to expected value constraint: E { l(f x t 1) } l James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
8 Outline 1. Motivation 2. Problem statement 3. MPC for parametric uncertainty 4. Handling time-average constraints 5. Numerical example James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
9 Dual Mode Predictions Predicted control input at time t: u k t = Kx k t + c k t, k = 0, 1,..., { decision variable k < N (mode 1) c k t = 0 k N (mode 2) Predicted state trajectories x k+1 t Conv{Φ (i) x k t + B (i) c k t + w (i), i = 1... p} Φ (i) = A (i) + B (i) K state space e.g. N = 4 (1 realisation) x 0 t x x 1 t x2 t x x 3 t x x x 4 t x terminal set prediction time James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
10 Tube MPC p uncertainty vertices = x k t belongs to a set with p k vertices Bound x k t using fixed-complexity polytopes T k t to avoid exponential growth: x 0 t T 0 t, x k t T k t = x k+1 t T k+1 T T N t : robustly invariant under u = Kx state space T 0 t T 1 t e.g. N = 4 T 2 t T 3 t T 4 t terminal set prediction time James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
11 Tube MPC Define T k t = {x : V x α k t }, k = 0, 1,... fixed face normals, flexibility due to variable α k t set α k t = g for all k N = T N t robustly invariant optimize c t = (c 0 t,..., c N 1 t ) and α t = (α 0 t,..., α N 1 t ) at each time t James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
12 Tube constraints Inclusion constraints: { T k t x : Φ (i) x + B (i) c k t + w (i) T k+1 t, } i = 1,..., p T k t T k+1 t Feasibility constraints: T k t { x : F x 1 } T k t Impose these conditions using F x 1 {x : V 1 x g 1 } {x : V 2 x g 2 } iff H 0 s.t. HV 1 = V 2, Hg 1 g 2 James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
13 Tube constraints Proposition T k t { x : Φ (i) x + B (i) c k t + w (i) T k+1 t, i = 1,..., p } if T k t { x : F x 1 } if Γ (i) α k t + V B (i) c k t + V w (i) α k+1 t Λα k t 1 for some Γ (i) 0 satisfying Γ (i) V = V Φ (i) for some Λ 0 satisfying ΛV = F Determine Γ (i), Λ offline by minimizing the row-sums: Γ (i) j = arg min y {1 y : y V = V j Φ (i), y 0} Λ j = arg min y {1 y : y V = F j, y 0} then Γ (i), Λ are sparse with at most n non-zero elements in each row James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
14 Cost function Penalise deviation from a target set Ω = {x : W x h}, Ω robustly invariant under u = Kx Quadratic cost: J t = min s 0 t Ω k=0 ( ) E x k t s k t 2 Q + u k t Ks k t 2 R where s k+1 t = Φ(ω k t )s k t + w(ω k t ), k = 0, 1,... Proposition Let x 0 t = x t, then J t = min s t Ω where P E { Ψ (ω)p Ψ(ω) } = Q, with [ ] A(ω) + B(ω)K B(ω)E Ψ(ω) = 0 S and Ec t = c 0 t, Sc t = [c 1 t c N 1 t 0] [ ] xt s t 2 c t P [ ] Q + K Q RK K RE = E RK E RE James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
15 Outline 1. Motivation 2. Problem statement 3. MPC for parametric uncertainty 4. Handling time-average constraints 5. Numerical example James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
16 Time-average constraints Relaxed constraints: F x k t 1 + r b k t, where r : determines maximum constraint violation b k t : 0 or 1 depending on M t T +1,..., M t Enforce the time-average violation limit via constraints, for k = 1,..., N 1: v k t ɛ where v k t = 1 t M j + 1 k b k t T T j=t (T 1)+k j=1 M t T +2 M t 1 M t b 1 t v1 t M t T +3 M t b 1 t b 2 t v2 t. M t T +N M t b 1 t b N 1 t vn 1 t past future James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
17 Time-average constraints Relaxed constraints: F x k t 1 + r b k t, where r : determines maximum constraint violation b k t : 0 or 1 depending on M t T +1,..., M t Enforce the time-average violation limit via constraints, for k = 1,..., N 1: v k t ɛ where v k t = 1 t M j + 1 k b k t T T j=t (T 1)+k j=1 hence v 0 t = v 1 t 1 1 T b 1 t T M t v k t = v k 1 t 1 T M t T +k + 1 T b k t, for all k 1 so if v k 1 t 1 T M t T +k + 1 T ɛ, otherwise, set b k t = 0 then b k t = 1 is allowed James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
18 MPC Algorithm Initialize: M T = = M 1 = 0. At each time t = 0, 1,...: 1. determine M t and v 0 t given x t 2. for each k = 1,..., N 1: { 1 if v k 1 t 1 (a). b k t := T M t T +k + 1 T ε 0 otherwise (b). v k t := v k 1 t 1 T M t T +k + 1 T b k t 3. solve the QP: (c t, α t, s t ) := argmin c t,α t,s t 4. u t := Kx t + c 0 t s.t. [ ] xt s t 2 c t P V x t α 0 t, W s t h Λα k t 1 + b k t r Γ (i) α k t + V B (i) c k t + V w (i) α k+1 t for k = 0,..., N 1, α t+n t = g James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
19 Feasibility and constraint satisfaction Lemma If step 3 is feasible at time t, then for k < N 1 we have v k t+1 v k+1 t and b k+1 t = 1 = b k t+1 = 1 M t T +2 M t 1 M t b 1 t v1 t M t T +3 M t b 1 t b 2 t v2 t. v N 1 t Mt T +N M t b 1 t b N 1 t past future James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
20 Feasibility and constraint satisfaction Lemma If step 3 is feasible at time t, then for k < N 1 we have v k t+1 v k+1 t and b k+1 t = 1 = b k t+1 = 1 M t T +2 M t 1 M t M t+1 v0 t+1 M t T +3 M t M t+1 b 1 t+1 v1 t+1. v N 2 t+1 Mt T +N M t M t+1 b N 2 t+1 past future v N 1 t+1 Mt T +N+1 M t+1 b N 2 t+1 b N 1 t+1 James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
21 Feasibility and constraint satisfaction Lemma If step 3 is feasible at time t, then for k < N 1 we have v k t+1 v k+1 t and b k+1 t = 1 = b k t+1 = 1 for all k < N 1 we have v k t+1 v k+1 t = 1 T (M t+1 b 1 t ) + 1 T and M t+1 = 1 = k (b j t+1 b j+1 t ) j=1 b 1 t = 1 since step 3 is feasible at t = v k t+1 = v k+1 t in step 2 M t+1 = 0 = b 1 t = 1 or 0 = v k t+1 = v k+1 t 1 T or v k+1 t in step 2 therefore step 2 cannot tighten constraints at t + 1 for k < N 1 hence step 3 feasible at t = step 3 feasible at t + 1 James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
22 Feasibility and constraint satisfaction Theorem If step 3 is feasible at t = 0 then for all t 0 we have t+t 1 1 M k ɛ T k=t Step 3 enforces the constraint F x 1 t 1 + rb 1 t, so that M t+1 b 1 t Step 2 chooses b 1 t so that v 1 t ɛ Hence 1 T t+1 k=t T 2 M k 1 T t k=t T 2 M k + 1 T b 1 t = v 1 t ɛ James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
23 Closed loop stability Theorem Let φ t = (x t s t, c t ), then there exists δ (0, 1) such that, for all t 0, E { φ t 2 P } δ (t/n) 1 φ 0 2 P Hence convergence: x t s t and c t 0 in mean square Result follows from feasibility at time t + 1 of (c 1 t,..., c N 1 t, 0), (α 1 t,..., α N 1 t, g), Φ(ω t)s t + w(ω t ) which implies E { φ t+1 2 } P φt 2 P φ t 2 Q t 0 James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
24 Example Model parameters: A(ω) = A 0 + (1) A ω 1 + (2) A ω 2 + (3) A ω 3 B(ω) = B 0 + (1) B ω 4 + (2) B ω 5 w(ω) = w (1) ω 6 + w (2) ω 7 where ω 1,..., ω 7 are independent, uniformly distributed on [0, 1] and A 0 = [ ] [ ] , B = 0.25 ] [ (1) A = ] (1) B = [ [, (2) A = ], (2) B = [ , w (1) = [ ] [ ], (3) 0 0 A = ] [ ], w (2) 0.2 = 0.2 James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
25 Example Cost parameters: Q = I, R = 1 Ω = min. RPI set under u = Kx Constraint: [ 0.5 1]x t 1 relaxed version: [ 0.5 1]x k t b k t, r = 0.8 Prediction and constraint horizons: N = T = 3 Time-average constraint: t+2 M t 1, ɛ = 1/3 k=t Compare sample-based MPC with chance constraint Pr { [ 0.5 1]x 1 t > 1 } 1/3 James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
26 Example Time-average constraints Chance constraints James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
27 Example MPC with chance constraints % constraints satisfied, at t = average solver time (ms) closed-loop cost MPC with time-average constraints Chance constraints imposed via sampling with (greedy) discarding, with # samples limited by requirement for similar computation Fair comparison since both methods satisfy ensemble-average constraints James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
28 Conclusions Time-average constraints: MPC algorithm: enforced over an arbitrary time-interval satisfied robustly in transients as well as asymptotically recursively feasible and robustly stable computational requirement similar to robust MPC Impose limits on time-average of loss function using similar approach (details in proceedings) Sequential computation of tightening parameters is suboptimal but same approach allows for simultaneous optimization (requires MIQP) James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
29 Conclusions Time-average constraints: MPC algorithm: enforced over an arbitrary time-interval satisfied robustly in transients as well as asymptotically recursively feasible and robustly stable computational requirement similar to robust MPC Impose limits on time-average of loss function using similar approach (details in proceedings) Sequential computation of tightening parameters is suboptimal but same approach allows for simultaneous optimization (requires MIQP) James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
30 Thank you for your attention! James Fleming, Mark Cannon Time-average constraints in stochastic MPC ACC, May / 24
An approach for Model Predictive Control of mixed integer-input linear systems based on convex relaxations
5nd IEEE Conference on Decision and Control December -3, 3 Florence, Italy An approach for Model Predictive Control of mixed integer-input linear systems based on convex relaxations Marius Schmitt, Robin
More informationMODEL predictive control (MPC) is widely recognized
1192 IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY, VOL 16, NO 6, NOVEMBER 2008 Distributed MPC Strategies With Application to Power System Automatic Generation Control Aswin N Venkat, Ian A Hiskens,
More informationOptimal Coded Information Network Design and Management via Improved Characterizations of the Binary Entropy Function
Optimal Coded Information Network Design and Management via Improved Characterizations of the Binary Entropy Function John MacLaren Walsh & Steven Weber Department of Electrical and Computer Engineering
More informationInternational Journal of Multidisciplinary Research and Development 2015; 2(2): Mani Laxman Aiyar, Ravi Prakash G
2015; 2(2): 317-326 IJMRD 2015; 2(2): 317-326 www.allsubjectjournal.com Received: 02-02-2015 Accepted: 18-02-2015 E-ISSN: 2349-4182 P-ISSN: 2349-5979 Impact factor: 3.762 Mani Laxman Aiyar ECE Dept., Alliance
More informationConstructions of Coverings of the Integers: Exploring an Erdős Problem
Constructions of Coverings of the Integers: Exploring an Erdős Problem Kelly Bickel, Michael Firrisa, Juan Ortiz, and Kristen Pueschel August 20, 2008 Abstract In this paper, we study necessary conditions
More informationSignal Recovery from Random Measurements
Signal Recovery from Random Measurements Joel A. Tropp Anna C. Gilbert {jtropp annacg}@umich.edu Department of Mathematics The University of Michigan 1 The Signal Recovery Problem Let s be an m-sparse
More informationIEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 33, NO. 12, DECEMBER
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 33, NO. 12, DECEMBER 2015 2611 Optimal Policies for Wireless Networks With Energy Harvesting Transmitters and Receivers: Effects of Decoding Costs
More informationMPC Design for Power Electronics: Perspectives and Challenges
MPC Design for Power Electronics: Perspectives and Challenges Daniel E. Quevedo Chair for Automatic Control Institute of Electrical Engineering (EIM-E) Paderborn University, Germany dquevedo@ieee.org IIT
More informationMulti-class Services in the Internet
Non-convex Optimization and Rate Control for Multi-class Services in the Internet Jang-Won Lee, Ravi R. Mazumdar, and Ness B. Shroff School of Electrical and Computer Engineering Purdue University West
More informationComparison of a Switching Controller to two LTI Controllers for a Class of LTI Plants
8 American Control Conference Westin Seattle Hotel, Seattle, Washington, USA June -3, 8 FrB.5 Comparison of a Switching Controller to two LTI Controllers for a Class of LTI Plants Keith R. Santarelli Sandia
More informationCONTROL OF SENSORS FOR SEQUENTIAL DETECTION A STOCHASTIC APPROACH
file://\\52zhtv-fs-725v\cstemp\adlib\input\wr_export_131127111121_237836102... Page 1 of 1 11/27/2013 AFRL-OSR-VA-TR-2013-0604 CONTROL OF SENSORS FOR SEQUENTIAL DETECTION A STOCHASTIC APPROACH VIJAY GUPTA
More informationSummary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility
Summary Overview of Topics in Econ 30200b: Decision theory: strong and weak domination by randomized strategies, domination theorem, expected utility theorem (consistent decisions under uncertainty should
More informationSCHEDULING Giovanni De Micheli Stanford University
SCHEDULING Giovanni De Micheli Stanford University Outline The scheduling problem. Scheduling without constraints. Scheduling under timing constraints. Relative scheduling. Scheduling under resource constraints.
More informationIEEE/ACM TRANSACTIONS ON NETWORKING, VOL. XX, NO. X, AUGUST 20XX 1
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. XX, NO. X, AUGUST 0XX 1 Greenput: a Power-saving Algorithm That Achieves Maximum Throughput in Wireless Networks Cheng-Shang Chang, Fellow, IEEE, Duan-Shin Lee,
More informationQ-Learning Algorithms for Constrained Markov Decision Processes with Randomized Monotone Policies: Application to MIMO Transmission Control
Q-Learning Algorithms for Constrained Markov Decision Processes with Randomized Monotone Policies: Application to MIMO Transmission Control Dejan V. Djonin, Vikram Krishnamurthy, Fellow, IEEE Abstract
More informationControl of systems with costs related to switching: applications to air-condition systems
18th IEEE International Conference on Control Applications Part of 2009 IEEE Multi-conference on Systems and Control Saint Petersburg, Russia, July 8-10, 2009 Control of systems with costs related to switching:
More informationPerformance Characterization of IP Network-based Control Methodologies for DC Motor Applications Part II
Performance Characterization of IP Network-based Control Methodologies for DC Motor Applications Part II Tyler Richards, Mo-Yuen Chow Advanced Diagnosis Automation and Control Lab Department of Electrical
More informationMaximizing Throughput in Wireless Multi-Access Channel Networks
Maximizing Throughput in Wireless Multi-Access Channel Networks J. Crichigno,,M.Y.Wu, S. K. Jayaweera,W.Shu Department of Engineering, Northern New Mexico C., Espanola - NM, USA Electrical & Computer Engineering
More informationSecurity Enhancement through Direct Non-Disruptive Load Control
Security Enhancement through Direct Non-Disruptive Load Control Ian Hiskens (UW Madison) Vijay Vittal (ASU) Tele-Seminar, April 18, 26 Security Enhancement through Direct Non-Disruptive Load Control PROJECT
More informationOptimization Techniques for Alphabet-Constrained Signal Design
Optimization Techniques for Alphabet-Constrained Signal Design Mojtaba Soltanalian Department of Electrical Engineering California Institute of Technology Stanford EE- ISL Mar. 2015 Optimization Techniques
More informationPHYSICS 140A : STATISTICAL PHYSICS HW ASSIGNMENT #1 SOLUTIONS
PHYSICS 40A : STATISTICAL PHYSICS HW ASSIGNMENT # SOLUTIONS () The information entropy of a distribution {p n } is defined as S n p n log 2 p n, where n ranges over all possible configurations of a given
More informationBeyond Nyquist. Joel A. Tropp. Applied and Computational Mathematics California Institute of Technology
Beyond Nyquist Joel A. Tropp Applied and Computational Mathematics California Institute of Technology jtropp@acm.caltech.edu With M. Duarte, J. Laska, R. Baraniuk (Rice DSP), D. Needell (UC-Davis), and
More informationLoop Design. Chapter Introduction
Chapter 8 Loop Design 8.1 Introduction This is the first Chapter that deals with design and we will therefore start by some general aspects on design of engineering systems. Design is complicated because
More informationGeneralized Game Trees
Generalized Game Trees Richard E. Korf Computer Science Department University of California, Los Angeles Los Angeles, Ca. 90024 Abstract We consider two generalizations of the standard two-player game
More informationKernels and Support Vector Machines
Kernels and Support Vector Machines Machine Learning CSE446 Sham Kakade University of Washington November 1, 2016 2016 Sham Kakade 1 Announcements: Project Milestones coming up HW2 You ve implemented GD,
More informationOptimal Distributed Scheduling under Time-varying Conditions: A Fast-CSMA Algorithm with Applications
1 Optimal Distributed Scheduling under Time-varying Conditions: A Fast-CSMA Algorithm with Applications Bin Li and Atilla Eryilmaz Abstract Recently, low-complexity and distributed Carrier Sense Multiple
More informationOpportunistic Scheduling: Generalizations to. Include Multiple Constraints, Multiple Interfaces,
Opportunistic Scheduling: Generalizations to Include Multiple Constraints, Multiple Interfaces, and Short Term Fairness Sunil Suresh Kulkarni, Catherine Rosenberg School of Electrical and Computer Engineering
More informationROBUST POWER SYSTEM STABILIZER TUNING BASED ON MULTIOBJECTIVE DESIGN USING HIERARCHICAL AND PARALLEL MICRO GENETIC ALGORITHM
ROBUST POWER SYSTEM STABILIZER TUNING BASED ON MULTIOBJECTIVE DESIGN USING HIERARCHICAL AND PARALLEL MICRO GENETIC ALGORITHM Komsan Hongesombut, Sanchai Dechanupaprittha, Yasunori Mitani, and Issarachai
More information1890 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 30, NO. 10, NOVEMBER 2012
1890 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 30, NO. 10, NOVEMBER 2012 Dynamic Spectrum Sharing Among Repeatedly Interacting Selfish Users With Imperfect Monitoring Yuanzhang Xiao and Mihaela
More informationClosing the loop around Sensor Networks
Closing the loop around Sensor Networks Bruno Sinopoli Shankar Sastry Dept of Electrical Engineering, UC Berkeley Chess Review May 11, 2005 Berkeley, CA Conceptual Issues Given a certain wireless sensor
More informationA Backlog-Based CSMA Mechanism to Achieve Fairness and Throughput-Optimality in Multihop Wireless Networks
A Backlog-Based CSMA Mechanism to Achieve Fairness and Throughput-Optimality in Multihop Wireless Networks Peter Marbach, and Atilla Eryilmaz Dept. of Computer Science, University of Toronto Email: marbach@cs.toronto.edu
More informationLecture 25: The Theorem of (Dyadic) MRA
WAVELETS AND MULTIRATE DIGITAL SIGNAL PROCESSING Lecture 25: The Theorem of (Dyadic) MRA Prof.V.M.Gadre, EE, IIT Bombay 1 Introduction In the previous lecture, we discussed that translation and scaling
More informationDynamic Allocation of Subcarriers and. Transmit Powers in an OFDMA Cellular Network
Dynamic Allocation of Subcarriers and 1 Transmit Powers in an OFDMA Cellular Network Stephen V. Hanly, Lachlan L. H. Andrew and Thaya Thanabalasingham Abstract This paper considers the problem of minimizing
More informationAndrea Zanchettin Automatic Control 1 AUTOMATIC CONTROL. Andrea M. Zanchettin, PhD Spring Semester, Linear control systems design
Andrea Zanchettin Automatic Control 1 AUTOMATIC CONTROL Andrea M. Zanchettin, PhD Spring Semester, 2018 Linear control systems design Andrea Zanchettin Automatic Control 2 The control problem Let s introduce
More informationDecoding Turbo Codes and LDPC Codes via Linear Programming
Decoding Turbo Codes and LDPC Codes via Linear Programming Jon Feldman David Karger jonfeld@theorylcsmitedu karger@theorylcsmitedu MIT LCS Martin Wainwright martinw@eecsberkeleyedu UC Berkeley MIT LCS
More informationRouting in Massively Dense Static Sensor Networks
Routing in Massively Dense Static Sensor Networks Eitan ALTMAN, Pierre BERNHARD, Alonso SILVA* July 15, 2008 Altman, Bernhard, Silva* Routing in Massively Dense Static Sensor Networks 1/27 Table of Contents
More informationFrugal Sensing Spectral Analysis from Power Inequalities
Frugal Sensing Spectral Analysis from Power Inequalities Nikos Sidiropoulos Joint work with Omar Mehanna IEEE SPAWC 2013 Plenary, June 17, 2013, Darmstadt, Germany Wideband Spectrum Sensing (for CR/DSM)
More informationAndrea Zanchettin Automatic Control 1 AUTOMATIC CONTROL. Andrea M. Zanchettin, PhD Winter Semester, Linear control systems design Part 1
Andrea Zanchettin Automatic Control 1 AUTOMATIC CONTROL Andrea M. Zanchettin, PhD Winter Semester, 2018 Linear control systems design Part 1 Andrea Zanchettin Automatic Control 2 Step responses Assume
More informationON LOW-PASS RECONSTRUCTION AND STOCHASTIC MODELING OF PWM SIGNALS NOYAN CEM SEVÜKTEKİN THESIS
ON LOW-PASS RECONSTRUCTION AND STOCHASTIC MODELING OF PWM SIGNALS BY NOYAN CEM SEVÜKTEKİN THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Science in Electrical and
More informationTwo-stage column generation and applications in container terminal management
Two-stage column generation and applications in container terminal management Ilaria Vacca Matteo Salani Michel Bierlaire Transport and Mobility Laboratory EPFL 8th Swiss Transport Research Conference
More informationEffects of Basis-mismatch in Compressive Sampling of Continuous Sinusoidal Signals
Effects of Basis-mismatch in Compressive Sampling of Continuous Sinusoidal Signals Daniel H. Chae, Parastoo Sadeghi, and Rodney A. Kennedy Research School of Information Sciences and Engineering The Australian
More informationTransport Capacity and Spectral Efficiency of Large Wireless CDMA Ad Hoc Networks
Transport Capacity and Spectral Efficiency of Large Wireless CDMA Ad Hoc Networks Yi Sun Department of Electrical Engineering The City College of City University of New York Acknowledgement: supported
More informationarxiv: v2 [cs.it] 7 May 2017
Joint Millimeter Wave and Microwave Resources Allocation in Cellular Networks with Dual-Mode Base Stations Omid Semiari 1, Walid Saad 1, and Mehdi Bennis 2 1 Wireless@VT, Bradley Department of Electrical
More informationTHE WIRELESS NETWORK JAMMING PROBLEM
THE WIRELESS NETWORK JAMMING PROBLEM CLAYTON W. COMMANDER, PANOS M. PARDALOS, VALERIY RYABCHENKO, STAN URYASEV, AND GRIGORIY ZRAZHEVSKY ABSTRACT. In adversarial environments, disabling the communication
More informationInterference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks
Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks Yu Wang Weizhao Wang Xiang-Yang Li Wen-Zhan Song Abstract We study efficient interference-aware joint routing and
More informationA NEW EDUCATIONAL SOFTWARE TOOL FOR ROBUST CONTROL DESIGN USING THE QFT METHOD
A NEW EDUCATIONAL SOFTWARE TOOL FOR ROBUST CONTROL DESIGN USING THE QFT METHOD R. Nandakumar and G.D. Halikias School of Engineering and Mathematical Sciences, City University, London ECV, UK, {et78@city.ac.uk,
More informationCoordinated Scheduling and Power Control in Cloud-Radio Access Networks
Coordinated Scheduling and Power Control in Cloud-Radio Access Networks Item Type Article Authors Douik, Ahmed; Dahrouj, Hayssam; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim Citation Coordinated Scheduling
More informationA general quadratic programming method for the optimisation of genetic contributions using interior point algorithm. R Pong-Wong & JA Woolliams
A general quadratic programming method for the optimisation of genetic contributions using interior point algorithm R Pong-Wong & JA Woolliams Introduction Inbreeding is a risk and it needs to be controlled
More informationResource Allocation Challenges in Future Wireless Networks
Resource Allocation Challenges in Future Wireless Networks Mohamad Assaad Dept of Telecommunications, Supelec - France Mar. 2014 Outline 1 General Introduction 2 Fully Decentralized Allocation 3 Future
More informationOptimal Policies for Wireless Networks with Energy Harvesting Transmitters and Receivers: Effects of Decoding Costs
1 Optimal Policies for Wireless Networks with Energy Harvesting Transmitters and Receivers: Effects of Decoding Costs Ahmed Arafa, Student Member, IEEE and Sennur Ulukus, Member, IEEE arxiv:1509.04698v1
More informationNotes for Recitation 3
6.042/18.062J Mathematics for Computer Science September 17, 2010 Tom Leighton, Marten van Dijk Notes for Recitation 3 1 State Machines Recall from Lecture 3 (9/16) that an invariant is a property of a
More informationDynamic Fair Channel Allocation for Wideband Systems
Outlines Introduction and Motivation Dynamic Fair Channel Allocation for Wideband Systems Department of Mobile Communications Eurecom Institute Sophia Antipolis 19/10/2006 Outline of Part I Outlines Introduction
More informationP Shrikant Rao and Indraneel Sen
A QFT Based Robust SVC Controller For Improving The Dynamic Stability Of Power Systems.. P Shrikant Rao and Indraneel Sen ' Abstract A novel design technique for an SVC based Power System Damping Controller
More informationWIRELESS networks are ubiquitous nowadays, since. Distributed Scheduling of Network Connectivity Using Mobile Access Point Robots
Distributed Scheduling of Network Connectivity Using Mobile Access Point Robots Nikolaos Chatzipanagiotis, Student Member, IEEE, and Michael M. Zavlanos, Member, IEEE Abstract In this paper we consider
More informationComputational aspects of two-player zero-sum games Course notes for Computational Game Theory Section 3 Fall 2010
Computational aspects of two-player zero-sum games Course notes for Computational Game Theory Section 3 Fall 21 Peter Bro Miltersen November 1, 21 Version 1.3 3 Extensive form games (Game Trees, Kuhn Trees)
More informationResidential Load Control with Communications Delays and Constraints
power systems eehlaboratory Gregory Stephen Ledva Residential Load Control with Communications Delays and Constraints Master Thesis PSL1330 EEH Power Systems Laboratory Swiss Federal Institute of Technology
More informationAdversarial Attacks on Face Detectors using Neural Net based Constrained Optimization
Adversarial Attacks on Face Detectors using Neural Net based Constrained Optimization Joey Bose University of Toronto joey.bose@mail.utoronto.ca September 26, 2018 Joey Bose (UofT) GeekPwn Las Vegas September
More informationChapter 12. Cross-Layer Optimization for Multi- Hop Cognitive Radio Networks
Chapter 12 Cross-Layer Optimization for Multi- Hop Cognitive Radio Networks 1 Outline CR network (CRN) properties Mathematical models at multiple layers Case study 2 Traditional Radio vs CR Traditional
More informationCS188 Spring 2014 Section 3: Games
CS188 Spring 2014 Section 3: Games 1 Nearly Zero Sum Games The standard Minimax algorithm calculates worst-case values in a zero-sum two player game, i.e. a game in which for all terminal states s, the
More informationInternational Journal of Modern Engineering and Research Technology
Volume 5, Issue 1, January 2018 ISSN: 2348-8565 (Online) International Journal of Modern Engineering and Research Technology Website: http://www.ijmert.org Email: editor.ijmert@gmail.com Experimental Analysis
More informationOptimization in container terminals
Ilaria Vacca (EPFL) - Integrated optimization in container terminal operations p. 1/23 Optimization in container terminals Hierarchical vs integrated solution approaches Michel Bierlaire Matteo Salani
More informationCross-layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks
Cross-layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks Lijun Chen, Steven H. Low, Mung Chiang and John C. Doyle Engineering & Applied Science Division, California Institute
More informationStanford University CS261: Optimization Handout 9 Luca Trevisan February 1, 2011
Stanford University CS261: Optimization Handout 9 Luca Trevisan February 1, 2011 Lecture 9 In which we introduce the maximum flow problem. 1 Flows in Networks Today we start talking about the Maximum Flow
More informationMultiplayer Pushdown Games. Anil Seth IIT Kanpur
Multiplayer Pushdown Games Anil Seth IIT Kanpur Multiplayer Games we Consider These games are played on graphs (finite or infinite) Generalize two player infinite games. Any number of players are allowed.
More informationCapacitated Cell Planning of 4G Cellular Networks
Capacitated Cell Planning of 4G Cellular Networks David Amzallag, Roee Engelberg, Joseph (Seffi) Naor, Danny Raz Computer Science Department Technion, Haifa 32000, Israel {amzallag,roee,naor,danny}@cs.technion.ac.il
More informationJoint Perimeter and Signal Control of Urban Traffic via Network Utility Maximization
Joint Perimeter and Signal Control of Urban Traffic via Network Utility Maximization Negar Mehr, Jennie Lioris 2, Roberto Horowitz, and Ramtin Pedarsani 3 Abstract With the ongoing rise of demand in traffic
More informationIEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 59, NO. 3, MARCH
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 59, NO. 3, MARCH 2011 1183 Robust MIMO Cognitive Radio Via Game Theory Jiaheng Wang, Member, IEEE, Gesualdo Scutari, Member, IEEE, and Daniel P. Palomar, Senior
More informationOn Energy Efficiency Maximization of AF MIMO Relay Systems with Antenna Selection
On Energy Efficiency Maximization of AF MIMO Relay Systems with Antenna Selection (Invited Paper) Xingyu Zhou, Student Member, IEEE, Bo Bai Member, IEEE, Wei Chen Senior Member, IEEE, and Yuxing Han E-mail:
More informationLocalization (Position Estimation) Problem in WSN
Localization (Position Estimation) Problem in WSN [1] Convex Position Estimation in Wireless Sensor Networks by L. Doherty, K.S.J. Pister, and L.E. Ghaoui [2] Semidefinite Programming for Ad Hoc Wireless
More informationFOUR TOTAL TRANSFER CAPABILITY. 4.1 Total transfer capability CHAPTER
CHAPTER FOUR TOTAL TRANSFER CAPABILITY R structuring of power system aims at involving the private power producers in the system to supply power. The restructured electric power industry is characterized
More informationConvergence in competitive games
Convergence in competitive games Vahab S. Mirrokni Computer Science and AI Lab. (CSAIL) and Math. Dept., MIT. This talk is based on joint works with A. Vetta and with A. Sidiropoulos, A. Vetta DIMACS Bounded
More informationJamming Bandits. arxiv: v1 [cs.it] 13 Nov 2014 I. INTRODUCTION
Jamming Bandits 1 SaiDhiraj Amuru, Cem Tekin, Mihaela van der Schaar, R. Michael Buehrer Bradley Department of Electrical and Computer Engineering, Virginia Tech Department of Electrical Engineering, UCLA
More informationSupervisory Control for Cost-Effective Redistribution of Robotic Swarms
Supervisory Control for Cost-Effective Redistribution of Robotic Swarms Ruikun Luo Department of Mechaincal Engineering College of Engineering Carnegie Mellon University Pittsburgh, Pennsylvania 11 Email:
More informationHedonic Coalition Formation for Distributed Task Allocation among Wireless Agents
Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents Walid Saad, Zhu Han, Tamer Basar, Me rouane Debbah, and Are Hjørungnes. IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 10,
More informationWINDOW DESIGN AND ENHANCEMENT USING CHEBYSHEV OPTIMIZATION
st International Conference From Scientific Computing to Computational Engineering st IC-SCCE Athens, 8- September, 4 c IC-SCCE WINDOW DESIGN AND ENHANCEMENT USING CHEBYSHEV OPTIMIZATION To Tran, Mattias
More informationThis document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore.
This document is downloaded from DR-NTU, Nanyang Technological University Library, Singapore. Title Multi-hop diffusion LMS for energy-constrained distributed estimation Author(s) Hu, Wuhua; Tay, Wee Peng
More informationLecture 8 Receding Horizon Temporal Logic Planning & Compositional Protocol Synthesis
Lecture 8 Receding Horizon Temporal Logic Planning & Compositional Protocol Synthesis Ufuk Topcu Nok Wongpiromsarn Richard M. Murray EECI, 18 May 2012 Outline: Receding horizon temporal logic planning
More informationImpact of Limited Backhaul Capacity on User Scheduling in Heterogeneous Networks
Impact of Limited Backhaul Capacity on User Scheduling in Heterogeneous Networks Jagadish Ghimire and Catherine Rosenberg Department of Electrical and Computer Engineering, University of Waterloo, Canada
More informationLecture 2. 1 Nondeterministic Communication Complexity
Communication Complexity 16:198:671 1/26/10 Lecture 2 Lecturer: Troy Lee Scribe: Luke Friedman 1 Nondeterministic Communication Complexity 1.1 Review D(f): The minimum over all deterministic protocols
More informationImproving the Generalized Likelihood Ratio Test for Unknown Linear Gaussian Channels
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 49, NO 4, APRIL 2003 919 Improving the Generalized Likelihood Ratio Test for Unknown Linear Gaussian Channels Elona Erez, Student Member, IEEE, and Meir Feder,
More informationOn Delay Performance Gains From Network Coding
On Delay Performance Gains From Network Coding Atilla Eryilmaz Laboratory for Information and Decision Systems Massachusetts Institute of Technology Cambridge, MA, 02139 Email: eryilmaz@mit.edu (Invited
More informationTeam-Triggered Coordination of Robotic Networks for Optimal Deployment
Team-Triggered Coordination of Robotic Networks for Optimal Deployment Cameron Nowzari 1, Jorge Cortés 2, and George J. Pappas 1 Electrical and Systems Engineering 1 University of Pennsylvania Mechanical
More informationLearning Algorithms for Servomechanism Time Suboptimal Control
Learning Algorithms for Servomechanism Time Suboptimal Control M. Alexik Department of Technical Cybernetics, University of Zilina, Univerzitna 85/, 6 Zilina, Slovakia mikulas.alexik@fri.uniza.sk, ABSTRACT
More informationOutline for today s lecture Informed Search Optimal informed search: A* (AIMA 3.5.2) Creating good heuristic functions Hill Climbing
Informed Search II Outline for today s lecture Informed Search Optimal informed search: A* (AIMA 3.5.2) Creating good heuristic functions Hill Climbing CIS 521 - Intro to AI - Fall 2017 2 Review: Greedy
More informationFast sweeping methods and applications to traveltime tomography
Fast sweeping methods and applications to traveltime tomography Jianliang Qian Wichita State University and TRIP, Rice University TRIP Annual Meeting January 26, 2007 1 Outline Eikonal equations. Fast
More informationQueue-Aware Resource Allocation for Downlink OFDMA Cognitive Radio Networks
3100 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 9, NO. 10, OCTOBER 2010 Queue-Aware Resource Allocation for Downlink OFDMA Cognitive Radio Networks Patrick Mitran, Member, IEEE, Long Bao Le, Member,
More informationTracking of Rapidly Time-Varying Sparse Underwater Acoustic Communication Channels
Tracking of Rapidly Time-Varying Sparse Underwater Acoustic Communication Channels Weichang Li WHOI Mail Stop 9, Woods Hole, MA 02543 phone: (508) 289-3680 fax: (508) 457-2194 email: wli@whoi.edu James
More informationBandwidth Estimation Using End-to- End Packet-Train Probing: Stochastic Foundation
Bandwidth Estimation Using End-to- End Packet-Train Probing: Stochastic Foundation Xiliang Liu Joint work with Kaliappa Ravindran and Dmitri Loguinov Department of Computer Science City University of New
More informationControl of Electric Motors and Drives via Convex Optimization
Control of Electric Motors and Drives via Convex Optimization Nicholas Moehle Advisor: Stephen Boyd February 5, 2018 Outline 1. waveform design for electric motors permanent magnet induction 2. control
More informationLectures: Feb 27 + Mar 1 + Mar 3, 2017
CS420+500: Advanced Algorithm Design and Analysis Lectures: Feb 27 + Mar 1 + Mar 3, 2017 Prof. Will Evans Scribe: Adrian She In this lecture we: Summarized how linear programs can be used to model zero-sum
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 15, NO. 12, DECEMBER
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 15, NO. 12, DECEMBER 2016 8565 QC 2 LinQ: QoS and Channel-Aware Distributed Lin Scheduler for D2D Communication Hyun-Su Lee and Jang-Won Lee, Senior Member,
More informationFeedback via Message Passing in Interference Channels
Feedback via Message Passing in Interference Channels (Invited Paper) Vaneet Aggarwal Department of ELE, Princeton University, Princeton, NJ 08544. vaggarwa@princeton.edu Salman Avestimehr Department of
More informationRecovering Lost Sensor Data through Compressed Sensing
Recovering Lost Sensor Data through Compressed Sensing Zainul Charbiwala Collaborators: Younghun Kim, Sadaf Zahedi, Supriyo Chakraborty, Ting He (IBM), Chatschik Bisdikian (IBM), Mani Srivastava The Big
More informationA Novel Adaptive Algorithm for
A Novel Adaptive Algorithm for Sinusoidal Interference Cancellation H. C. So Department of Electronic Engineering, City University of Hong Kong Tat Chee Avenue, Kowloon, Hong Kong August 11, 2005 Indexing
More informationCISCO has predicated that the global mobile data demand
1 Time and Location Aware Mobile Data Pricing Qian Ma, Student Member, IEEE, Ya-Feng Liu, Member, IEEE, and Jianwei Huang, Senior Member, IEEE arxiv:1511.3v1 [cs.ni] 1 Nov 15 Abstract Mobile users correlated
More informationA Dynamic Programming Algorithm for Robust Runway Scheduling
A Dynamic Programming Algorithm for Robust Runway Scheduling Bala Chandran and Hamsa Balakrishnan Abstract An algorithm for generating schedules of airport runway operations that are robust to perturbations
More informationMultiuser Scheduling and Power Sharing for CDMA Packet Data Systems
Multiuser Scheduling and Power Sharing for CDMA Packet Data Systems Sandeep Vangipuram NVIDIA Graphics Pvt. Ltd. No. 10, M.G. Road, Bangalore 560001. sandeep84@gmail.com Srikrishna Bhashyam Department
More informationAlgorithms and Data Structures: Network Flows. 24th & 28th Oct, 2014
Algorithms and Data Structures: Network Flows 24th & 28th Oct, 2014 ADS: lects & 11 slide 1 24th & 28th Oct, 2014 Definition 1 A flow network consists of A directed graph G = (V, E). Flow Networks A capacity
More informationOn the Unicast Capacity of Stationary Multi-channel Multi-radio Wireless Networks: Separability and Multi-channel Routing
1 On the Unicast Capacity of Stationary Multi-channel Multi-radio Wireless Networks: Separability and Multi-channel Routing Liangping Ma arxiv:0809.4325v2 [cs.it] 26 Dec 2009 Abstract The first result
More informationIEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 57, NO. 3, MARCH X/$ IEEE
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 57, NO. 3, MARCH 2009 993 Blind Multiband Signal Reconstruction: Compressed Sensing for Analog Signals Moshe Mishali, Student Member, IEEE, and Yonina C. Eldar,
More information