Stochastic Model of a Micro Agents population Dejan Milutinovic

Slides:



Advertisements
Similar presentations
CS344 : Introduction to Artificial Intelligence
Advertisements

Many useful applications, especially in queueing systems, inventory management, and reliability analysis. A connection between discrete time Markov chains.
Polynomial dynamical systems over finite fields, with applications to modeling and simulation of biological networks. IMA Workshop on Applications of.
Modelling and Identification of dynamical gene interactions Ronald Westra, Ralf Peeters Systems Theory Group Department of Mathematics Maastricht University.
CS 367: Model-Based Reasoning Lecture 2 (01/15/2002)
Supervisory Control of Hybrid Systems Written by X. D. Koutsoukos et al. Presented by Wu, Jian 04/16/2002.
Hidden Markov Model 主講人:虞台文 大同大學資工所 智慧型多媒體研究室. Contents Introduction – Markov Chain – Hidden Markov Model (HMM) Formal Definition of HMM & Problems Estimate.
1 Chapter 5 Continuous time Markov Chains Learning objectives : Introduce continuous time Markov Chain Model manufacturing systems using Markov Chain Able.
Discrete Time Markov Chains
Introduction of Probabilistic Reasoning and Bayesian Networks
Markov Chains 1.
1 Formal Models for Stability Analysis : Verifying Average Dwell Time * Sayan Mitra MIT,CSAIL Research Qualifying Exam 20 th December.
An Introduction to Markov Decision Processes Sarah Hickmott
Lecture 3: Markov processes, master equation
Discrete-Time Markov Chains. © Tallal Elshabrawy 2 Introduction Markov Modeling is an extremely important tool in the field of modeling and analysis of.
Hidden Markov Models in NLP
Chess Review November 21, 2005 Berkeley, CA Edited and presented by Optimal Control of Stochastic Hybrid Systems Robin Raffard EECS Berkeley.
Hilbert Space Embeddings of Hidden Markov Models Le Song, Byron Boots, Sajid Siddiqi, Geoff Gordon and Alex Smola 1.
HMM-BASED PATTERN DETECTION. Outline  Markov Process  Hidden Markov Models Elements Basic Problems Evaluation Optimization Training Implementation 2-D.
1 Markov Chains Tom Finke. 2 Overview Outline of presentation The Markov chain model –Description and solution of simplest chain –Study of steady state.
Chess Review May 10, 2004 Berkeley, CA A stability criterion for Stochastic Hybrid Systems A. Abate, L. Shi, S. Simic and S.S. Sastry University of California.
Chapter 4: Stochastic Processes Poisson Processes and Markov Chains
Part1 Markov Models for Pattern Recognition – Introduction CSE717, SPRING 2008 CUBS, Univ at Buffalo.
1 A Generic Mean Field Convergence Result for Systems of Interacting Objects From Micro to Macro Jean-Yves Le Boudec, EPFL Joint work with David McDonald,
4. Review of Basic Probability and Statistics
Markov Decision Processes
CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Course outline and schedule Introduction (Sec )
Discrete models of biochemical networks Algebraic Biology 2007 RISC Linz, Austria July 3, 2007 Reinhard Laubenbacher Virginia Bioinformatics Institute.
Sheila McIlraith, Knowledge Systems Lab, Stanford University DX’00, 06/2000 Diagnosing Hybrid Systems: A Bayesian Model Selection Approach Sheila McIlraith.
Statistical Theory; Why is the Gaussian Distribution so popular? Rob Nicholls MRC LMB Statistics Course 2014.
Lecture II-2: Probability Review
CS6800 Advanced Theory of Computation Fall 2012 Vinay B Gavirangaswamy
Antigen recognition by T cells Zheng W. Chen, M.D., Ph.D.
Review of Probability.
Policy Generation for Continuous-time Stochastic Domains with Concurrency Håkan L. S. YounesReid G. Simmons Carnegie Mellon University.
Simulation Output Analysis
Probability for Estimation (review) In general, we want to develop an estimator for systems of the form: We will primarily focus on discrete time linear.
Planning and Verification for Stochastic Processes with Asynchronous Events Håkan L. S. Younes Carnegie Mellon University.
Graphical models for part of speech tagging
Kalman Filter (Thu) Joon Shik Kim Computational Models of Intelligence.
0 K. Salah 2. Review of Probability and Statistics Refs: Law & Kelton, Chapter 4.
A discrete-time Markov Chain consists of random variables X n for n = 0, 1, 2, 3, …, where the possible values for each X n are the integers 0, 1, 2, …,
By: Messias, Spaan, Lima Presented by: Mike Plasker DMES – Ocean Engineering.
MODEL ERROR ESTIMATION EMPLOYING DATA ASSIMILATION METHODOLOGIES Dusanka Zupanski Cooperative Institute for Research in the Atmosphere Colorado State University.
Immunol mol med 2 Conleth Feighery This lecture ….. Importance of lymphocytes in immune system Identification of T and B cells How these cells bind.
ECE 466/658: Performance Evaluation and Simulation Introduction Instructor: Christos Panayiotou.
Theory of Computations III CS-6800 |SPRING
1 CS 552/652 Speech Recognition with Hidden Markov Models Winter 2011 Oregon Health & Science University Center for Spoken Language Understanding John-Paul.
Robotics Research Laboratory 1 Chapter 7 Multivariable and Optimal Control.
An Introduction to Kalman Filtering by Arthur Pece
Adaptive Immunity David, “Bubble Boy” 1980 from 2011 CBS News 40-year retrospective 2011.
The generalization of Bayes for continuous densities is that we have some density f(y|  ) where y and  are vectors of data and parameters with  being.
MA354 An Introduction to Math Models (more or less corresponding to 1.0 in your book)
Markov Chain Monte Carlo for LDA C. Andrieu, N. D. Freitas, and A. Doucet, An Introduction to MCMC for Machine Learning, R. M. Neal, Probabilistic.
Introduction Stats I. To Do Today Introductions Blog: swstats.blogspot.com Go Over Syllabus Go Over Textbooks Register for EP Take Intro Survey Course.
Dongfang Xu School of Information
ECE 8443 – Pattern Recognition ECE 8527 – Introduction to Machine Learning and Pattern Recognition Objectives: Elements of a Discrete Model Evaluation.
Introduction to discrete event systems
1 Hidden Markov Models Hsin-min Wang References: 1.L. R. Rabiner and B. H. Juang, (1993) Fundamentals of Speech Recognition, Chapter.
STA347 - week 91 Random Vectors and Matrices A random vector is a vector whose elements are random variables. The collective behavior of a p x 1 random.
Stochastic Processes and Transition Probabilities D Nagesh Kumar, IISc Water Resources Planning and Management: M6L5 Stochastic Optimization.
MA354 Math Modeling Introduction. Outline A. Three Course Objectives 1. Model literacy: understanding a typical model description 2. Model Analysis 3.
Intelligent Control Methods Lecture 1: Introduction. Reasons for ICM, Basic Concepts Slovak University of Technology Faculty of Material Science and Technology.
Hidden Markov Models. A Hidden Markov Model consists of 1.A sequence of states {X t |t  T } = {X 1, X 2,..., X T }, and 2.A sequence of observations.
ECE-7000: Nonlinear Dynamical Systems 3. Phase Space Methods 3.1 Determinism: Uniqueness in phase space We Assume that the system is linear stochastic.
From DeGroot & Schervish. Example Occupied Telephone Lines Suppose that a certain business office has five telephone lines and that any number of these.
Availability Availability - A(t)
Hidden Markov Autoregressive Models
Tim Holliday Peter Glynn Andrea Goldsmith Stanford University
Probability & Statistics Probability Theory Mathematical Probability Models Event Relationships Distributions of Random Variables Continuous Random.
Presentation transcript:

