sol1 - EE292E Analysis & Control of Markov Chains Prof. Ben...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
EE292E Spring 2008 April 10, 2008 Prof. Ben Van Roy Homework Assignment 1 : Solutions 1.16 (a) Each state is a set S k ⊂ { 2 , ...N } . The allowable states at stage k are those sets S k of cardinality k . The allowable controls are u k ∈ { 2 , ..., N } - S k . This control represents the multiplication of the term ending in M u k - 1 by the one starting in M u k . The system equation is S k +1 = S k u k . The terminal state is S N = { 2 , ..., N } , with cost 0 . The cost at stage k is given by the number of multiplications: g k ( S k , u k ) = n a n u k n b where a = max { i ∈ { 1 , . . . , N + 1 }| i / S k , i < u k } b = min { i ∈ { 1 , . . . , N + 1 }| i / S k , i > u k } For example, let N = 3 and M 1 be 1 × 10 , M 2 be 10 × 1 , M 3 be 1 × 10 . The order ( M 1 M 2 ) M 3 corresponds to controls u 1 = 2 and u 2 = 3 , giving cost: ( u 1 = 2) : n 1 n 2 n 3 = 10( a = 1 , b = 3) ( u 2 = 3) : n 1 n 3 n 4 = 10( a = 1 , b = 4) with a total cost of
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/15/2011 for the course EECS 6.231 taught by Professor Bertsekas during the Spring '10 term at MIT.

Page1 / 2

sol1 - EE292E Analysis & Control of Markov Chains Prof. Ben...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online