Supervisory Control of Hybrid Systems Written by X. D. Koutsoukos et al. Presented by Wu, Jian 04/16/2002.

Slides:



Advertisements
Similar presentations
Completeness and Expressiveness
Advertisements

Lect.3 Modeling in The Time Domain Basil Hamed
C O N T E X T - F R E E LANGUAGES ( use a grammar to describe a language) 1.
Hybrid Systems Presented by: Arnab De Anand S. An Intuitive Introduction to Hybrid Systems Discrete program with an analog environment. What does it mean?
CS 367: Model-Based Reasoning Lecture 2 (01/15/2002)
Digital Control Systems INTRODUCTION. Introduction What is a control system? Objective: To make the system OUTPUT and the desired REFERENCE as close as.
LR-Grammars LR(0), LR(1), and LR(K).
President UniversityErwin SitompulSMI 7/1 Dr.-Ing. Erwin Sitompul President University Lecture 7 System Modeling and Identification
ECE 877-J Discrete Event Systems 224 McKinley Hall.
Planning under Uncertainty
OASIS Reference Model for Service Oriented Architecture 1.0
Overview This project applies the tagged-signal model to explain the semantics of piecewise continuous signals. Then it illustrates an operational way.
1 Introduction to Computability Theory Lecture12: Decidable Languages Prof. Amos Israeli.
1 Introduction to Computability Theory Lecture3: Regular Expressions Prof. Amos Israeli.
Description of Systems M. J. Roberts - All Rights Reserved. Edited by Dr. Robert Akl 1.
LEARNING FROM OBSERVATIONS Yılmaz KILIÇASLAN. Definition Learning takes place as the agent observes its interactions with the world and its own decision-making.
Regular Languages Sequential Machine Theory Prof. K. J. Hintz Department of Electrical and Computer Engineering Lecture 3 Comments, additions and modifications.
1 The scanning process Goal: automate the process Idea: –Start with an RE –Build a DFA How? –We can build a non-deterministic finite automaton (Thompson's.
LEARNING FROM OBSERVATIONS Yılmaz KILIÇASLAN. Definition Learning takes place as the agent observes its interactions with the world and its own decision-making.
Ch 7.1: Introduction to Systems of First Order Linear Equations
The Fundamentals: Algorithms, the Integers & Matrices.
Quantum One: Lecture 8. Continuously Indexed Basis Sets.
COMPLEXITY SCIENCE WORKSHOP 18, 19 June 2015 Systems & Control Research Centre School of Mathematics, Computer Science and Engineering CITY UNIVERSITY.
Timed UML State Machines Ognyana Hristova Tutor: Priv.-Doz. Dr. Thomas Noll June, 2007.
Comparison of methods for supervisory control and submodule construction 1 Gregor v. Bochmann, University of Ottawa Comparison of methods for supervisory.
MAKING COMPLEX DEClSlONS
ECE 720T5 Winter 2014 Cyber-Physical Systems Rodolfo Pellizzoni.
Module 2 SPECTRAL ANALYSIS OF COMMUNICATION SIGNAL.
Benjamin Gamble. What is Time?  Can mean many different things to a computer Dynamic Equation Variable System State 2.
Compiler Construction Lexical Analysis. The word lexical means textual or verbal or literal. The lexical analysis implemented in the “SCANNER” module.
1 2. Independence and Bernoulli Trials Independence: Events A and B are independent if It is easy to show that A, B independent implies are all independent.
Lexical Analysis Hira Waseem Lecture
Dina Workshop Analysing Properties of Hybrid Systems Rafael Wisniewski Aalborg University.
Learning Automata and Grammars Peter Černo.  The problem of learning or inferring automata and grammars has been studied for decades and has connections.
MESA Lab Two Interesting Papers Introduction at ICFDA 2014 Xiaobao Jia MESA (Mechatronics, Embedded Systems and Automation) Lab School of Engineering,
Black Box Testing Techniques Chapter 7. Black Box Testing Techniques Prepared by: Kris C. Calpotura, CoE, MSME, MIT  Introduction Introduction  Equivalence.
CS 367: Model-Based Reasoning Lecture 5 (01/29/2002) Gautam Biswas.
1 Lecture 1: February 20, 2007 Topic: 1. Discrete-Time Signals and Systems.
Collaboration Entities on Deterministic Finite Automata Minjun Wang Department of Electrical Engineering and Computer Science Syracuse University, U.S.A.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
OR Chapter 8. General LP Problems Converting other forms to general LP problem : min c’x  - max (-c)’x   = by adding a nonnegative slack variable.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
Digital Control CSE 421.
Introduction to discrete event systems
Software Quality and Safety Pascal Mbayiha.  software engineering  large, complex systems  functionality, changing requirements  development difficult.
NP-Completeness  For convenience, the theory of NP - Completeness is designed for decision problems (i.e. whose solution is either yes or no).  Abstractly,
Topics 1 Specific topics to be covered are: Discrete-time signals Z-transforms Sampling and reconstruction Aliasing and anti-aliasing filters Sampled-data.
Signals and Systems Lecture #6 EE3010_Lecture6Al-Dhaifallah_Term3321.
Overview of Previous Lesson(s) Over View  A token is a pair consisting of a token name and an optional attribute value.  A pattern is a description.
In The Name of Allah The Most Beneficent The Most Merciful 1.
Chapter 2. Signals and Linear Systems
Instructor: Chen-Hsiung Yang Dynamic System Modeling Analysis and Control 動態系統建模分析與控制 Lecture1 Introduction to System Dynamics.
1 College of Communication Engineering Undergraduate Course: Signals and Linear Systems Lecturer: Kunbao CAI.
Time Domain Representations of Linear Time-Invariant Systems
Modeling Arithmetic, Computation, and Languages Mathematical Structures for Computer Science Chapter 8 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesTuring.
Automatic Test Generation
Chapter 4 Dynamical Behavior of Processes Homework 6 Construct an s-Function model of the interacting tank-in-series system and compare its simulation.
Applied Discrete Mathematics Week 2: Functions and Sequences
Chapter 4 Dynamical Behavior of Processes Homework 6 Construct an s-Function model of the interacting tank-in-series system and compare its simulation.
Finite State Machines Dr K R Bond 2009
Sequential Flexibility
Copyright © Cengage Learning. All rights reserved.
Modeling Arithmetic, Computation, and Languages
Digital Control Systems
Description and Analysis of Systems
Chapter 2 FINITE AUTOMATA.
High-Level Abstraction of Concurrent Finite Automata
CSEP590 – Model Checking and Automated Verification
Digital Control Systems Waseem Gulsher
§1—2 State-Variable Description The concept of state
Presentation transcript:

Supervisory Control of Hybrid Systems Written by X. D. Koutsoukos et al. Presented by Wu, Jian 04/16/2002

Outline Introduction Hybrid system modeling Supervisory control design Summary

Introduction Hybrid dynamical systems are characterized by interacting continuous and discrete dynamics. Hybrid control systems typically arise from computer-aided control of continuous processes. Its study is essential in designing the supervisory controller.

Introduction

The ‘plant’ is composed of the continuous process to be controlled and any continuous controllers. The ‘controller’ includes a discrete decision process that is typically a discrete-event system described by a finite automaton. The ‘interface’ makes it possible for these different processes to communicate with each other.

Introduction This supervisory control framework is quite flexible and can describe from the modern engineering systems to a switching control system. One of the main characteristics of the supervisory control has been the emphasis and explicit identification of the interface between the continuous and discrete dynamics.

Hybrid system modeling Continuous plant: The plant is in general a nonlinear, time-invariant system represented by a set of ordinary differential equations:

Hybrid system modeling This representation of the plant is quite general, e.g. a linear switching system consisting of m subsystems can be described by

Hybrid system modeling Controller: the controller (supervisor) is a discrete event system that is modeled as a deterministic finite automaton. This automaton is specified by

Hybrid system modeling The action of the controller is described by the equations where. The index n is analogous to a time index in that it specifies the order of the symbols in the sequence. The input and output signals associated with the controller are sequences of symbols.

Hybrid system modeling Interface –The controller and plant cannot communicate directly in a hybrid control system because each utilizes different type of signals. Thus, an interface is required that can convert continuous time signals to the sequences of the symbols and vice versa. –To a great extent, the way that this conversion is accomplished determines the nature of the overall hybrid control system. –The interface consists of the two simple subsystems: the generator and the actuator.

Hybrid system modeling –The generator is the subsystem of the interface that converts the continuous-time output (state) of the plant to an symbolic input for the controller. To perform this task, two processes must be in place: A triggering mechanism is required, which will determine when a plant symbol should be generated. In the generator, the triggering mechanism is based on the idea of the plant events. Let the sequence of plant events be denoted by e, where e[n]=i means the nth plant event was triggered by crossing the hypersurface defined by h i. Let the sequence of plant event instants be given by, where is the time of the nth plant event and.

Hybrid system modeling A simple way of expressing the conditions for the generation of plant events is by Note: When the crossing occurs exactly at a point where, one must use the following conditions:

Hybrid system modeling and The first group contains three conditions: 1) at the time of the plant event the plant state lies on the triggering hypersurface; 2) immediately after the event the plant state lies on the negative (positive) side of the triggering hypersurface; and 3) prior to reaching the triggering hypersurface, the plant lies on the positive (negative) side. The fourth condition concerns the ordering of the sequences. It requires that plant events be ordered chronologically and simultaneous plant events be ordered to their number.