Stochastic Model of a Micro Agents population Dejan Milutinovic

Outline Motivating problem Introduction to Math. Analysis Mathematical Analysis Applications BiologyRobotics

T-Cell Receptor (TCR) triggering APC MHC peptide T-Cell CD3 T-Cell, CD3 receptor, Antigen Presenting Cell (APC), peptide-MHC complex Motivating problem

T-Cell population - T-Cell - APC Introduction to Math. Analysis

T-Cell population - T-Cell - APC Introduction to Math. Analysis Complex System !!!

How the Micro Dynamics of the Individuals propagates to the Dynamics of Macro observations ? Introduction to Math. Analysis

1 –never connected, 2 - connected, 3- disconnected, a-connection, b-disconnection q=3 u(t)=a q=1 q=2 u(t)=a u(t)=b The Micro Agent model of the T-Cell Mathematical Analysis

Micro Agent (  A) Initial condition (x 0,q 0 ) Input event sequence AA u(t) Continuous output Y(t) Deterministic system u(t) Y(t) abc

Mathematical Analysis Stochastic Micro Agent (S  A) AA AA AA Stoch. process Determinist. system Stoch. process SASA Stochastic system

Mathematical Analysis Micro and Macro Dynamics relation PDF function describes the state probability of one  A Looking to the large population of  A, PDF is a normalized distribution of the state occupancy by all  A Micro dynamics of  A and macro dynamics of  A population are related through the state PDFs Dual Meaning of the State Probability Density Function Statistical Physics reasoning (Boltzman distribution)

