Cyber-Physical Systems Design Using Dissipativity and Symmetry
|
|
|
- Cody Neil Rodgers
- 9 years ago
- Views:
Transcription
1 Cyber-Physical Systems Design Using Dissipativity and Symmetry Panos J. Antsaklis Dept. of Electrical Engineering University of Notre Dame, USA Science Keynote CPS PI Meeting, Washington DC October 3-5,
2 Cyber-Physical Systems (CPS) -As computers become ever-faster and communication bandwidth evercheaper, computing and communication capabilities will be embedded in all types of objects and structures in the physical environment. -Cyber-physical systems (CPS) are physical, biological and engineered systems whose operations are monitored, coordinated, controlled and integrated by a computing and communication core. -his intimate coupling between the cyber and physical will be manifested from the nano-world to large-scale wide-area systems of systems. And at multiple time-scales. -Applications with enormous societal impact and economic benefit will be created. Cyber-physical systems will transform how we interact with the physical world just like the Internet transformed how we interact with one another. -We should care about CPS because our lives depend on them 2
3 3
4 echnological and Economic Drivers he decreasing cost of computation, networking, and sensing. A variety of social and economic forces will require more efficient use of national infrastructures. Environmental pressures will mandate the rapid introduction of technologies to improve energy efficiency and reduce pollution. he need to make more efficient use of health care systems, ranging from facilities to medical data and information. 4
5 What is a CPS? Can we recognize a CPS when we see it? NI interaction with physical world. Digital control in chemical processes half a century old.?? What is different here is the tight integration of the cyber and the physical parts. he specifications play a central role. When demanding, the cyber and physical should coordinate and orchestrate their actions and reactions to achieve desired goals. 5
6 What is a CPS? Can we recognize a CPS when we see it? Example from hybrid systems. rain and gate. o minimize time gate is down, stopping cars from crossing, is obtained when the continuous dynamics of the train and the gate are taken into account. When there is no heat or energy issue or shared resource issues, there is no reason to worry about reducing the clock speed of the digital device when the control algorithm does not need it, do cross layer design, worry about demanding timing issues in implementing the algorithm So the same system may be regarded as a CPS or not. 6
7 7
8 8
9 Connections & Personal Motivation Linear Feedback Systems Polynomial Matrix Descriptions Autonomous Intelligent Control Defining Intelligent Control - Hierarchies - Degrees of Autonomy o DES (PN), Hybrid Systems, Networked Control Systems (MB) o Cyber Physical Systems Quest for Autonomy - Autonomy wrt. Human in the loop. he Power of Feedback Feedback ranscends Models 9
10 PCAS Report. Leadership Under Challenge: Information echnology R&D in a Competitive World An Assessment of the Federal Networking and Information echnology R&D Program President s Council of Advisors on Science and echnology August 2007 New Directions in Networking and Information echnology (NI) Recommendation: No 1 Funding Priority: NI Systems Connected with the Physical World 10
11 CPS Challenges 11
12 CPS Characteristics What cyber physical systems have as defining characteristics: Cyber capability (i.e. networking and computational capability) in every physical component hey are networked at multiple and extreme scales hey are complex at multiple temporal and spatial scales. hey are dynamically reorganizing and reconfiguring Control loops are closed at each spatial and temporal scale. Maybe human in the loop. Operation needs to be dependable and certifiable in certain cases Computation/information processing and physical processes are so tightly integrated that it is not possible to identify whether behavioral attributes are the result of computations (computer programs), physical laws, or both working together. 12
13 CPS Issues here is a set of pervasive underlying problems for CPS not solved by current technologies: How to build predictable real time, networked CPS at all scales? How to build and manage high-confidence, secure, dynamically- configured systems? How to organize and assure interoperability? How to avoid cascading failure? How to formulate an evidential (synthetic and analytic) basis for trusted systems? Certified. 13
14 How could these issues be addressed? Assuming exact knowledge of the components and their interconnections may not be reasonable. Dynamic change. he physical part may cause the CPS to change. Links disappear. Modules stop operating. hese are to be expected when we are interested in the whole life cycle of the system. If the system was safe, verified to be safe, can we guarantee that it will still be? Can we do something about it? Is it resilient? High autonomy. If secure originally can we still guarantee that property? Connections to linear programming, optimization. Simplex and sensitivity analysis. 14
15 How could these issues be addressed? Perhaps it is more reasonable to aim for staying in operating regions. Operating envelope. Flight envelope. he pilot is not allowed to take certain actions that may stall the aircraft (Airbus). Flight envelope. In DES supervisory control actions are allowed or not allowed to occur and so behavior is restricted Lyapunov stability implies that the states are bounded-asymptotic stability implies that the state will also go to the origin as time goes to infinity. Restrictions on behavior. Feedback interconnection of stable systems may not be stable. Switching among stable systems may lead to unstable systems. Is there any similar, energy like concept where guarantees can be given about properties in, say, feedback configurations? 15
16 Approaches to Meet the Challenges 16
17 Passivity and Symmetry in CPS - In CPS, heterogeneity causes major challenges. In addition network uncertainties-time-varying delays, data rate limitations, packet losses. -Need to guarantee properties of networks of heterogeneous systems that dynamically expand and contract. -Need results that offer insight on how to do synthesis how to grow the system to preserve certain properties. - We impose passivity constraints on the components and use wave variables, and the design becomes insensitive to network effects. Stability and performance. - Symmetry. 17
18 hanks to: Han Yu, Mike McCourt, Po Wu, Feng Zhu, Meng Xia Eloy Garcia, Yue Wang, Getachew Befekadu Vijay Gupta, Bill Goodwine NSF CPS Large: Science of Integration for CPS, Vanderbilt, Maryland, Notre Dame, GM R&D 18
19 Background on Passivity 19
20 Definition of Passivity in Continuous-time Consider a continuous-time nonlinear dynamical system x& = f ( x, u) y = h( x, u). his system is passive if there exists a continuous storage function V(x) 0 (for all x) such that t t 2 1 u for all t 2 t 1 and input u(t)ϵu. ( t) y( t) dt + V ( x( t1)) V ( x( t2)) When V(x) is continuously differentiable, it can be written as: u ( t) y( t) V& ( x( t)) 20
21 Passivity in Discrete-time Passivity can also be defined for discretetime systems. Consider a nonlinear discrete time system x( k + 1) = f ( x( k), u( k)) y ( k ) = h ( x ( k ), u ( k )). his system is passive if there exists a continuous storage function V(x) 0 such that k 2 k = k 1 u for all k 1, k 2 and all inputs u(k)ϵu. ( k) y( k) + V ( x( k1)) V ( x( k2)) 21
22 Extended Definitions of Passivity Passive Lossless Strictly Passive Strictly Output Passive Strictly Input Passive u u u y y y y V &(x) y = V &(x) V & ( x) + ψ ( x) V & ( x) + εy y u u V & ( x) + δu u Note that V(x) and Ψ(x) are positive definite and continuously differentiable. he constants ε and δ are positive. hese equations hold for all times, inputs, and states. 22
23 Interconnections of Passive Systems One of the strengths of passivity is when systems are interconnected. Passive systems are stable and passivity is preserved in many practical interconnections. For example, the negative feedback interconnection of two passive systems is passive. If u 1 y 1 and u 2 y 2 are passive then the mapping is passive r = r r 1 2 y = y y 1 2 Note: the other internal mappings (u 1 y 2 and u 2 y 1 ) will be stable but may not be passive 23
24 Stability of Passive Systems Strictly passive systems (ψ(x)>0) are asymptotically stable Output strictly passive systems (δ>0) are L 2 stable he following results hold in feedback wo passive systems passive and stable loop Passive system and a strictly passive system asymptotically stable loop wo output strictly passive systems L 2 stable loop wo input strictly passive systems (ε>0) L 2 stable loop u y V & ( x) + εu u 24
25 Other Interconnections he parallel interconnection of two passive systems is still passive However, this isn t true for the series connection of two systems For example, the series connection of any two systems that have 90 of phase shift have a combined phase shift of
26 Dissipativity, conic systems, and passivity indices 26
27 Definition of Dissipativity (C) his concept generalizes passivity to allow for an arbitrary energy supply rate ω(u,y). A system is dissipative with respect to supply rate ω(u,y) if there exists a continuous storage function V(x) 0 such that t 2 ω ( u, y ) dt V ( x ( t2 )) V ( x ( t1 )) t 1 for all t 1, t 2 and the input u(t)ϵu. A special case of dissipativity is the QSR definition where the energy supply rate takes the following form: ω( u, y) = y Qy + 2y Su + u Ru. QSR dissipative systems are L 2 stable when Q<0 27
28 QSR Dissipativity (C) he feedback interconnection Consider the feedback interconnection of G 1 and G 2 G 1 is QSR dissipative with Q 1, S 1, R 1 G 2 is QSR dissipative with Q 2, S 2, R 2 = = 1 y 1 y r r is stable if Other mappings (r 1 y 2 and r 2 y 1 ) are stable but may not be passive Large scale sytems (with multiple feedback connections) can be analyzed using QSR dissipativity to show stability of the entire system 0 ~ < + + = R Q S S S S R Q Q = = y y y r r r 28
29 Definition of Dissipativity (D) he concept of dissipativity applies to discrete time systems for an arbitrary supply rate ω(u,y). A system is dissipative with respect to supply rate ω(u,y) if there exists a continuous storage function V(x) 0 such that k 2 k = k 1 ω( u, y) V ( x( k2)) V ( x( k1)) for all k 1, k 2 and the input u(k)ϵu. A special case of dissipativity is the QSR definition where the energy supply rate takes the following form: ω( u, y) = y Qy + 2y Su + u Ru. Dissipative D systems are stable when Q<0 29
30 Conic Systems A conic system is one whose input-output behavior is constrained to lie in a cone of the U x Y inner product space A system is conic if the following dissipative inequality holds for all t 2 t 1 t 2 t 1 (1 + a b ) u y au V ( x( t u 2 1 b y )) V ( x( t y dt 1 )) 30
31 Passivity Indices Conic systems and passivity indices capture similar information about a system A passivity index measures the level of passivity in a system wo indices are required to characterize the level of passivity in a system 1. he first measures the level of stability of a system 2. he second measures the extent of the minimum phase property in a system hey are independent in the sense that knowing one provides no information about the other Each has a simple physical interpretation 31
32 Output Feedback Passivity Index he output feedback passivity index (OFP) is the largest gain that can be put in positive feedback with a system such that the interconnected system is passive. Equivalent to the following dissipative inequality holding for G 32
33 Input Feed-Forward Passivity Index he input feed-forward passivity index (IFP) is the largest gain that can be put in a negative parallel interconnection with a system such that the interconnected system is passive. Equivalent to the following dissipative inequality holding for G 33
34 Simultaneous Indices When applying both indices the physical interpretation as in the block diagram Equivalent to the following dissipative inequality holding for G 34
35 Stability We can assess the stability of an interconnection using the indices for G 1 and G 2 G 1 has indices ρ 1 and ν 1 G 2 has indices ρ 2 and ν 2 he interconnection is L 2 stable if the following matrix is positive definite 35
36 Networked passive systems 36
37 Networked Systems Motivating Problem: he feedback interconnection of two passive systems is passive and stable. However, when the two are interconnected over a delayed network the result is not passive so stability is no longer guaranteed. How do we recover stability? he systems G 1 and G 2 are interconnected over a network with time delays 1 and 2 37
38 Stability of Networked Passive Systems One solution to interconnecting passive systems over a delayed network is to add an interface between the systems and the network he wave variable transformation forces the interconnection to meet the small gain theorem. Stability is guaranteed for arbitrarily large time delays he WV is defined below 38
39 Stability of Networked Conic Systems his approach can be generalized to conic systems with a new transformation he rotational transformation (R) can turn any conic system into an L 2 stable system with an appropriate rotation θ his approach decouples the control design from the network design First, G 2 can be designed using traditional conic systems theory he upper R pre-stabilizes G 1 (in the L 2 sense) to tolerate network delays he lower R inverts the rotation to preserve the conic sector of G 1 39
40 Computational methods for showing passivity and dissipativity 40
41 LMI Methods Passivity here are computational methods to find storage functions. For LI passive systems, can always assume there exists a quadratic storage function 1 V ( x) = x Px where 2 A P + PA B P C P PB C D D = P > 0. For continuous-time system this leads to the following LMI 0 In discrete-time the LMI becomes the following A B PA P PA C B A PB C PB D D 0 41
42 LMI Methods QSR Dissipativity he same can be done to demonstrate that an LI system is QSR dissipative. Once again, a quadratic storage function is used 1 V ( x) = x Px where 2 P = P > 0. For continuous-time system this leads to the following LMI A P + PA C QC B P D QC S C D PB C QD S QD C D D S S R 0 In discrete-time the LMI becomes the following A PA P C QC B PA D QC S C B A PB D PB C QD S QD C S D D S R 0 42
43 Passivity and CPS. Some Recent Research. 1. A Passivity Measure Of Systems In Cascade Based On Passivity Indices 2. Passivity-Based Output Synchronization With Application o Output Synchronization of Networked Euler-Lagrange Systems Subject to Nonholonomic Constraints 3. Event-riggered Output Feedback Control for Networked Control Systems using Passivity 4. Output Synchronization of Passive Systems with Event-Driven Communication 5. Quantized Output Synchronization of Networked Passive Systems with Event-driven Communication 43
44 Passivity of systems in series 44
45 A Passivity Measure Of Systems In Cascade Based On Passivity Indices (Yu & Antsaklis, CDC10) Problem Statement he negative feedback interconnection of two passive systems is still passive. Will the cascade interconnection of several passive systems still be passive? H.Yu and Panos J. Antsaklis, A Passivity Measure Of Systems In Cascade Based On he Analysis Of Passivity Indices, Proceedings of IEEE Conference on Decision and Control, Atlanta, Georgia, USA, December 15-17,
46 A Passivity Measure Of Systems In Cascade Based On Passivity Indices (Yu & Antsaklis, CDC10) : main results 46
47 Event-triggered control of passive systems 47
48 Event-riggered Control for Networked Systems using Passivity Event triggered control is used to reduce communication in networked control systems his approach studies event-triggered control from an input-output perspective instead of a state based model he implementation of our event-triggered control strategy does not impose constraints on the maximal admissible network induced delays [Yu and Antsaklis 2011 CDC] 48
49 Event-riggered Network When an event occurs the sampled output y p (t k ) is sent to the networked controller Events occur when a triggering condition is met One such triggering condition is to maintain closed loop stability his can be done by using passivity indices of the plant (ρ p andν p ) and controller (ρ c andν c ) 49
50 riggering Condition Closed loop stability can be maintained using the passivity indices of the plant (ρ p andν p ) and controller (ρ c andν c ) For now, assume the network delay is zero An appropriate triggering condition can be found according to where α, β, and δ are constants between 0 and 1. hen the closed loop system with the network is L 2 stable [Yu & Antsaklis 2011 CDC] 50
51 Delay Over the Network Many control architectures have communication delays on both directions of the network 51
52 Compensating for Delays he proposed design method decouples the design of a controller from the design of the network with delays he network controller h c has been designed for stability he transformation M can be designed to compensate for delays 52
53 Defining an Appropriate ransformation [Yu & Antsaklis 2011 CDC] 53
54 Output synchronization of passive systems using eventdriven communication 54
55 raditional Output Synchronization Output synchronization is the agreement of a group agents on a particular output value Communication is modeled using graph theory the graph can change over time but it is assumed that the communication graph is at least weakly connected Each agent updates its own output value by using the output values of its neighboring agents Previous work has shown that the group of agents will synchronize using this update law when communication is periodic 55
56 Output Synchronization Using Event- Driven Communication Using event-driven communication, the update law holds previous values between update times he error between the actual value and held value can be written Output synchronization can be achieved if each agent transmits its current output y i when the error grows large enough to meet the following triggering condition Weak connectivity is still assumed 56
57 Event-driven Communication with Quantization When there is quantization in the network, the agents cannot synchronize exactly but the error can be bounded he same update law can be used Each agent transmits its current output when the following triggering condition is satisfied It can be shown that the error in the output synchronization algorithm is bounded by the quantization error 57
58 Passivity and Dissipativity in Networked Switched Systems 58
59 Passivity for Switched Systems he notion of passivity has been defined for switched systems x& y = = f h σ σ ( x, u) ( x, u) A switched system is passive if it meets the following conditions 1. Each subsystem i is passive when active: t t 2 1 u ydt Vi ( x( t2)) Vi ( x( t1)) 2. Each subsystem i is dissipative w.r.t. ω ji when inactive: t 2 i ω j ( u, y, x, t) dt V j ( x( t2)) V j ( x( t1)) t 1 3. here exists an input u so that the cross supply rates (ω ji ) are integrable on the infinite time interval. [McCourt & Antsaklis 2010 ACC, 2010 CDC] 59
60 Dissipativity for Switched Systems Definition of Dissipativity in Discrete-time Stability for Dissipative Discrete-time Systems 60
61 QSR Dissipativity for Switched Systems [McCourt &Antsaklis 2012 ACC] 61
62 Stability of Networked Passive Systems When interconnecting passive discretetime switched systems over a network, delays must be considered he transformation approach can be generalized to apply to switched systems he approach can compensate for timevarying delays he wave variable transformation is defined below 62
63 Compensating for quantization in passive systems 63
64 Motivating Problem When analyzing digital controllers or continuous systems that are sampled, discretization and quantization must be considered here are existing results on how to preserve passivity when a continuous system is discretized A passive system H C may not be passive after input-output quantization Can recover passivity when making some simple assumptions on the quantization 64
65 One Solution to Quantization he given scheme recovers passivity for an output strictly passive (OSP) system (H C ) with passive quantizers (Q C and Q P ) using an input/output transformation (M) Can be applied to passive switched systems Switch input/output transformation according the current active system. Stability conditions can be applied [Zhu, Yu, McCourt,&Antsaklis 2012 HSCC] 65
66 Class of Quantization his work applies with a restricted set of quantization specifically quantizers that are restricted to lie in a cone his definition requires very small values to map to zero Includes many practical quantizers 66
67 Preserving Passivity - his result is valid for continuous-time OSP systems. - he negative feedback interconnection of two OSP systems is passive and thus stable. -he same idea can be extended to switched systems 67
68 Extension to Switched Systems - his theorem guarantees that the switched system will be passive even with input and output quantization. -Since the feedback interconnection of two passive switched systems is also passive and thus stable, this result can be used to further interconnect systems. 68
69 Models, Approximations and Passivity In the following passivity results on approximations that involve passivity indices Modeling. Mathematical models and approximations. How do we determine stability, and other properties of physical systems? Models and physical systems. Passivity in software. How do we define it so it is useful and makes sense. 69
70 Passivity and QSR-Dissipativity of a Nonlinear System and its Linearization
71 Passivity and QSR-dissipativity Analysis of a System and its Approximation
72 Problem Statement - Motivation: tradeoff between model accuracy and tractability. - Examples: linearization; feedback linearization; model reduction... - Principle: preserve some fundamental properties or features: passivity, stability, Hamiltonian structure... - System Model: Σ 2 view as the system we are interested in and view Σ 1 as an approximated model y the error is given through (maybe modeling, linearization...)
73 Problem Statement contd Suppose the approximate model is: ISP/OSP/VSP (having an excess of passivity) or QSR dissipative Suppose the error between the two systems is small, i.e. he interested system: Passive? How passive? QSR dissipative?
74 Main Results 1: ISP Input strictly passive: passivity level: passive:
75 Symmetry in Systems Symmetry: A basic feature of shapes and graphs, indicating some degree of repetition or regularity (Approximate) symmetry in characterizations of information structure (Approximately) identical dynamics of subsystems Invariance under group transformation e.g. rotational symmetry Why Symmetry? Decompose into lower dimensional systems with better understanding of system properties such as stability and controllability Construct symmetric large-scale systems without reducing performance if certain properties of low dimensional systems hold 75
76 Simple Examples Star-shaped Symmetry and Hierarchies u = ue Hy % H% H b L b c h 0 = L M M O M c 0 L h u = u Hy by L by 0 e0 0 1 u = u cy hy M 1 e1 0 1 u = u cy hy m em 0 m m 76
77 Cyclic Symmetry and Heterarchies Simple Examples u = ue Hy % H b L b c H% = M h% c h% = circ([ v, v, K, v ]) 1 2 u = u Hy by L by 0 e0 0 1 u = u cy v y v y L v y M 1 e m m u = u cy v y v y L v y m em m m m 77
78 Main Result (1) heorem (Star-shaped Symmetry) Consider a (Q, S, R) dissipative system extended by m star-shaped symmetric (q, s, r) dissipative subsystems. he whole system is finite gain input-out stable if where m σ ( Qˆ ) qˆ < min(, ) 1 σ ( c rc + β ( q ˆ b Rb ) β ) b Rb Qˆ = H RH + SH + H S Q > 0 qˆ = h rh + sh + h s q > 0 β = Sb + c s H Rb c rh H% H b L b c h 0 L = M M O M c 0 L h 78
79 Main Result (2) heorem (Cyclic Symmetry) Consider a (Q, S, R) dissipative system extended by m cyclic symmetric (q, s, r) dissipative subsystems. he whole system is finite gain input-out stable if m σ ( Qˆ ) rσ ( h% ) σ ( h% ) + s( σ ( h% ) + σ ( h% )) q < min(, ) ( ) b Rb where 1 σ c rc + βm Λ βm % ([,, K, ]) h = circ v1 v2 v m σ ( h %) = v = v e m j m 1 jλ j= i j= 1 j 2πij m H% H b L b c = M h% c 79
80 Main Result (3) (cont.) Λ = rh % h % + s( h % + h % ) q I b Rb circ([1,1, K,1]) β = Sb + c s H Rb c rh% β m = [ ββ K β ] m the spectral characterization of should satisfy m h % s 2 s q + mb Rb r 2 r r σ ( h% ) < 80
81 α Simple Examples 2 ( I,0, I) dissipative u = ue Hy % L L H% = L 0 M M M O M L m+ 1 Q = q = I, S = s = 0, R = r = I m < min(3.11, 6.25) = 3.11 Remark: systems corresponding to systems 1 with gain less or equal to (here α = ) α
82 Simple Examples he cyclic symmetric system is stable if he above stability condition is always satisfied. Also u = ue Hy % 1 q = 0, s = 2, r = L L H% = h% = L 0 M M M O M L m 1 2 s 2πij s q m v je 2 r j= 0 r r σ ( h% ) = 0.3 < 0.5 = m < min( +, + ) hus the system can be extended with infinite numbers of subsystems without losing stability. m 82
83 Main Result (4) heorem (Star-shaped Symmetry for Passive Systems) Consider a passive system extended by m star-shaped symmetric passive subsystems. he whole system is finite gain input-output stable if where m σ ( Qˆ ) < σ β ˆ β 1 ( Q ) ˆ H + H Q = > 0 2 H b L b h + h c h 0 qˆ = > 0 H% = L 2 M M O M b + c β = c 0 L h 2 83
84 Main Result (5) heorem (Cyclic Symmetry for Passive Systems) Consider a passive system extended by m cyclic symmetric passive subsystems. he whole system is finite gain input-output stable if where m < σ ( Qˆ ) 1 ( m Λ β m ) σ β ˆ H + H h + h Q = > 0 Λ = % % 2 2 b + c β = βm = [ ββkβ ] 2 m m j m 1 jλ j= i j= 1 j σ ( h %) = v = v e 2πij m H b L b c H% = M h% c % ([,, K, ]) h = circ v1 v2 v m 84
85 Concluding Remarks - CPS, Distributed, Embedded, Networked Systems. Analogdigital, large scale, life cycles, safety critical, end to end highconfidence. - Models, robustness, fragility, resilience, adaptation. - New ways of thinking needed to deal effectively with the CPS problems. New ways to determine research directions. - Passivity/Dissipativity and Symmetry are promising - Circuit theory and port controlled Hamiltonian systems. - Connections to Autonomy and Human in the Loop 85
86 86
A Passivity Measure Of Systems In Cascade Based On Passivity Indices
49th IEEE Conference on Decision and Control December 5-7, Hilton Atlanta Hotel, Atlanta, GA, USA A Passivity Measure Of Systems In Cascade Based On Passivity Indices Han Yu and Panos J Antsaklis Abstract
Lecture 13 Linear quadratic Lyapunov theory
EE363 Winter 28-9 Lecture 13 Linear quadratic Lyapunov theory the Lyapunov equation Lyapunov stability conditions the Lyapunov operator and integral evaluating quadratic integrals analysis of ARE discrete-time
Reliability Guarantees in Automata Based Scheduling for Embedded Control Software
1 Reliability Guarantees in Automata Based Scheduling for Embedded Control Software Santhosh Prabhu, Aritra Hazra, Pallab Dasgupta Department of CSE, IIT Kharagpur West Bengal, India - 721302. Email: {santhosh.prabhu,
Real-Time Systems Versus Cyber-Physical Systems: Where is the Difference?
Real-Time Systems Versus Cyber-Physical Systems: Where is the Difference? Samarjit Chakraborty www.rcs.ei.tum.de TU Munich, Germany Joint work with Dip Goswami*, Reinhard Schneider #, Alejandro Masrur
STABILITY GUARANTEED ACTIVE FAULT TOLERANT CONTROL OF NETWORKED CONTROL SYSTEMS. Shanbin Li, Dominique Sauter, Christophe Aubrun, Joseph Yamé
SABILIY GUARANEED ACIVE FAUL OLERAN CONROL OF NEWORKED CONROL SYSEMS Shanbin Li, Dominique Sauter, Christophe Aubrun, Joseph Yamé Centre de Recherche en Automatique de Nancy Université Henri Poincaré,
Numerical methods for American options
Lecture 9 Numerical methods for American options Lecture Notes by Andrzej Palczewski Computational Finance p. 1 American options The holder of an American option has the right to exercise it at any moment
(Refer Slide Time: 01:11-01:27)
Digital Signal Processing Prof. S. C. Dutta Roy Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture - 6 Digital systems (contd.); inverse systems, stability, FIR and IIR,
Mapping an Application to a Control Architecture: Specification of the Problem
Mapping an Application to a Control Architecture: Specification of the Problem Mieczyslaw M. Kokar 1, Kevin M. Passino 2, Kenneth Baclawski 1, and Jeffrey E. Smith 3 1 Northeastern University, Boston,
Nonlinear Systems and Control Lecture # 15 Positive Real Transfer Functions & Connection with Lyapunov Stability. p. 1/?
Nonlinear Systems and Control Lecture # 15 Positive Real Transfer Functions & Connection with Lyapunov Stability p. 1/? p. 2/? Definition: A p p proper rational transfer function matrix G(s) is positive
Using the Theory of Reals in. Analyzing Continuous and Hybrid Systems
Using the Theory of Reals in Analyzing Continuous and Hybrid Systems Ashish Tiwari Computer Science Laboratory (CSL) SRI International (SRI) Menlo Park, CA 94025 Email: [email protected] Ashish Tiwari
G(s) = Y (s)/u(s) In this representation, the output is always the Transfer function times the input. Y (s) = G(s)U(s).
Transfer Functions The transfer function of a linear system is the ratio of the Laplace Transform of the output to the Laplace Transform of the input, i.e., Y (s)/u(s). Denoting this ratio by G(s), i.e.,
Lecture 7: Finding Lyapunov Functions 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.243j (Fall 2003): DYNAMICS OF NONLINEAR SYSTEMS by A. Megretski Lecture 7: Finding Lyapunov Functions 1
Controller Design in Frequency Domain
ECSE 4440 Control System Engineering Fall 2001 Project 3 Controller Design in Frequency Domain TA 1. Abstract 2. Introduction 3. Controller design in Frequency domain 4. Experiment 5. Colclusion 1. Abstract
degrees of freedom and are able to adapt to the task they are supposed to do [Gupta].
1.3 Neural Networks 19 Neural Networks are large structured systems of equations. These systems have many degrees of freedom and are able to adapt to the task they are supposed to do [Gupta]. Two very
t := maxγ ν subject to ν {0,1,2,...} and f(x c +γ ν d) f(x c )+cγ ν f (x c ;d).
1. Line Search Methods Let f : R n R be given and suppose that x c is our current best estimate of a solution to P min x R nf(x). A standard method for improving the estimate x c is to choose a direction
Supplement to Call Centers with Delay Information: Models and Insights
Supplement to Call Centers with Delay Information: Models and Insights Oualid Jouini 1 Zeynep Akşin 2 Yves Dallery 1 1 Laboratoire Genie Industriel, Ecole Centrale Paris, Grande Voie des Vignes, 92290
Example 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum. asin. k, a, and b. We study stability of the origin x
Lecture 4. LaSalle s Invariance Principle We begin with a motivating eample. Eample 4.1 (nonlinear pendulum dynamics with friction) Figure 4.1: Pendulum Dynamics of a pendulum with friction can be written
Introduction to Machine Learning and Data Mining. Prof. Dr. Igor Trajkovski [email protected]
Introduction to Machine Learning and Data Mining Prof. Dr. Igor Trakovski [email protected] Neural Networks 2 Neural Networks Analogy to biological neural systems, the most robust learning systems
Nonlinear Optimization: Algorithms 3: Interior-point methods
Nonlinear Optimization: Algorithms 3: Interior-point methods INSEAD, Spring 2006 Jean-Philippe Vert Ecole des Mines de Paris [email protected] Nonlinear optimization c 2006 Jean-Philippe Vert,
Discrete Optimization
Discrete Optimization [Chen, Batson, Dang: Applied integer Programming] Chapter 3 and 4.1-4.3 by Johan Högdahl and Victoria Svedberg Seminar 2, 2015-03-31 Todays presentation Chapter 3 Transforms using
LOOP TRANSFER RECOVERY FOR SAMPLED-DATA SYSTEMS 1
LOOP TRANSFER RECOVERY FOR SAMPLED-DATA SYSTEMS 1 Henrik Niemann Jakob Stoustrup Mike Lind Rank Bahram Shafai Dept. of Automation, Technical University of Denmark, Building 326, DK-2800 Lyngby, Denmark
Modeling and Verification of Sampled-Data Hybrid Systems
Modeling and Verification of Sampled-Data Hybrid Systems Abstract B. Izaias Silva and Bruce H. Krogh Dept. of Electrical and Computer Engineering, Carnegie Mellon University (Izaias /krogh)@cmu.edu We
Functional Optimization Models for Active Queue Management
Functional Optimization Models for Active Queue Management Yixin Chen Department of Computer Science and Engineering Washington University in St Louis 1 Brookings Drive St Louis, MO 63130, USA [email protected]
CONTROL SYSTEMS, ROBOTICS AND AUTOMATION Vol. XVI - Fault Accomodation Using Model Predictive Methods - Jovan D. Bošković and Raman K.
FAULT ACCOMMODATION USING MODEL PREDICTIVE METHODS Scientific Systems Company, Inc., Woburn, Massachusetts, USA. Keywords: Fault accommodation, Model Predictive Control (MPC), Failure Detection, Identification
Power Amplifier Linearization Techniques: An Overview
Power Amplifier Linearization Techniques: An Overview Workshop on RF Circuits for 2.5G and 3G Wireless Systems February 4, 2001 Joel L. Dawson Ph.D. Candidate, Stanford University List of Topics Motivation
Understanding Poles and Zeros
MASSACHUSETTS INSTITUTE OF TECHNOLOGY DEPARTMENT OF MECHANICAL ENGINEERING 2.14 Analysis and Design of Feedback Control Systems Understanding Poles and Zeros 1 System Poles and Zeros The transfer function
The aerodynamic center
The aerodynamic center In this chapter, we re going to focus on the aerodynamic center, and its effect on the moment coefficient C m. 1 Force and moment coefficients 1.1 Aerodynamic forces Let s investigate
Introduction to Engineering System Dynamics
CHAPTER 0 Introduction to Engineering System Dynamics 0.1 INTRODUCTION The objective of an engineering analysis of a dynamic system is prediction of its behaviour or performance. Real dynamic systems are
The Heat Equation. Lectures INF2320 p. 1/88
The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)
24. The Branch and Bound Method
24. The Branch and Bound Method It has serious practical consequences if it is known that a combinatorial problem is NP-complete. Then one can conclude according to the present state of science that no
Passive control. Carles Batlle. II EURON/GEOPLEX Summer School on Modeling and Control of Complex Dynamical Systems Bertinoro, Italy, July 18-22 2005
Passive control theory I Carles Batlle II EURON/GEOPLEX Summer School on Modeling and Control of Complex Dynamical Systems Bertinoro, Italy, July 18-22 25 Contents of this lecture Change of paradigm in
Largest Fixed-Aspect, Axis-Aligned Rectangle
Largest Fixed-Aspect, Axis-Aligned Rectangle David Eberly Geometric Tools, LLC http://www.geometrictools.com/ Copyright c 1998-2016. All Rights Reserved. Created: February 21, 2004 Last Modified: February
α α λ α = = λ λ α ψ = = α α α λ λ ψ α = + β = > θ θ β > β β θ θ θ β θ β γ θ β = γ θ > β > γ θ β γ = θ β = θ β = θ β = β θ = β β θ = = = β β θ = + α α α α α = = λ λ λ λ λ λ λ = λ λ α α α α λ ψ + α =
Parabolic Equations. Chapter 5. Contents. 5.1.2 Well-Posed Initial-Boundary Value Problem. 5.1.3 Time Irreversibility of the Heat Equation
7 5.1 Definitions Properties Chapter 5 Parabolic Equations Note that we require the solution u(, t bounded in R n for all t. In particular we assume that the boundedness of the smooth function u at infinity
Discrete mechanics, optimal control and formation flying spacecraft
Discrete mechanics, optimal control and formation flying spacecraft Oliver Junge Center for Mathematics Munich University of Technology joint work with Jerrold E. Marsden and Sina Ober-Blöbaum partially
4 Lyapunov Stability Theory
4 Lyapunov Stability Theory In this section we review the tools of Lyapunov stability theory. These tools will be used in the next section to analyze the stability properties of a robot controller. We
Towards a Unifying Security Framework for Cyber- Physical Systems
Towards a Unifying Security Framework for Cyber- Physical Systems Quanyan Zhu and Tamer Başar Coordinated Science Laboratory Department of Electrical and Computer Engineering University of Illinois at
Fuzzy Differential Systems and the New Concept of Stability
Nonlinear Dynamics and Systems Theory, 1(2) (2001) 111 119 Fuzzy Differential Systems and the New Concept of Stability V. Lakshmikantham 1 and S. Leela 2 1 Department of Mathematical Sciences, Florida
The Steepest Descent Algorithm for Unconstrained Optimization and a Bisection Line-search Method
The Steepest Descent Algorithm for Unconstrained Optimization and a Bisection Line-search Method Robert M. Freund February, 004 004 Massachusetts Institute of Technology. 1 1 The Algorithm The problem
Hybrid reformulation based on a new hybrid Ohm s law for an electrical energy hybrid systems
Hybrid reformulation based on a new hybrid Ohm s law for an electrical energy hybrid systems SANG C. LEE* Division of IoT-Robot convergence research DGIST 333, Techno jungang, Dalseong-Gun, Daegu Republic
Quantum Mechanics and Representation Theory
Quantum Mechanics and Representation Theory Peter Woit Columbia University Texas Tech, November 21 2013 Peter Woit (Columbia University) Quantum Mechanics and Representation Theory November 2013 1 / 30
State of Stress at Point
State of Stress at Point Einstein Notation The basic idea of Einstein notation is that a covector and a vector can form a scalar: This is typically written as an explicit sum: According to this convention,
2. Information Economics
2. Information Economics In General Equilibrium Theory all agents had full information regarding any variable of interest (prices, commodities, state of nature, cost function, preferences, etc.) In many
Mathematical Modeling and Dynamic Simulation of a Class of Drive Systems with Permanent Magnet Synchronous Motors
Applied and Computational Mechanics 3 (2009) 331 338 Mathematical Modeling and Dynamic Simulation of a Class of Drive Systems with Permanent Magnet Synchronous Motors M. Mikhov a, a Faculty of Automatics,
Stochastic Inventory Control
Chapter 3 Stochastic Inventory Control 1 In this chapter, we consider in much greater details certain dynamic inventory control problems of the type already encountered in section 1.3. In addition to the
Load Balancing and Switch Scheduling
EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: [email protected] Abstract Load
1 Introduction. Linear Programming. Questions. A general optimization problem is of the form: choose x to. max f(x) subject to x S. where.
Introduction Linear Programming Neil Laws TT 00 A general optimization problem is of the form: choose x to maximise f(x) subject to x S where x = (x,..., x n ) T, f : R n R is the objective function, S
Probabilistic Models for Big Data. Alex Davies and Roger Frigola University of Cambridge 13th February 2014
Probabilistic Models for Big Data Alex Davies and Roger Frigola University of Cambridge 13th February 2014 The State of Big Data Why probabilistic models for Big Data? 1. If you don t have to worry about
Loop Analysis. Chapter 7. 7.1 Introduction
Chapter 7 Loop Analysis Quotation Authors, citation. This chapter describes how stability and robustness can be determined by investigating how sinusoidal signals propagate around the feedback loop. The
Linköping University Electronic Press
Linköping University Electronic Press Report Well-posed boundary conditions for the shallow water equations Sarmad Ghader and Jan Nordström Series: LiTH-MAT-R, 0348-960, No. 4 Available at: Linköping University
ECE 3510 Final given: Spring 11
ECE 50 Final given: Spring This part of the exam is Closed book, Closed notes, No Calculator.. ( pts) For each of the time-domain signals shown, draw the poles of the signal's Laplace transform on the
How will the programme be delivered (e.g. inter-institutional, summerschools, lectures, placement, rotations, on-line etc.):
Titles of Programme: Hamilton Hamilton Institute Institute Structured PhD Structured PhD Minimum 30 credits. 15 of Programme which must be obtained from Generic/Transferable skills modules and 15 from
Persuasion by Cheap Talk - Online Appendix
Persuasion by Cheap Talk - Online Appendix By ARCHISHMAN CHAKRABORTY AND RICK HARBAUGH Online appendix to Persuasion by Cheap Talk, American Economic Review Our results in the main text concern the case
TCP, Active Queue Management and QoS
TCP, Active Queue Management and QoS Don Towsley UMass Amherst [email protected] Collaborators: W. Gong, C. Hollot, V. Misra Outline motivation TCP friendliness/fairness bottleneck invariant principle
6.2 Permutations continued
6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem
Lecture 3: Growth with Overlapping Generations (Acemoglu 2009, Chapter 9, adapted from Zilibotti)
Lecture 3: Growth with Overlapping Generations (Acemoglu 2009, Chapter 9, adapted from Zilibotti) Kjetil Storesletten September 10, 2013 Kjetil Storesletten () Lecture 3 September 10, 2013 1 / 44 Growth
Scheduling Real-time Tasks: Algorithms and Complexity
Scheduling Real-time Tasks: Algorithms and Complexity Sanjoy Baruah The University of North Carolina at Chapel Hill Email: [email protected] Joël Goossens Université Libre de Bruxelles Email: [email protected]
An Extension Model of Financially-balanced Bonus-Malus System
An Extension Model of Financially-balanced Bonus-Malus System Other : Ratemaking, Experience Rating XIAO, Yugu Center for Applied Statistics, Renmin University of China, Beijing, 00872, P.R. China Phone:
Power Electronics. Prof. K. Gopakumar. Centre for Electronics Design and Technology. Indian Institute of Science, Bangalore.
Power Electronics Prof. K. Gopakumar Centre for Electronics Design and Technology Indian Institute of Science, Bangalore Lecture - 1 Electric Drive Today, we will start with the topic on industrial drive
Coding and decoding with convolutional codes. The Viterbi Algor
Coding and decoding with convolutional codes. The Viterbi Algorithm. 8 Block codes: main ideas Principles st point of view: infinite length block code nd point of view: convolutions Some examples Repetition
Stability. Chapter 4. Topics : 1. Basic Concepts. 2. Algebraic Criteria for Linear Systems. 3. Lyapunov Theory with Applications to Linear Systems
Chapter 4 Stability Topics : 1. Basic Concepts 2. Algebraic Criteria for Linear Systems 3. Lyapunov Theory with Applications to Linear Systems 4. Stability and Control Copyright c Claudiu C. Remsing, 2006.
Pricing and calibration in local volatility models via fast quantization
Pricing and calibration in local volatility models via fast quantization Parma, 29 th January 2015. Joint work with Giorgia Callegaro and Martino Grasselli Quantization: a brief history Birth: back to
Two-Dimensional Conduction: Shape Factors and Dimensionless Conduction Heat Rates
Two-Dimensional Conduction: Shape Factors and Dimensionless Conduction Heat Rates Chapter 4 Sections 4.1 and 4.3 make use of commercial FEA program to look at this. D Conduction- General Considerations
Introduction to Support Vector Machines. Colin Campbell, Bristol University
Introduction to Support Vector Machines Colin Campbell, Bristol University 1 Outline of talk. Part 1. An Introduction to SVMs 1.1. SVMs for binary classification. 1.2. Soft margins and multi-class classification.
3 Signals and Systems: Part II
3 Signals and Systems: Part II Recommended Problems P3.1 Sketch each of the following signals. (a) x[n] = b[n] + 3[n - 3] (b) x[n] = u[n] - u[n - 5] (c) x[n] = 6[n] + 1n + (i)2 [n - 2] + (i)ag[n - 3] (d)
Mathematical Modelling of Computer Networks: Part II. Module 1: Network Coding
Mathematical Modelling of Computer Networks: Part II Module 1: Network Coding Lecture 3: Network coding and TCP 12th November 2013 Laila Daniel and Krishnan Narayanan Dept. of Computer Science, University
Section 5.0 : Horn Physics. By Martin J. King, 6/29/08 Copyright 2008 by Martin J. King. All Rights Reserved.
Section 5. : Horn Physics Section 5. : Horn Physics By Martin J. King, 6/29/8 Copyright 28 by Martin J. King. All Rights Reserved. Before discussing the design of a horn loaded loudspeaker system, it is
1 Solving LPs: The Simplex Algorithm of George Dantzig
Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.
Spatial Decomposition/Coordination Methods for Stochastic Optimal Control Problems. Practical aspects and theoretical questions
Spatial Decomposition/Coordination Methods for Stochastic Optimal Control Problems Practical aspects and theoretical questions P. Carpentier, J-Ph. Chancelier, M. De Lara, V. Leclère École des Ponts ParisTech
Scicos is a Scilab toolbox included in the Scilab package. The Scicos editor can be opened by the scicos command
7 Getting Started 7.1 Construction of a Simple Diagram Scicos contains a graphical editor that can be used to construct block diagram models of dynamical systems. The blocks can come from various palettes
Frequency Response of Filters
School of Engineering Department of Electrical and Computer Engineering 332:224 Principles of Electrical Engineering II Laboratory Experiment 2 Frequency Response of Filters 1 Introduction Objectives To
ECON20310 LECTURE SYNOPSIS REAL BUSINESS CYCLE
ECON20310 LECTURE SYNOPSIS REAL BUSINESS CYCLE YUAN TIAN This synopsis is designed merely for keep a record of the materials covered in lectures. Please refer to your own lecture notes for all proofs.
Positive Feedback and Oscillators
Physics 3330 Experiment #6 Fall 1999 Positive Feedback and Oscillators Purpose In this experiment we will study how spontaneous oscillations may be caused by positive feedback. You will construct an active
Separation Properties for Locally Convex Cones
Journal of Convex Analysis Volume 9 (2002), No. 1, 301 307 Separation Properties for Locally Convex Cones Walter Roth Department of Mathematics, Universiti Brunei Darussalam, Gadong BE1410, Brunei Darussalam
Broadband Networks. Prof. Dr. Abhay Karandikar. Electrical Engineering Department. Indian Institute of Technology, Bombay. Lecture - 29.
Broadband Networks Prof. Dr. Abhay Karandikar Electrical Engineering Department Indian Institute of Technology, Bombay Lecture - 29 Voice over IP So, today we will discuss about voice over IP and internet
Moving Least Squares Approximation
Chapter 7 Moving Least Squares Approimation An alternative to radial basis function interpolation and approimation is the so-called moving least squares method. As we will see below, in this method the
11. APPROXIMATION ALGORITHMS
11. APPROXIMATION ALGORITHMS load balancing center selection pricing method: vertex cover LP rounding: vertex cover generalized load balancing knapsack problem Lecture slides by Kevin Wayne Copyright 2005
Chapter 11. 11.1 Load Balancing. Approximation Algorithms. Load Balancing. Load Balancing on 2 Machines. Load Balancing: Greedy Scheduling
Approximation Algorithms Chapter Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should I do? A. Theory says you're unlikely to find a poly-time algorithm. Must sacrifice one
Introduction to the Finite Element Method
Introduction to the Finite Element Method 09.06.2009 Outline Motivation Partial Differential Equations (PDEs) Finite Difference Method (FDM) Finite Element Method (FEM) References Motivation Figure: cross
Digital to Analog Converter. Raghu Tumati
Digital to Analog Converter Raghu Tumati May 11, 2006 Contents 1) Introduction............................... 3 2) DAC types................................... 4 3) DAC Presented.............................
Statistical Machine Learning
Statistical Machine Learning UoC Stats 37700, Winter quarter Lecture 4: classical linear and quadratic discriminants. 1 / 25 Linear separation For two classes in R d : simple idea: separate the classes
Computation of crystal growth. using sharp interface methods
Efficient computation of crystal growth using sharp interface methods University of Regensburg joint with John Barrett (London) Robert Nürnberg (London) July 2010 Outline 1 Curvature driven interface motion
Bindel, Spring 2012 Intro to Scientific Computing (CS 3220) Week 3: Wednesday, Feb 8
Spaces and bases Week 3: Wednesday, Feb 8 I have two favorite vector spaces 1 : R n and the space P d of polynomials of degree at most d. For R n, we have a canonical basis: R n = span{e 1, e 2,..., e
Transient analysis of integrated solar/diesel hybrid power system using MATLAB Simulink
Transient analysis of integrated solar/diesel hybrid power system using ATLAB Simulink Takyin Taky Chan School of Electrical Engineering Victoria University PO Box 14428 C, elbourne 81, Australia. [email protected]
Computer Networks and Internets, 5e Chapter 6 Information Sources and Signals. Introduction
Computer Networks and Internets, 5e Chapter 6 Information Sources and Signals Modified from the lecture slides of Lami Kaya ([email protected]) for use CECS 474, Fall 2008. 2009 Pearson Education Inc., Upper
Electronics for Analog Signal Processing - II Prof. K. Radhakrishna Rao Department of Electrical Engineering Indian Institute of Technology Madras
Electronics for Analog Signal Processing - II Prof. K. Radhakrishna Rao Department of Electrical Engineering Indian Institute of Technology Madras Lecture - 18 Wideband (Video) Amplifiers In the last class,