Hybrid system modeling

A process to determine which particular plant symbol should be generated is required. At each time in the sequence, a plant symbol is generated according to the function. The sequence of plant symbols can defined as where i identifies the hypersurface that was crossed.

Hybrid system modeling –The actuator converts the sequence of controller symbols to a plant input signal, using the function as follows: where is a characteristic function taking on the value of unity over the time interval and zero elsewhere is the time of the nth control symbol.

Hybrid system modeling Example -- Thermostat/Furnace System: The plant can be modeled as The thermostat partitions the state space of the plant with two hypersurfaces as follows:

Hybrid system modeling The associated functions are very simple in this case:. So there are two plant symbols: and. The output function of the controller is defined as And the actuator operates as

Hybrid system modeling

Supervisory control design The objective is to develop methodologies that, given the system description and performance specifications, extract discrete-event controllers that supervises the plant to guarantee these specifications are satisfied. In the other words, in the supervisory control paradigm, the objective of the controller is to restrict the behavior of a given uncontrolled DES in order to satisfy prescribed specifications on the languages generated by the system.

Supervisory control design Given the DES plant and desired language K, the objective in the supervisory control problem for hybrid systems is to build a supervisor S such that L(S, G) K. In addition, it is required that the supervisor is maximally permissive, meaning that the language L(S,G) is as large as possible.

