-
Notifications
You must be signed in to change notification settings - Fork 1
/
feasibleSet.jl
51 lines (50 loc) · 1.44 KB
/
feasibleSet.jl
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
#Julia 1.0.2
function feasibleSet(st::Vector{Int64}, T::Int64)
up = Vector{Vector{Int64}}(undef,4)
up[1] = [1,0,0,0]
up[2] = [0,1,0,0]
up[3] = [0,0,1,0]
up[4] = [0,0,0,0]
if sum([st[1] st[2] st[3]]) < T + 10
if st[1] < 20
output = Vector{Vector{Int64}}(undef,4)
for i=1:4
output[i] = st + up[i]
if output[i][1] - st[1] == 1
output[i][4] = 1
else
output[i][4] = 0
end
end
else
output = Vector{Vector{Int64}}(undef,3)
for i = 1:3
output[i] = st + up[i+1]
output[i][4] = 0
end
end
else
st[4] = 0
output = Vector{Vector{Int64}}(st,1)
end
return output
end
function StateSpace(st::Vector{Int64}, T::Int64)
# Define an auxiliary vector to calculate the feasible set
# It adds 1 to the state vector according to the action taken
# First element: go to school
# Second: Work at 1
# Third: Work at 2
# Stay at home
Domain_set = OrderedDict{Int64,Vector{Vector{Int64}}}()
D = Vector{Vector{Int64}}(undef,0)
Domain_set[2] = vcat(feasibleSet(st, T),D)
for t = 2:T-1
D = Vector{Vector{Int64}}(undef,0)
for i in Domain_set[t]
D = vcat(feasibleSet(i, T),D)
end
Domain_set[t+1] = unique(D)
end
return Domain_set
end