A stochastic process (x(t),q(t))  X  Q is called a Micro Agent Stochastic Execution iff a Micro Agent stochastic input event sequence e(  n ),n  N,  0 = 0   1   2  … generates transitions such that in each interval [  n,  n+1 ), n  N, q(t)  q(  n ). Micro Agent Stochastic Execution Remark 1. The x(t) of a Stochastic Execution is a continuous time function since the transition changes only the discrete state of a Micro Agent. Mathematical Analysis f(x,N) 1 i N V V V x1x1 xnxn x n-1... f(x,1) e(  n ) f(x,i) q e(  n+1 ) e(  n+2 ) X x Q

A Stochastic Micro Agent is a pair S  A=(  A,e(t)) where  A is a Micro Agent and e(t) is a Micro Agent stochastic input event sequence such that the stochastic process (x(t),q(t))  X  Q is a Micro Agent Stochastic Execution. Stochastic Micro Agent (S  A) Mathematical Analysis AA AA AA Stoch. process Determinist. system Stoch. process SASA Stochastic system

A Stochastic Micro Agent is called a Continuous Time Markov Process Micro Agent iff (x(t),q(t))  X  Q is a Micro Agent Continuous Time Markov Process Execution. Mathematical Analysis Continuous Time Markov Process Micro Agent (CTMP  A) SASA q=3 u(t)=a q=1 q=2 u(t)=a u(t)=b

Mathematical Analysis The Continuous Time Markov Chain Micro Agent with N discrete state and state probability given by where state i and is the probability of discrete is transition rate matrixand is rate of transition from discrete state i to discrete state j. The vector of probability density functions whereis probability density functionof state (x,i) at time t, satisfies is the vector of vector fields value at state (x,i).where

Biological application The Micro Agent model of the T-Cell u(t)=a q=1 q=2 q=3 u(t)=a u(t)=b b-disconnection, ij – event rate which leads to transition from state i to state j 0 –never connected, 1 - connected, 2- disconnected, a-connection,

Biological application Case I solution 12 =0.9, 23 = 0, 32 =0.5, k 2 =0.5, k 3 =0.25

Biological application Case II solution 12 =0.9, 23 = 0.8, 32 =0.9, k 2 =0.5, k 3 =0.05

Biological application Case III solution 12 =0.9, 23 = 0.8, 32 =0.9, k 2 =0.5, k 3 =0.25

Biological application

Robotics application Source 1 Source 3 Source 2 x 2 x 1 x 2 x 1  =  /4  =-  /4  =0 Population a) b) q= q=1 q=2

Robotics application

Milutinovic, D., Athans, M., Lima, P., Carneiro, J. “Application of Nonlinear Estimation Theory in T-Cell Receptor Triggering Model Identification”, Technical Report RT , RT , 2002, ISR/IST Lisbon, Portugal Milutinovic D., Lima, P., Athans, M. “Biologically Inspired Stochastic Hybrid Control of Multi-Robot Systems”, submitted to the 11th International Conference on Advanced Robotics ICAR 2003,June 30 - July 3, 2003 University of Coimbra, Portugal Milutinovic D., Carneiro J., Athans, M., Lima, P. “A Hybrid Automata Modell of TCR Triggering Dynamics”, submitted to the 11th Mediterranian Conference on Control and Automation MED 2003,June , 2003, Rhodes, Greece Milutinovic, D., “Stochastic Model of a Micro Agents Population”, Technical Report ISR/IST Lisbon, Portugal (working version) Publications

Stochastic Model of a Micro Agents population Dejan Milutinovic