Adaptation and Synchronization over a Network: stabilization without a reference model
|
|
- Dennis Jacobs
- 5 years ago
- Views:
Transcription
1 Adapaion and Synchronizaion over a Nework: sabilizaion wihou a reference model Travis E. Gibson (gibson@mi.edu) Harvard Medical School Deparmen of Pahology, Brigham and Women s Hospial 55 h Conference on Decision and Conrol December 12-14, 216
2 Problem Saemen Adapive Sysems Nework Consensus Sysem Error Generaion Parameer Adapaion Consensus Error How do we achieve consensus and learning wihou a reference model? Can synchronous inpus enhance adapaion? 2/22
3 Inroducion and Ouline Synchronizaion can hur learning Example of wo unsable sysems (builds on Narendra s recen work) Synchronizaion and Learning in Neworks Resuls Using Graph Theory Concree connecions o classic adapive conrol (if ime allows) 3/22
4 Synchronizaion vs. Learning: Tradeoffs 4/22
5 Two sysems sabilizing each oher Consider wo unsable sysems [Narendra and Harshangi (214)] Updae laws wih e = x 1 x 2. Σ 1 : ẋ 1 () = a 1 ()x 1 ()+u 1 () Σ 2 : ẋ 2 () = a 2 ()x 2 ()+u 2 () ȧ 1 () = x 1 ()e() a 1 () > ȧ 2 () = x 2 ()e() a 2 () > No Inpu u 1 = u 2 = x1,x x1 x2 a1,a a1 a /22
6 Synchronizaion Hurs Learning Synchronous Inpu u 1 = e u 2 = +e e = x 1 x 2 x1,x x1 1.8 a1 x2 a a1,a2 Desynchronous Inpu u 1 = +e u 2 = e x1,x x1 x2 a1,a a1 a2 6/22
7 Sabiliy Resuls for Synchronous and Desynchronous Inpus Σ 1 : ẋ 1 () = a 1 ()x 1 ()+u 1 () Σ 2 : ẋ 2 () = a 2 ()x 2 ()+u 2 () ȧ 1 () = x 1 ()e() ȧ 2 () = x 2 ()e() Theorem: Synchronous Inpus The dynamics above wih synchronous inpus have a se of iniial condiions wih non-zero measure for which x 1 and x 2 end o infiniy while e L 2 L and e as. Furhermore, his se of iniial condiions ha are unsable is also unbounded. Theorem: Desynchronous Inpus The dynamics above wih desynchronous inpus are sable for all a 1 () a 2 () 7/22
8 Synchronizaion and learning in neworks 8/22
9 Graph Noaion and Consensus Graph : G(V,E) Verex Se : V = {v 1,v 2,...,v n } Edge Se : (v i,v j ) E V V v 1 v 4 Adjacency Marix : [A] ij = v 2 v 3 { 1 if (v j,v i ) E oherwise In-degree Laplacian : L(G) = D(G) A(G) In-degree of Node i : [D] ii Consensus Problem Σ i : ẋ i = Using Graph Noaion j N in(i) (x i x j ) Σ : ẋ = Lx, x = [x 1, x 2,..., x n ] T 9/22
10 Review: Sufficien Condiion for Consensus Σ : ẋ = Lx Theorem: (Olfai-Saber and Murray, 24) For he dynamics above wih G srongly conneced i follows ha lim x() = ζ1, for some finie ζ R. If G is also balanced hen ζ = 1 n n i=1 x i(), i.e. average consensus is reached. srongly conneced here is a walk beween any wo verices in he nework. balanced if he in-degree of each node is equal o is ou-degree. Any srongly conneced digraph can be balanced (Marshall and Olkin, 1968). Disribued algorihms exis o balance a digraph (Dominguez-Garcia and Hadjicosis, 213). 1/22
11 Reurn o Adapive Sabilizaion Consider a se of n possibly unsable sysems Σ i ẋ i () = a i x i +θ i ()x Updae Law θ i = x i j N in(i) (x i x j ) Compac form Σ : ẋ = Ax+diag(θ)x [A] ii = a i θ = x Lx θ = [θ 1, θ 2,..., θ n ] T 11/22
12 Sabilizaion over Srongly Conneced Graphs Theorem ẋ = Ax+diag(θ)x θ = x Lx For he dynamics above wih G a srongly conneced digraph, and all he a i +θ i() no idenical i follows ha lim x() =. G is srongly conneced = λ i(l) closed righ-half plane of C. L is Mezler = Diagonal D > s.. L T D DL. Non-increasing funcion n n [D] iiθ i() = x T DLxd+ [D] iiθ i() i=1 = 1 2 i=1 x T (DL+L T D)xd+ n [D] iiθ i(). L1 = = 1 T (DL+L T D)1 =. κ λ 2(DL+L T D) > = i [D]iiθi() κ x T xd+ i θi() when x / span(1). i=1 12/22
13 Sabilizaion over Conneced Graphs Any conneced digraph can be pariioned ino disjoin subses called Srongly Conneced Componens (SCCs) where each subses is a maximal srongly conneced subgraph Graph G Condensed Graph G SCC roo condensed nodes in red For any conneced G he corresponding G SCC is a Direced Acyclic Graph (DAG) Every conneced DAG conains a roo node (no unique). 13/22
14 Sabilizaion over Conneced Graphs Con. Theorem ẋ = Ax+diag(θ)x θ = x Lx For he dynamics above wih he adapaion occurring over a conneced graph G such ha a roo can be chosen in G SCC ha is a condensed node, hen lim x() = The roo is a srongly conneced subgraph (hus sabilizes iself) All informaion flowing over G decimaes from a sable SCC. Sabiliy of each SCC hen follows from he hierarchical srucure of he DAG. G SCC 14/22
15 Sabilizaion over Conneced Graphs: Example of Necessiy This node can never sabilize if iniially unsable 15/22
16 Consensus and Leaning Bring everyhing ogeher as a layered archiecure The communicaion graph is G G a is he adapaion graph and is consrained by he communicaion in G G s is he synchronizaion graph and is similarly consrained G G a G s (Doyle and Csee, 211), (Alderson and Doyle, 21) 16/22
17 Adapive Sabilizaion over a Nework Σ : ẋ = Ax+diag(θ)x θ = x L a x G a = xi.5 θi /22
18 Adapive Sabilizaion and Desynchronous Inpu Σ : ẋ = Ax+L s x+diag(θ)x θ = Γx L a x G a = G s = 1 2 xi θi /22
19 Summary Borrowing from Narendra, Murray, and My Thesis, we have Found ha synchronizaion can hur learning. As always conex is imporan Wha abou oher learning paradigms, i.e. Jadbabaie s work or he broader Machine Learning lieraure Bibliography Alderson, D. L and J. C Doyle. 21. Conrasing views of complexiy and heir implicaions for nework-cenric infrasrucures, Sysems, Man and Cyberneics, Par A: Sysems and Humans, IEEE Transacions on 4, no. 4, Dominguez-Garcia, A. D. and C. N. Hadjicosis Disribued marix scaling and applicaion o average consensus in direced graphs, Auomaic Conrol, IEEE Transacions on 58, no. 3, Doyle, J. C. and M. Csee Archiecure, consrains, and behavior, Proceedings of he Naional Academy of Sciences 18, no. Supplemen 3, Marshall, A. W and I. Olkin Scaling of marices o achieve specified row and column sums, Numerische Mahemaik 12, no. 1, Narendra, K. S. and P. Harshangi Unsable sysems sabilizing each oher hrough adapaion, American Conrol Conference, pp Olfai-Saber, R. and R. M Murray. 24. Consensus problems in neworks of agens wih swiching opology and ime-delays, Auomaic Conrol, IEEE Transacions on 49, no. 9, /22
20 Closed-loop Reference Model (CRM) feedback gain l r Reference Model Plan x m x - e θ() γ learning rae 2/22
21 How does CRM Help? Classic Open-loop Reference Model (ORM) Adapive (l = ) The reference model does no adjus o any ouside facors reference: x m plan: x Closed-loop Reference Model (CRM) Adapive The reference model adjuss o rapidly reduce he model following error e = x x m reference: x m plan: x 21/22
22 γ = 1 l = γ = 1 l = 1 CRM Simulaion Examples Sae Sae xm 1 θ xp.5 k Parameer x o m 1 θ xm.5 k 1.5 xp Parameer γ = 1 l = 1 Sae x o m 1 θ xm.5 k 1.5 xp How do you choose γ and l? Parameer 22/22
arxiv: v1 [cs.dc] 8 Mar 2012
Consensus on Moving Neighborhood Model of Peerson Graph arxiv:.9v [cs.dc] 8 Mar Hannah Arend and Jorgensen Jos Absrac In his paper, we sudy he consensus problem of muliple agens on a kind of famous graph,
More informationSynchronization in Networks of Identical Linear Systems
Proceedings of he 47h IEEE Conference on Decision and Conrol Cancun, Meico, Dec. 9-11, 28 Synchronizaion in Neworks of Idenical Linear Sysems Luca Scardovi and Rodolphe Sepulchre Absrac The paper invesigaes
More informationStabilization of NCSs: Asynchronous Partial Transfer Approach
25 American Conrol Conference June 8-, 25 Porland, OR, USA WeC3 Sabilizaion of NCSs: Asynchronous Parial Transfer Approach Guangming Xie, Long Wang Absrac In his paper, a framework for sabilizaion of neworked
More informationGlobal Synchronization of Directed Networks with Fast Switching Topologies
Commun. Theor. Phys. (Beijing, China) 52 (2009) pp. 1019 1924 c Chinese Physical Sociey and IOP Publishing Ld Vol. 52, No. 6, December 15, 2009 Global Synchronizaion of Direced Neworks wih Fas Swiching
More informationNotes for Lecture 17-18
U.C. Berkeley CS278: Compuaional Complexiy Handou N7-8 Professor Luca Trevisan April 3-8, 2008 Noes for Lecure 7-8 In hese wo lecures we prove he firs half of he PCP Theorem, he Amplificaion Lemma, up
More informationdi Bernardo, M. (1995). A purely adaptive controller to synchronize and control chaotic systems.
di ernardo, M. (995). A purely adapive conroller o synchronize and conrol chaoic sysems. hps://doi.org/.6/375-96(96)8-x Early version, also known as pre-prin Link o published version (if available):.6/375-96(96)8-x
More informationSaturation-tolerant average consensus with controllable rates of convergence
Sauraion-oleran average consensus wih conrollable raes of convergence Solmaz S. Kia Jorge Cores Sonia Marinez Absrac This paper considers he saic average consensus problem for a muli-agen sysem and proposes
More informationComputer-Aided Analysis of Electronic Circuits Course Notes 3
Gheorghe Asachi Technical Universiy of Iasi Faculy of Elecronics, Telecommunicaions and Informaion Technologies Compuer-Aided Analysis of Elecronic Circuis Course Noes 3 Bachelor: Telecommunicaion Technologies
More informationMean-square Stability Control for Networked Systems with Stochastic Time Delay
JOURNAL OF SIMULAION VOL. 5 NO. May 7 Mean-square Sabiliy Conrol for Newored Sysems wih Sochasic ime Delay YAO Hejun YUAN Fushun School of Mahemaics and Saisics Anyang Normal Universiy Anyang Henan. 455
More informationStability and Bifurcation in a Neural Network Model with Two Delays
Inernaional Mahemaical Forum, Vol. 6, 11, no. 35, 175-1731 Sabiliy and Bifurcaion in a Neural Nework Model wih Two Delays GuangPing Hu and XiaoLing Li School of Mahemaics and Physics, Nanjing Universiy
More informationSliding Mode Extremum Seeking Control for Linear Quadratic Dynamic Game
Sliding Mode Exremum Seeking Conrol for Linear Quadraic Dynamic Game Yaodong Pan and Ümi Özgüner ITS Research Group, AIST Tsukuba Eas Namiki --, Tsukuba-shi,Ibaraki-ken 5-856, Japan e-mail: pan.yaodong@ais.go.jp
More informationDistributed Linear Supervisory Control
3rd IEEE Conference on Decision and Conrol December -7, Los Angeles, California, USA Disribued Linear Supervisory Conrol Ali Khanafer, Tamer Başar, and Daniel Liberzon Absrac In his work, we propose a
More informationStable approximations of optimal filters
Sable approximaions of opimal filers Joaquin Miguez Deparmen of Signal Theory & Communicaions, Universidad Carlos III de Madrid. E-mail: joaquin.miguez@uc3m.es Join work wih Dan Crisan (Imperial College
More informationI. Introduction to place/transition nets. Place/Transition Nets I. Example: a vending machine. Example: a vending machine
Inroducory Tuorial I. Inroducion o place/ransiion nes Place/Transiion Nes I Prepared by: Jörg Desel, Caholic Universiy in Eichsä and Karsen Schmid, Humbold-Universiä zu Berlin Speaker: Wolfgang Reisig,
More informationSingularly perturbed algorithms for dynamic average consensus
Singularly perurbed algorihms for dynamic average consensus Solmaz S. Kia Jorge Corés Sonia Marínez Absrac This paper proposes wo coninuous-ime dynamic average consensus algorihms for neworks wih srongly
More informationStationary Distribution. Design and Analysis of Algorithms Andrei Bulatov
Saionary Disribuion Design and Analysis of Algorihms Andrei Bulaov Algorihms Markov Chains 34-2 Classificaion of Saes k By P we denoe he (i,j)-enry of i, j Sae is accessible from sae if 0 for some k 0
More informationApplication of a Stochastic-Fuzzy Approach to Modeling Optimal Discrete Time Dynamical Systems by Using Large Scale Data Processing
Applicaion of a Sochasic-Fuzzy Approach o Modeling Opimal Discree Time Dynamical Sysems by Using Large Scale Daa Processing AA WALASZE-BABISZEWSA Deparmen of Compuer Engineering Opole Universiy of Technology
More informationON QUANTIZATION AND COMMUNICATION TOPOLOGIES IN MULTI-VEHICLE RENDEZVOUS 1. Karl Henrik Johansson Alberto Speranzon,2 Sandro Zampieri
ON QUANTIZATION AND COMMUNICATION TOPOLOGIES IN MULTI-VEHICLE RENDEZVOUS 1 Karl Henrik Johansson Albero Speranzon, Sandro Zampieri Deparmen of Signals, Sensors and Sysems Royal Insiue of Technology Osquldas
More informationBifurcation Analysis of a Stage-Structured Prey-Predator System with Discrete and Continuous Delays
Applied Mahemaics 4 59-64 hp://dx.doi.org/.46/am..4744 Published Online July (hp://www.scirp.org/ournal/am) Bifurcaion Analysis of a Sage-Srucured Prey-Predaor Sysem wih Discree and Coninuous Delays Shunyi
More information6.01: Introduction to EECS I Lecture 8 March 29, 2011
6.01: Inroducion o EES I Lecure 8 March 29, 2011 6.01: Inroducion o EES I Op-Amps Las Time: The ircui Absracion ircuis represen sysems as connecions of elemens hrough which currens (hrough variables) flow
More informationGeorey E. Hinton. University oftoronto. Technical Report CRG-TR February 22, Abstract
Parameer Esimaion for Linear Dynamical Sysems Zoubin Ghahramani Georey E. Hinon Deparmen of Compuer Science Universiy oftorono 6 King's College Road Torono, Canada M5S A4 Email: zoubin@cs.orono.edu Technical
More informationOptimal Paired Choice Block Designs. Supplementary Material
Saisica Sinica: Supplemen Opimal Paired Choice Block Designs Rakhi Singh 1, Ashish Das 2 and Feng-Shun Chai 3 1 IITB-Monash Research Academy, Mumbai, India 2 Indian Insiue of Technology Bombay, Mumbai,
More informationd 1 = c 1 b 2 - b 1 c 2 d 2 = c 1 b 3 - b 1 c 3
and d = c b - b c c d = c b - b c c This process is coninued unil he nh row has been compleed. The complee array of coefficiens is riangular. Noe ha in developing he array an enire row may be divided or
More informationT L. t=1. Proof of Lemma 1. Using the marginal cost accounting in Equation(4) and standard arguments. t )+Π RB. t )+K 1(Q RB
Elecronic Companion EC.1. Proofs of Technical Lemmas and Theorems LEMMA 1. Le C(RB) be he oal cos incurred by he RB policy. Then we have, T L E[C(RB)] 3 E[Z RB ]. (EC.1) Proof of Lemma 1. Using he marginal
More informationMulti-Agent Trajectory Tracking with Self-Triggered Cloud Access
2016 IEEE 55h Conference on Decision and Conrol CDC ARIA Resor & Casino December 12-14, 2016, Las Vegas, USA Muli-Agen Traecory Tracking wih Self-Triggered Cloud Access Anonio Adaldo, Davide Liuzza, Dimos
More informationChapter #1 EEE8013 EEE3001. Linear Controller Design and State Space Analysis
Chaper EEE83 EEE3 Chaper # EEE83 EEE3 Linear Conroller Design and Sae Space Analysis Ordinary Differenial Equaions.... Inroducion.... Firs Order ODEs... 3. Second Order ODEs... 7 3. General Maerial...
More information3.1.3 INTRODUCTION TO DYNAMIC OPTIMIZATION: DISCRETE TIME PROBLEMS. A. The Hamiltonian and First-Order Conditions in a Finite Time Horizon
3..3 INRODUCION O DYNAMIC OPIMIZAION: DISCREE IME PROBLEMS A. he Hamilonian and Firs-Order Condiions in a Finie ime Horizon Define a new funcion, he Hamilonian funcion, H. H he change in he oal value of
More informationTimed Circuits. Asynchronous Circuit Design. Timing Relationships. A Simple Example. Timed States. Timing Sequences. ({r 6 },t6 = 1.
Timed Circuis Asynchronous Circui Design Chris J. Myers Lecure 7: Timed Circuis Chaper 7 Previous mehods only use limied knowledge of delays. Very robus sysems, bu exremely conservaive. Large funcional
More informationSTATE-SPACE MODELLING. A mass balance across the tank gives:
B. Lennox and N.F. Thornhill, 9, Sae Space Modelling, IChemE Process Managemen and Conrol Subjec Group Newsleer STE-SPACE MODELLING Inroducion: Over he pas decade or so here has been an ever increasing
More informationMATH 128A, SUMMER 2009, FINAL EXAM SOLUTION
MATH 28A, SUMME 2009, FINAL EXAM SOLUTION BENJAMIN JOHNSON () (8 poins) [Lagrange Inerpolaion] (a) (4 poins) Le f be a funcion defined a some real numbers x 0,..., x n. Give a defining equaion for he Lagrange
More informationA Dynamic Model of Economic Fluctuations
CHAPTER 15 A Dynamic Model of Economic Flucuaions Modified for ECON 2204 by Bob Murphy 2016 Worh Publishers, all righs reserved IN THIS CHAPTER, OU WILL LEARN: how o incorporae dynamics ino he AD-AS model
More informationLecture 20: Riccati Equations and Least Squares Feedback Control
34-5 LINEAR SYSTEMS Lecure : Riccai Equaions and Leas Squares Feedback Conrol 5.6.4 Sae Feedback via Riccai Equaions A recursive approach in generaing he marix-valued funcion W ( ) equaion for i for he
More informationHierarchical Design of Decentralized Receding Horizon Controllers for Decoupled Systems
Hierarchical Design of Decenralized Receding Horizon Conrollers for Decoupled Sysems Tamás Keviczy, Francesco Borrelli, Gary J. Balas* Absrac We consider a se of decoupled dynamical sysems and an opimal
More informationThe field of mathematics has made tremendous impact on the study of
A Populaion Firing Rae Model of Reverberaory Aciviy in Neuronal Neworks Zofia Koscielniak Carnegie Mellon Universiy Menor: Dr. G. Bard Ermenrou Universiy of Pisburgh Inroducion: The field of mahemaics
More informationSimulating models with heterogeneous agents
Simulaing models wih heerogeneous agens Wouer J. Den Haan London School of Economics c by Wouer J. Den Haan Individual agen Subjec o employmen shocks (ε i, {0, 1}) Incomplee markes only way o save is hrough
More informationFor example, the comb filter generated from. ( ) has a transfer function. e ) has L notches at ω = (2k+1)π/L and L peaks at ω = 2π k/l,
Comb Filers The simple filers discussed so far are characeried eiher by a single passband and/or a single sopband There are applicaions where filers wih muliple passbands and sopbands are required The
More informationSignal and System (Chapter 3. Continuous-Time Systems)
Signal and Sysem (Chaper 3. Coninuous-Time Sysems) Prof. Kwang-Chun Ho kwangho@hansung.ac.kr Tel: 0-760-453 Fax:0-760-4435 1 Dep. Elecronics and Informaion Eng. 1 Nodes, Branches, Loops A nework wih b
More informationStability and Convergence in Adaptive Systems *
Sabiliy and Convergence in Adapive Sysems * Margarea Sefanovic, Rengrong Wang, and Michael G. Safonov Universiy of Souhern California, Los Angeles, CA 989-563 Absrac - Sufficien condiions for adapive conrol
More informationContinuous Time Linear Time Invariant (LTI) Systems. Dr. Ali Hussein Muqaibel. Introduction
/9/ Coninuous Time Linear Time Invarian (LTI) Sysems Why LTI? Inroducion Many physical sysems. Easy o solve mahemaically Available informaion abou analysis and design. We can apply superposiion LTI Sysem
More informationContinuous Time. Time-Domain System Analysis. Impulse Response. Impulse Response. Impulse Response. Impulse Response. ( t) + b 0.
Time-Domain Sysem Analysis Coninuous Time. J. Robers - All Righs Reserved. Edied by Dr. Rober Akl 1. J. Robers - All Righs Reserved. Edied by Dr. Rober Akl 2 Le a sysem be described by a 2 y ( ) + a 1
More informationRobust and Learning Control for Complex Systems
Robus and Learning Conrol for Complex Sysems Peer M. Young Sepember 13, 2007 & Talk Ouline Inroducion Robus Conroller Analysis and Design Theory Experimenal Applicaions Overview MIMO Robus HVAC Conrol
More informationAnalytical Solutions of an Economic Model by the Homotopy Analysis Method
Applied Mahemaical Sciences, Vol., 26, no. 5, 2483-249 HIKARI Ld, www.m-hikari.com hp://dx.doi.org/.2988/ams.26.6688 Analyical Soluions of an Economic Model by he Homoopy Analysis Mehod Jorge Duare ISEL-Engineering
More informationAnti-Disturbance Control for Multiple Disturbances
Workshop a 3 ACC Ani-Disurbance Conrol for Muliple Disurbances Lei Guo (lguo@buaa.edu.cn) Naional Key Laboraory on Science and Technology on Aircraf Conrol, Beihang Universiy, Beijing, 9, P.R. China. Presened
More informationCMU-Q Lecture 3: Search algorithms: Informed. Teacher: Gianni A. Di Caro
CMU-Q 5-38 Lecure 3: Search algorihms: Informed Teacher: Gianni A. Di Caro UNINFORMED VS. INFORMED SEARCH Sraegy How desirable is o be in a cerain inermediae sae for he sake of (effecively) reaching a
More informationResearch Article Synchronization of the Extended Bonhoffer-Van der Pol Oscillators
Mahemaical Problems in Engineering Volume 212, Aricle ID 96268, 14 pages doi:.11/212/96268 Research Aricle Synchronizaion of he Exended Bonhoffer-Van der Pol Oscillaors Mohamed Zribi and Saleh Alshamali
More informationSpeaker Adaptation Techniques For Continuous Speech Using Medium and Small Adaptation Data Sets. Constantinos Boulis
Speaker Adapaion Techniques For Coninuous Speech Using Medium and Small Adapaion Daa Ses Consaninos Boulis Ouline of he Presenaion Inroducion o he speaker adapaion problem Maximum Likelihood Sochasic Transformaions
More informationAdaptive Leader-following Consensus of Multiple Uncertain Rigid Spacecraft Systems
Preprins of he 19h World Congress he Inernaional Federaion of Auomaic Conrol Cape own, Souh Africa. Augus 24-29, 214 Adapive Leader-following Consensus of Muliple Uncerain Rigid Spacecraf Sysems He Cai
More informationRemoving Useless Productions of a Context Free Grammar through Petri Net
Journal of Compuer Science 3 (7): 494-498, 2007 ISSN 1549-3636 2007 Science Publicaions Removing Useless Producions of a Conex Free Grammar hrough Peri Ne Mansoor Al-A'ali and Ali A Khan Deparmen of Compuer
More information1 Review of Zero-Sum Games
COS 5: heoreical Machine Learning Lecurer: Rob Schapire Lecure #23 Scribe: Eugene Brevdo April 30, 2008 Review of Zero-Sum Games Las ime we inroduced a mahemaical model for wo player zero-sum games. Any
More informationAppendix 14.1 The optimal control problem and its solution using
1 Appendix 14.1 he opimal conrol problem and is soluion using he maximum principle NOE: Many occurrences of f, x, u, and in his file (in equaions or as whole words in ex) are purposefully in bold in order
More informationChapter 5 Digital PID control algorithm. Hesheng Wang Department of Automation,SJTU 2016,03
Chaper 5 Digial PID conrol algorihm Hesheng Wang Deparmen of Auomaion,SJTU 216,3 Ouline Absrac Quasi-coninuous PID conrol algorihm Improvemen of sandard PID algorihm Choosing parameer of PID regulaor Brief
More informationnon -negative cone Population dynamics motivates the study of linear models whose coefficient matrices are non-negative or positive.
LECTURE 3 Linear/Nonnegaive Marix Models x ( = Px ( A= m m marix, x= m vecor Linear sysems of difference equaions arise in several difference conexs: Linear approximaions (linearizaion Perurbaion analysis
More informationFoundations of Statistical Inference. Sufficient statistics. Definition (Sufficiency) Definition (Sufficiency)
Foundaions of Saisical Inference Julien Beresycki Lecure 2 - Sufficiency, Facorizaion, Minimal sufficiency Deparmen of Saisics Universiy of Oxford MT 2016 Julien Beresycki (Universiy of Oxford BS2a MT
More informationReconstructing the power grid dynamic model from sparse measurements
Reconsrucing he power grid dynamic model from sparse measuremens Andrey Lokhov wih Michael Cherkov, Deepjyoi Deka, Sidhan Misra, Marc Vuffray Los Alamos Naional Laboraory Banff, Canada Moivaion: learning
More informationModified Projective Synchronization of Different Hyperchaotic Systems
ISSN 76-7659, England, UK Journal of Informaion and Compuing Science Vol., No., 009, pp. 033-00 Modified Projecive Synchronizaion of Differen Hyperchaoic Sysems HongLan Zhu, +, XueBing Zhang Huaiyin Insiue
More informationAccelerated Distributed Nesterov Gradient Descent for Convex and Smooth Functions
07 IEEE 56h Annual Conference on Decision and Conrol (CDC) December -5, 07, Melbourne, Ausralia Acceleraed Disribued Neserov Gradien Descen for Convex and Smooh Funcions Guannan Qu, Na Li Absrac This paper
More informationAverage consensus by gossip algorithms with quantized communication
Average consensus by gossip algorihms wih quanized communicaion Paolo Frasca, Ruggero Carli, Fabio Fagnani, and Sandro Zampieri Absrac This work sudies how he randomized gossip algorihm can solve he average
More informationFour Generations of Higher Order Sliding Mode Controllers. L. Fridman Universidad Nacional Autonoma de Mexico Aussois, June, 10th, 2015
Four Generaions of Higher Order Sliding Mode Conrollers L. Fridman Universidad Nacional Auonoma de Mexico Aussois, June, 1h, 215 Ouline 1 Generaion 1:Two Main Conceps of Sliding Mode Conrol 2 Generaion
More informationLinear Dynamic Models
Linear Dnamic Models and Forecasing Reference aricle: Ineracions beween he muliplier analsis and he principle of acceleraion Ouline. The sae space ssem as an approach o working wih ssems of difference
More informationINDEX. Transient analysis 1 Initial Conditions 1
INDEX Secion Page Transien analysis 1 Iniial Condiions 1 Please inform me of your opinion of he relaive emphasis of he review maerial by simply making commens on his page and sending i o me a: Frank Mera
More informationOn Distributed Estimation for Sensor Networks
On Disribued Esimaion for Sensor Neworks Albero Speranzon, Carlo Fischione, and Karl Henrik Johansson Absrac Disribued esimaors for sensor neworks are discussed. The considered problem is on how o rack
More informationHybrid Control and Switched Systems. Lecture #3 What can go wrong? Trajectories of hybrid systems
Hybrid Conrol and Swiched Sysems Lecure #3 Wha can go wrong? Trajecories of hybrid sysems João P. Hespanha Universiy of California a Sana Barbara Summary 1. Trajecories of hybrid sysems: Soluion o a hybrid
More informationGraphical Event Models and Causal Event Models. Chris Meek Microsoft Research
Graphical Even Models and Causal Even Models Chris Meek Microsof Research Graphical Models Defines a join disribuion P X over a se of variables X = X 1,, X n A graphical model M =< G, Θ > G =< X, E > is
More informationLongest Common Prefixes
Longes Common Prefixes The sandard ordering for srings is he lexicographical order. I is induced by an order over he alphabe. We will use he same symbols (,
More informationZürich. ETH Master Course: L Autonomous Mobile Robots Localization II
Roland Siegwar Margaria Chli Paul Furgale Marco Huer Marin Rufli Davide Scaramuzza ETH Maser Course: 151-0854-00L Auonomous Mobile Robos Localizaion II ACT and SEE For all do, (predicion updae / ACT),
More informationA DELAY-DEPENDENT STABILITY CRITERIA FOR T-S FUZZY SYSTEM WITH TIME-DELAYS
A DELAY-DEPENDENT STABILITY CRITERIA FOR T-S FUZZY SYSTEM WITH TIME-DELAYS Xinping Guan ;1 Fenglei Li Cailian Chen Insiue of Elecrical Engineering, Yanshan Universiy, Qinhuangdao, 066004, China. Deparmen
More informationAN OPTIMAL CONTROL PROBLEM FOR SPLINES ASSOCIATED TO LINEAR DIFFERENTIAL OPERATORS
CONTROLO 6 7h Poruguese Conference on Auomaic Conrol Insiuo Superior Técnico, Lisboa, Porugal Sepember -3, 6 AN OPTIMAL CONTROL PROBLEM FOR SPLINES ASSOCIATED TO LINEAR DIFFERENTIAL OPERATORS Rui C. Rodrigues,
More information10. State Space Methods
. Sae Space Mehods. Inroducion Sae space modelling was briefly inroduced in chaper. Here more coverage is provided of sae space mehods before some of heir uses in conrol sysem design are covered in he
More informationModular and Multi-view Representation of Complex Hybrid Systems
Modular and Muli-view Represenaion of Complex Hybrid Sysems Luc THEVENON, Jean-Marie FLAUS Laboraoire d Auomaique de Grenoble UMR 5528 CNRS-INPG-UJF ENSIEG, BP 46, F-38402, Sain Marin d Hères Cedex FRANCE
More informationRC, RL and RLC circuits
Name Dae Time o Complee h m Parner Course/ Secion / Grade RC, RL and RLC circuis Inroducion In his experimen we will invesigae he behavior of circuis conaining combinaions of resisors, capaciors, and inducors.
More informationCHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK
175 CHAPTER 10 VALIDATION OF TEST WITH ARTIFICAL NEURAL NETWORK 10.1 INTRODUCTION Amongs he research work performed, he bes resuls of experimenal work are validaed wih Arificial Neural Nework. From he
More informationParticle Swarm Optimization
Paricle Swarm Opimizaion Speaker: Jeng-Shyang Pan Deparmen of Elecronic Engineering, Kaohsiung Universiy of Applied Science, Taiwan Email: jspan@cc.kuas.edu.w 7/26/2004 ppso 1 Wha is he Paricle Swarm Opimizaion
More informationChapter 3 Boundary Value Problem
Chaper 3 Boundary Value Problem A boundary value problem (BVP) is a problem, ypically an ODE or a PDE, which has values assigned on he physical boundary of he domain in which he problem is specified. Le
More informationRL Lecture 7: Eligibility Traces. R. S. Sutton and A. G. Barto: Reinforcement Learning: An Introduction 1
RL Lecure 7: Eligibiliy Traces R. S. Suon and A. G. Baro: Reinforcemen Learning: An Inroducion 1 N-sep TD Predicion Idea: Look farher ino he fuure when you do TD backup (1, 2, 3,, n seps) R. S. Suon and
More informationLecture Notes 5: Investment
Lecure Noes 5: Invesmen Zhiwei Xu (xuzhiwei@sju.edu.cn) Invesmen decisions made by rms are one of he mos imporan behaviors in he economy. As he invesmen deermines how he capials accumulae along he ime,
More informationMulti-Layer Switching Control
5 American Conrol Conference June 8-1, 5. Porland, OR, USA FrC7.3 Muli-Layer Swiching Conrol Idin Karuei, Nader Meskin, Amir G. Aghdam Deparmen of Elecrical and Compuer Engineering, Concordia Universiy
More informationDistributed event-triggered communication for dynamic averageconsensusinnetworkedsystems
Disribued even-riggered communicaion for dynamic averageconsensusinneworkedsysems SolmazS.Kia a JorgeCorés a SoniaMarínez a a Deparmen of Mechanical and Aerospace Engineering, Universiy of California a
More informationt + t sin t t cos t sin t. t cos t sin t dt t 2 = exp 2 log t log(t cos t sin t) = Multiplying by this factor and then integrating, we conclude that
ODEs, Homework #4 Soluions. Check ha y ( = is a soluion of he second-order ODE ( cos sin y + y sin y sin = 0 and hen use his fac o find all soluions of he ODE. When y =, we have y = and also y = 0, so
More informationPOSITIVE SOLUTIONS OF NEUTRAL DELAY DIFFERENTIAL EQUATION
Novi Sad J. Mah. Vol. 32, No. 2, 2002, 95-108 95 POSITIVE SOLUTIONS OF NEUTRAL DELAY DIFFERENTIAL EQUATION Hajnalka Péics 1, János Karsai 2 Absrac. We consider he scalar nonauonomous neural delay differenial
More informationarxiv: v1 [math.gm] 4 Nov 2018
Unpredicable Soluions of Linear Differenial Equaions Mara Akhme 1,, Mehme Onur Fen 2, Madina Tleubergenova 3,4, Akylbek Zhamanshin 3,4 1 Deparmen of Mahemaics, Middle Eas Technical Universiy, 06800, Ankara,
More information( ) ( ) if t = t. It must satisfy the identity. So, bulkiness of the unit impulse (hyper)function is equal to 1. The defining characteristic is
UNIT IMPULSE RESPONSE, UNIT STEP RESPONSE, STABILITY. Uni impulse funcion (Dirac dela funcion, dela funcion) rigorously defined is no sricly a funcion, bu disribuion (or measure), precise reamen requires
More informationResource Allocation in Visible Light Communication Networks NOMA vs. OFDMA Transmission Techniques
Resource Allocaion in Visible Ligh Communicaion Neworks NOMA vs. OFDMA Transmission Techniques Eirini Eleni Tsiropoulou, Iakovos Gialagkolidis, Panagiois Vamvakas, and Symeon Papavassiliou Insiue of Communicaions
More informationTom Heskes and Onno Zoeter. Presented by Mark Buller
Tom Heskes and Onno Zoeer Presened by Mark Buller Dynamic Bayesian Neworks Direced graphical models of sochasic processes Represen hidden and observed variables wih differen dependencies Generalize Hidden
More informationNotes on Kalman Filtering
Noes on Kalman Filering Brian Borchers and Rick Aser November 7, Inroducion Daa Assimilaion is he problem of merging model predicions wih acual measuremens of a sysem o produce an opimal esimae of he curren
More informationh[n] is the impulse response of the discrete-time system:
Definiion Examples Properies Memory Inveribiliy Causaliy Sabiliy Time Invariance Lineariy Sysems Fundamenals Overview Definiion of a Sysem x() h() y() x[n] h[n] Sysem: a process in which inpu signals are
More informationSTABILITY OF RESET SWITCHING SYSTEMS
STABILITY OF RESET SWITCHING SYSTEMS J.P. Paxman,G.Vinnicombe Cambridge Universiy Engineering Deparmen, UK, jpp7@cam.ac.uk Keywords: Sabiliy, swiching sysems, bumpless ransfer, conroller realizaion. Absrac
More informationDeep Learning: Theory, Techniques & Applications - Recurrent Neural Networks -
Deep Learning: Theory, Techniques & Applicaions - Recurren Neural Neworks - Prof. Maeo Maeucci maeo.maeucci@polimi.i Deparmen of Elecronics, Informaion and Bioengineering Arificial Inelligence and Roboics
More informationCourse Notes for EE227C (Spring 2018): Convex Optimization and Approximation
Course Noes for EE7C Spring 018: Convex Opimizaion and Approximaion Insrucor: Moriz Hard Email: hard+ee7c@berkeley.edu Graduae Insrucor: Max Simchowiz Email: msimchow+ee7c@berkeley.edu Ocober 15, 018 3
More informationOptimal Server Assignment in Multi-Server
Opimal Server Assignmen in Muli-Server 1 Queueing Sysems wih Random Conneciviies Hassan Halabian, Suden Member, IEEE, Ioannis Lambadaris, Member, IEEE, arxiv:1112.1178v2 [mah.oc] 21 Jun 2013 Yannis Viniois,
More informationOn Oscillation of a Generalized Logistic Equation with Several Delays
Journal of Mahemaical Analysis and Applicaions 253, 389 45 (21) doi:1.16/jmaa.2.714, available online a hp://www.idealibrary.com on On Oscillaion of a Generalized Logisic Equaion wih Several Delays Leonid
More informationAn EM algorithm for maximum likelihood estimation given corrupted observations. E. E. Holmes, National Marine Fisheries Service
An M algorihm maimum likelihood esimaion given corruped observaions... Holmes Naional Marine Fisheries Service Inroducion M algorihms e likelihood esimaion o cases wih hidden saes such as when observaions
More informationMachine Learning 4771
ony Jebara, Columbia Universiy achine Learning 4771 Insrucor: ony Jebara ony Jebara, Columbia Universiy opic 20 Hs wih Evidence H Collec H Evaluae H Disribue H Decode H Parameer Learning via JA & E ony
More informationY. Xiang, Learning Bayesian Networks 1
Learning Bayesian Neworks Objecives Acquisiion of BNs Technical conex of BN learning Crierion of sound srucure learning BN srucure learning in 2 seps BN CPT esimaion Reference R.E. Neapolian: Learning
More informationAugmented Reality II - Kalman Filters - Gudrun Klinker May 25, 2004
Augmened Realiy II Kalman Filers Gudrun Klinker May 25, 2004 Ouline Moivaion Discree Kalman Filer Modeled Process Compuing Model Parameers Algorihm Exended Kalman Filer Kalman Filer for Sensor Fusion Lieraure
More informationPresentation Overview
Acion Refinemen in Reinforcemen Learning by Probabiliy Smoohing By Thomas G. Dieerich & Didac Busques Speaer: Kai Xu Presenaion Overview Bacground The Probabiliy Smoohing Mehod Experimenal Sudy of Acion
More informationTHE MATRIX-TREE THEOREM
THE MATRIX-TREE THEOREM 1 The Marix-Tree Theorem. The Marix-Tree Theorem is a formula for he number of spanning rees of a graph in erms of he deerminan of a cerain marix. We begin wih he necessary graph-heoreical
More informationStructural results for partially nested LQG systems over graphs
Srucural resuls for parially nesed LQG sysems over graphs Ashuosh Nayyar 1 Lauren Lessard 2 American Conrol Conference, pp. 5457 5464, 2015 Absrac We idenify a broad class of decenralized oupufeedback
More informationChapter #1 EEE8013 EEE3001. Linear Controller Design and State Space Analysis
Chaper EEE83 EEE3 Chaper # EEE83 EEE3 Linear Conroller Design and Sae Space Analysis Ordinary Differenial Equaions.... Inroducion.... Firs Order ODEs... 3. Second Order ODEs... 7 3. General Maerial...
More informationJournal of Discrete Algorithms. Approximability of partitioning graphs with supply and demand
Journal of Discree Algorihms 6 2008) 627 650 Conens liss available a ScienceDirec Journal of Discree Algorihms www.elsevier.com/locae/jda Approximabiliy of pariioning graphs wih supply dem Takehiro Io
More informationarxiv: v2 [math.oc] 2 Mar 2015
Disribued even-riggered communicaion for dynamic average consensus in neworked sysems Solmaz S. Kia a Jorge Corés b Sonia Marínez b a Deparmen of Mechanical and Aerospace Engineering, Universiy of California
More information