Supervisory control design Controllability: when the above condition is true, the desired language K is said to be controllable, and provided that K is prefix- closed, a controller can be designed that will restrict the system to the language K.

Supervisory control design If the desired language K is not attainable for a given DES, it may be possible to find a more restricted language. Since we want the least restricted behavior, it is desirable the find the supremal element of the family of controllable sublanguages of K. The supremal controllable language is the largest subset of K that can be attained by a controller and can be found via following iterative procedure:

Supervisory control design The basis of the algorithm is a fixed point iteration of a certain operator on languages. The largest fixed point of the iteration is computed by iterative applications of the operator. Furthermore, the is a regular language, and therefore, it can be realized by a supervisor described by a finite automaton.

Supervisory control design Example – more complex DES plant model

Supervisory control design The language generated by this DES is, where The control task for this DES is that let it never enter state. By simply removing the transitions to and then compute the resulting language, this desired language is therefore

Supervisory control design In this example, the language K is not controllable. This can be seen by considering the string for which may generate and enter state. By using the iterative scheme, the supremal controllable sublanguage of K can be found,

Supervisory control design

Summary The general scheme of the hybrid control system is presented. Three main components ‘plant’, ‘controller’ and ‘interface’ are introduced. The supervisory control problem for hybrid system is formulated and algorithms for supervisory control design based on the controllability of the specification language have been discussed.