CDC 2005 1 Relative Entropy Applied to Optimal Control of Stochastic Uncertain Systems on Hilbert Space Nasir U. Ahmed School of Information Technology.

Slides:



Advertisements
Similar presentations
Advanced topics in Financial Econometrics Bas Werker Tilburg University, SAMSI fellow.
Advertisements

On Complexity, Sampling, and -Nets and -Samples. Range Spaces A range space is a pair, where is a ground set, it’s elements called points and is a family.
Applied Informatics Štefan BEREŽNÝ
Price Of Anarchy: Routing
Approximation Algorithms Chapter 14: Rounding Applied to Set Cover.
Calculus and Elementary Analysis 1.2 Supremum and Infimum Integers, Rational Numbers and Real Numbers Completeness of Real Numbers Supremum and Infimum.
Supremum and Infimum Mika Seppälä.
By Groysman Maxim. Let S be a set of sites in the plane. Each point in the plane is influenced by each point of S. We would like to decompose the plane.
Computing Interval Estimates for Components of Statistical Information with Respect to Judgements on Probability Density Functions Victor G. Krymsky Ufa.
Chaper 3 Weak Topologies. Reflexive Space.Separabe Space. Uniform Convex Spaces.
CWIT Robust Entropy Rate for Uncertain Sources: Applications to Communication and Control Systems Charalambos D. Charalambous Dept. of Electrical.
1 By Gil Kalai Institute of Mathematics and Center for Rationality, Hebrew University, Jerusalem, Israel presented by: Yair Cymbalista.
Visual Recognition Tutorial
Martin Burger Institut für Numerische und Angewandte Mathematik European Institute for Molecular Imaging CeNoS Total Variation and Related Methods II.
Chebyshev Estimator Presented by: Orr Srour. References Yonina Eldar, Amir Beck and Marc Teboulle, "A Minimax Chebyshev Estimator for Bounded Error Estimation"
Network Bandwidth Allocation (and Stability) In Three Acts.
Approximation Algorithms
Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs Y. Rabinovich R. Raz DCG 19 (1998) Iris Reinbacher COMP 670P
Visual Recognition Tutorial
Mathematics1 Mathematics 1 Applied Informatics Štefan BEREŽNÝ.
Partially Ordered Sets (POSets)
Copyright © 2011 Pearson, Inc. 1.2 Functions and Their Properties.
Asaf Cohen (joint work with Rami Atar) Department of Mathematics University of Michigan Financial Mathematics Seminar University of Michigan March 11,
Computing and Communicating Functions over Sensor Networks A.Giridhar and P. R. Kumar Presented by Srikanth Hariharan.
Discrete Mathematics, 1st Edition Kevin Ferland
2.4 Sequences and Summations
استاد : دکتر گلبابایی In detail this means three conditions:  1. f has to be defined at c.  2. the limit on the left hand side of that equation has.
PROBABILITY AND STATISTICS FOR ENGINEERING Hossein Sameti Department of Computer Engineering Sharif University of Technology The Weak Law and the Strong.
Chapter 3 L p -space. Preliminaries on measure and integration.
Edge-disjoint induced subgraphs with given minimum degree Raphael Yuster 2012.
Extremal Problems of Information Combining Alexei Ashikhmin  Information Combining: formulation of the problem  Mutual Information Function for the Single.
MA4266 Topology Wayne Lawton Department of Mathematics S ,
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/21/2008.
Number Theory Project The Interpretation of the definition Andre (JianYou) Wang Joint with JingYi Xue.
1 Combinatorial Algorithms Local Search. A local search algorithm starts with an arbitrary feasible solution to the problem, and then check if some small,
PROBABILITY AND STATISTICS FOR ENGINEERING Hossein Sameti Department of Computer Engineering Sharif University of Technology Principles of Parameter Estimation.
March 24, 2006 Fixed Point Theory in Fréchet Space D. P. Dwiggins Systems Support Office of Admissions Department of Mathematical Sciences Analysis Seminar.
Presenter : Kuang-Jui Hsu Date : 2011/3/24(Thur.).
Survey of Kernel Methods by Jinsan Yang. (c) 2003 SNU Biointelligence Lab. Introduction Support Vector Machines Formulation of SVM Optimization Theorem.
Introduction to Real Analysis Dr. Weihu Hong Clayton State University 8/19/2008.
CPSC 536N Sparse Approximations Winter 2013 Lecture 1 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAAAAAAA.
Mathematical Writing chapter 7 Roozbeh Izadian Fall 2015.
Introduction to Optimization
Inequalities for Stochastic Linear Programming Problems By Albert Madansky Presented by Kevin Byrnes.
Preliminaries 1. Zorn’s Lemma Relation S: an arbitary set R SXS R is called a relation on S.
1 On the Channel Capacity of Wireless Fading Channels C. D. Charalambous and S. Z. Denic School of Information Technology and Engineering, University of.
A Brief Maximum Entropy Tutorial Presenter: Davidson Date: 2009/02/04 Original Author: Adam Berger, 1996/07/05
Linear & Nonlinear Programming -- Basic Properties of Solutions and Algorithms.
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
CDC Control over Wireless Communication Channel for Continuous-Time Systems C. D. Charalambous ECE Department University of Cyprus, Nicosia, Cyprus.
Approximation Algorithms based on linear programming.
Extending a displacement A displacement defined by a pair where l is the length of the displacement and  the angle between its direction and the x-axix.
Slide 4- 1 Copyright © 2010 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 1- 1 Copyright © 2010 Pearson Education, Inc. Publishing.
Primbs, MS&E345 1 Measure Theory in a Lecture. Primbs, MS&E345 2 Perspective  -Algebras Measurable Functions Measure and Integration Radon-Nikodym Theorem.
Chapter 3 The Real Numbers.
Chapter 5 Limits and Continuity.
Theorem of Banach stainhaus and of Closed Graph
Chapter 3 The Real Numbers.
Compactness in Metric space
Path Coupling And Approximate Counting
Chapter 5. Optimal Matchings
Additive Combinatorics and its Applications in Theoretical CS
Depth Estimation via Sampling
Chapter 8: Further Topics in Algebra
Field.
AREA Section 4.2.
Existence of 3-factors in Star-free Graphs with High Connectivity
Introduction to Analysis
AREA Section 4.2.
Introduction to Analysis
Presentation transcript:

