annotate toolboxes/FullBNT-1.0.7/bnt/examples/limids/oil1.m @ 0:cc4b1211e677 tip

initial commit to HG from Changeset: 646 (e263d8a21543) added further path and more save "camirversion.m"
author Daniel Wolff
date Fri, 19 Aug 2016 13:07:06 +0200
parents
children
rev   line source
Daniel@0 1 % oil wildcatter influence diagram in Cowell et al p172
Daniel@0 2
Daniel@0 3 % T = test for oil?
Daniel@0 4 % UT = utility (negative cost) of testing
Daniel@0 5 % O = amount of oil = Dry, Wet or Soaking
Daniel@0 6 % R = results of test = NoStrucure, OpenStructure, ClosedStructure or NoResult
Daniel@0 7 % D = drill?
Daniel@0 8 % UD = utility of drilling
Daniel@0 9
Daniel@0 10 % Decision sequence = T R D O
Daniel@0 11
Daniel@0 12 T = 1; UT = 2; O = 3; R = 4; D = 5; UD = 6;
Daniel@0 13 N = 6;
Daniel@0 14 dag = zeros(N);
Daniel@0 15 dag(T, [UT R D]) = 1;
Daniel@0 16 dag(O, [R UD]) = 1;
Daniel@0 17 dag(R, D) = 1;
Daniel@0 18 dag(D, UD) = 1;
Daniel@0 19
Daniel@0 20 ns = zeros(1,N);
Daniel@0 21 ns(O) = 3; ns(R) = 4; ns(T) = 2; ns(D) = 2; ns(UT) = 1; ns(UD) = 1;
Daniel@0 22
Daniel@0 23 limid = mk_limid(dag, ns, 'chance', [O R], 'decision', [T D], 'utility', [UT UD]);
Daniel@0 24
Daniel@0 25 limid.CPD{O} = tabular_CPD(limid, O, [0.5 0.3 0.2]);
Daniel@0 26 tbl = [0.6 0 0.3 0 0.1 0 0.3 0 0.4 0 0.4 0 0.1 0 0.3 0 0.5 0 0 1 0 1 0 1];
Daniel@0 27 limid.CPD{R} = tabular_CPD(limid, R, tbl);
Daniel@0 28
Daniel@0 29 limid.CPD{UT} = tabular_utility_node(limid, UT, [-10 0]);
Daniel@0 30 limid.CPD{UD} = tabular_utility_node(limid, UD, [-70 50 200 0 0 0]);
Daniel@0 31
Daniel@0 32 if 1
Daniel@0 33 % start with uniform policies
Daniel@0 34 limid.CPD{T} = tabular_decision_node(limid, T);
Daniel@0 35 limid.CPD{D} = tabular_decision_node(limid, D);
Daniel@0 36 else
Daniel@0 37 % hard code optimal policies
Daniel@0 38 limid.CPD{T} = tabular_decision_node(limid, T, [1.0 0.0]);
Daniel@0 39 a = 0.5; b = 1-a; % arbitrary value
Daniel@0 40 tbl = myreshape([0 a 1 a 1 a a a 1 b 0 b 0 b b b], ns([T R D]));
Daniel@0 41 limid.CPD{D} = tabular_decision_node(limid, D, tbl);
Daniel@0 42 end
Daniel@0 43
Daniel@0 44 %fname = '/home/cs/murphyk/matlab/Misc/loopybel.txt';
Daniel@0 45
Daniel@0 46 engines = {};
Daniel@0 47 engines{end+1} = global_joint_inf_engine(limid);
Daniel@0 48 engines{end+1} = jtree_limid_inf_engine(limid);
Daniel@0 49 %engines{end+1} = belprop_inf_engine(limid, 'max_iter', 3*N, 'filename', fname);
Daniel@0 50
Daniel@0 51 exact = [1 2];
Daniel@0 52 %approx = 3;
Daniel@0 53 approx = [];
Daniel@0 54
Daniel@0 55 E = length(engines);
Daniel@0 56 strategy = cell(1, E);
Daniel@0 57 MEU = zeros(1, E);
Daniel@0 58 for e=1:E
Daniel@0 59 [strategy{e}, MEU(e)] = solve_limid(engines{e});
Daniel@0 60 MEU
Daniel@0 61 end
Daniel@0 62 MEU
Daniel@0 63
Daniel@0 64 for e=exact(:)'
Daniel@0 65 assert(approxeq(MEU(e), 22.5))
Daniel@0 66 % U(T=yes) U(T=no)
Daniel@0 67 % 1 0
Daniel@0 68 assert(argmax(strategy{e}{T}) == 1); % test = yes
Daniel@0 69 t = 1; % test = yes
Daniel@0 70 % strategy{D} T R U(D=yes=1) U(D=no=2)
Daniel@0 71 % 1=yes 1=noS 0 1 Don't drill
Daniel@0 72 % 2=no 1=noS 1 0
Daniel@0 73 % 1=yes 2=opS 1 0
Daniel@0 74 % 2=no 2=opS 1 0
Daniel@0 75 % 1=yes 3=clS 1 0
Daniel@0 76 % 2=no 3=clS 1 0
Daniel@0 77 % 1=yes 4=unk 1 0
Daniel@0 78 % 2=no 4=unk 1 0
Daniel@0 79
Daniel@0 80 for r=[2 3] % OpS, ClS
Daniel@0 81 assert(argmax(squeeze(strategy{e}{D}(t,r,:))) == 1); % drill = yes
Daniel@0 82 end
Daniel@0 83 r = 1; % noS
Daniel@0 84 assert(argmax(squeeze(strategy{e}{D}(t,r,:))) == 2); % drill = no
Daniel@0 85 end
Daniel@0 86
Daniel@0 87
Daniel@0 88 for e=approx(:)'
Daniel@0 89 approxeq(strategy{exact(1)}{T}, strategy{e}{T})
Daniel@0 90 approxeq(strategy{exact(1)}{D}, strategy{e}{D})
Daniel@0 91 end