CDC Relative Entropy Applied to Optimal Control of Stochastic Uncertain Systems on Hilbert Space Nasir U. Ahmed School of Information Technology and Engineering, and Department of Mathematics University of Ottawa, Ottawa Canada. and C. D. Charalambous ECE Department University of Cyprus, Nicosia, Cyprus. Also, School of Information Technology and Engineering, University of Ottawa, Ottawa Canada

2 CDC 2005 Overview Notation and Problem Formulation Existence of Solution Examples Applications in Uncertain Stochastic Control System

CDC Notations and Problem Formulation

4 CDC 2005 Notations is a Polish space. is the sigma algebra of Borel sets generated by the metric topology. is the space of countably additive regular probability measures defined on. is furnished with the weak topology. This topology is metrizable with the Prohorv metric which makes it complete. The relative entropy between two probability measures and is given by

5 CDC 2005 Notations Let, be an extended real valued continuous function. Let denote the set of measures induced by a controlled stochastic system under the assumptions that the system is perfectly known. For each fixed and, define the set

6 CDC 2005 Problem Formulation Basic Problem. The problem is to find a that minimizes the functional over the set. In other words we wish to find a solution to the min-max problem

CDC Existence of the Solution

8 CDC 2005 Existence of the Solution Lemma 1. Let be an upper semi continuous function and strictly concave. Then for every, there exists a unique at which attains its supremum. Lemma 2. Suppose the assumptions of the above Lemma hold. Then, the graph of the multifunction is sequentially closed and the function is lower semi continuous.

9 CDC 2005 Existence of the Solution Theorem 3. Consider the problem and suppose that is upper/lower semi continuous and strictly concave/convex and the set is compact with respect to Prohorov topology. Then the problem has a solution. Problem. Consider the following problem Define and find such that Corollary 4. Let be upper semi continuous and strictly concave,, and a compact subset of. Then, the above stated problem has solution.

CDC Examples

11 CDC 2005 (E1) Target Seeking Problem Example 1. Let be a desired measure. we wish to find a that approximates as closely as possible. We consider the following objective functional Disregarding the uncertainty, and assuming is a compact set, attains its minimum on. Let be minimizer, that is,. But since the system is uncertain, the actual law in

12 CDC 2005 (E1) Target Seeking Problem force may be any element from and one may face the worst situation, Clearly, with. So instead of choosing, we may choose one that minimizes the maximum distance. That is, we choose an element so that where Clearly

13 CDC 2005 (E2) Evasion Problem Example 2. Let be a family of disjoint sets and suppose we wish to find a measure from the attainable set that has minimum concentration of mass on these sets. This represents an evasion problem. Let be any bounded continuous function, increasing in all its arguments. Define the functional as follows, where denotes the indicator function of the set

14 CDC 2005 (E2) Evasion Problem Disregarding uncertainty, and noting that is continuous, and compact, there exists a at which attains its minimum,. Considering the uncertainty at we can find Such that

15 CDC 2005 (E3) Hitting Problem Example 3. Let be a family of open subsets of and an increasing function of all its arguments. Consider the functional given by The objective is to find from the attainable set of measures that maximizes the concentration of mass on the given sets. This is equivalent to hitting the target with maximum probability.

16 CDC 2005 (E3) Hitting Problem Due to the presence of uncertainty, we must maximize the minimum concentration giving rise to the sup-inf problem By virtue of mentioned theorems, it can be shown that the functional is lower semi continuous on in Prohorov topology.

CDC Application in Uncertain Stochastic Control Systems

18 CDC 2005 Problem Formulation Perturbed System. The uncertain system is given by We assume throughout that is a measurable multifunction in the sense that for every the set. Nominal System. The nominal system is given by

19 CDC 2005 Problem Formulation Theorem. Consider the perturbed system and suppose that is a measurable multifunction mapping to and there exists a finite positive number such that Then for each, the system has a nonempty set of martingale solutions denoted by Further, there exists a finite positive number such that

20 CDC 2005 Problem Formulation (Pc): Find a control at which the following inf-sup is attained Defining Our problem can be compactly presented as follows. Find that minimizes the functional given by so that,

21 CDC 2005 Solution For this problem one has to choose, and the multifunction as given below Then min-max problem (Pc) has a solution.

22 CDC 2005 Solution Lemma. For a given, for some such that a measurable function bounded from below the following statement hold Moreover, if the supremum is attained at