-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgenerate-grid-designs-tost-D0.R
474 lines (340 loc) · 20.2 KB
/
generate-grid-designs-tost-D0.R
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
## Generating regular grid and optimal (spacing) grid designs for Tost, Mongolia, under uniform density
## To be compared with designs in Figure 2 of the paper.
library(dplyr)
library(tidyr)
library(ggplot2)
library(sf)
library(stringr)
library(purrr)
library(secr)
library(secrdesign)
library(oSCR)
library(raster)
library(gdistance)
library(kofnGA)
# user parameters
lambda0 <- 1
dens_per_100km2 <- 2 # mean animal density per 100km2, SLs are ~1
D <- dens_per_100km2 / 10000
sigma <- 3000
b_ac <- 1
nT <- 60
buffer <- 4 * sigma
dt <- "count"
# load secr masks -- note that these have been constructed to have buffer = 0 (hard boundary to study area)
load("data/Tost.RData")
fullmask <- TostMask
# reduce resolution of mesh so have fewer possible camera locations
cellsize <- 2/3 * sigma
red_factor <- cellsize[1] / attr(fullmask, "spacing")
if ((trunc(red_factor) - red_factor) != 0) stop("Check spacing, causing non-integer reduction factor for mesh")
mask <- secr::raster(fullmask, "stdGC") %>% raster::aggregate(fact = red_factor, fun = mean)
mask_df <- data.frame(coordinates(mask), stdGC = matrix(mask)) %>% filter(!is.na(stdGC))
mask <- read.mask(data = mask_df)
plot(mask)
# create a buffered mask (the mask used for the designs) from the mask above
buffer_mult <- ceiling(buffer / cellsize)
newmask_df <- expand.grid(x = seq(from = min(mask_df$x) - buffer_mult * cellsize,
to = max(mask_df$x) + buffer_mult * cellsize,
by = cellsize),
y = seq(from = min(mask_df$y) - buffer_mult * cellsize,
to = max(mask_df$y) + buffer_mult * cellsize,
by = cellsize))
newmask_df <- newmask_df %>%
mutate(keep = (apply(e2dist(as.matrix(newmask_df), as.matrix(mask_df)), 1, min) <= buffer)) %>%
filter(keep == TRUE) %>% dplyr::select(-keep)
newmask <- read.mask(data = newmask_df)
plot(newmask,axes=T)
# create grid of possible trap locations
cellsize <- 2/3 * sigma
red_factor <- cellsize[1] / attr(fullmask, "spacing")
if ((trunc(red_factor) - red_factor) != 0) stop("Check spacing, causing non-integer reduction factor for mesh")
alltraps <- secr::raster(fullmask, "stdGC") %>% raster::aggregate(fact = red_factor, fun = mean)
alltraps_df <- data.frame(coordinates(alltraps), stdGC = matrix(alltraps)) %>% filter(!is.na(stdGC))
alltraps <- as.matrix(alltraps_df)[,c(1,2)]
plot(read.mask(data = alltraps_df), col = 'blue', add = TRUE, axes =T)
### going to generate En, Er, CV under different designs in this survey area, varying nT, lambda0, sigma, buffer
################################################
### To compare with min(n,r) designs in Figure 2: uniform D, uniform habitat use
################################################
grid_traps_all <- data.frame(nT = as.integer(), sigma = as.numeric(), beta0 = as.numeric(), buffer = as.numeric(), dt = as.character(),
x = as.numeric(), y = as.numeric(), trap_id = as.integer())
opt_grid_traps_all <- data.frame(nT = as.integer(), sigma = as.numeric(), beta0 = as.numeric(), buffer = as.numeric(), dt = as.character(),
x = as.numeric(), y = as.numeric(), trap_id = as.integer())
# Fig 1 a-c, d-f: varying number of cameras
for(n in c(20,40,60)){
##########################
### Regular 2 sigma grid
##########################
# hacky way to make a polygon just bigger than boundary of mask points
# used later to decide which randomly generated detectors are on the mask and so allowed
sap_1 <- mask_df %>% st_as_sf(coords = c("x", "y")) %>% st_buffer(dist = cellsize, endCapStyle = "SQUARE") %>% st_union()
sap_1 <- sap_1 %>% st_buffer(dist = -cellsize * 0.4, endCapStyle = "SQUARE")
# place a grid over the area, with cells X sigma apart
my_grid <- st_make_grid(sap_1, cellsize = c(2 * sigma, 2 * sigma), what = "centers") %>%
st_intersection(sap_1)
grid_traps_full <- st_coordinates(my_grid) %>% as.data.frame() %>% rename(x = X, y = Y)
# choose a subset of nT of these, starting from a random trap and then choosing nT nearest neighbours
all_grid_traps <- list()
grid_traps <- grid_traps_full
set.seed(700)
xy_rand <- grid_traps[sample(1:nrow(grid_traps), 1), ]
grid_traps$dist2pt <- (grid_traps$x - xy_rand$x)^2 + (grid_traps$y - xy_rand$y)^2
grid_traps <- grid_traps %>% filter(rank(dist2pt, ties.method = "random") <= n) %>% mutate(trap_id = 1)
grid_traps_all <- rbind(grid_traps_all, cbind(nT = n, lambda0 = lambda0, sigma = sigma, buffer = buffer, dt = dt, grid_traps))
###############
### regular grid with optimal spacing
###############
grid_traps <- read.traps(data = grid_traps, detector = dt)
# compute optimal spacing for previous grid
dd <- optimalSpacing(D = D, traps = grid_traps, detectpar = list(lambda0 = lambda0, sigma = sigma), noccasions = 1)$rotRSE$optimum.spacing
# sometimes optimal spacing is too big to fit desired number of traps in; if so, reduce dd until it is
n_opt_grid <- 0
red_dd <- 0.9
while(n_opt_grid < n){
dd <- dd * red_dd
# place a grid over the area, with cells optimally spaced
my_grid <- st_make_grid(sap_1, cellsize = c(dd, dd), what = "centers") %>% st_intersection(sap_1)
opt_grid_traps_full <- st_coordinates(my_grid) %>% as.data.frame() %>% rename(x = X, y = Y)
# choose a subset of nT of these points, starting from a random trap and then choosing nT nearest neighbours
opt_grid_traps <- opt_grid_traps_full
set.seed(700)
xy_rand <- opt_grid_traps[sample(1:nrow(opt_grid_traps), 1), ]
opt_grid_traps$dist2pt <- (opt_grid_traps$x - xy_rand$x)^2 + (opt_grid_traps$y - xy_rand$y)^2
opt_grid_traps <- opt_grid_traps %>% filter(rank(dist2pt, ties.method = "random") <= n) %>% mutate(trap_id = 1)
n_opt_grid <- nrow(opt_grid_traps)
}
opt_grid_traps_all <- rbind(opt_grid_traps_all, cbind(nT = n, lambda0 = lambda0, sigma = sigma, buffer = buffer, dt = dt, opt_grid_traps))
}
for(n in c(20,40,60)){
##########################
### Regular 2 sigma grid
##########################
# hacky way to make a polygon just bigger than boundary of mask points
# used later to decide which randomly generated detectors are on the mask and so allowed
sap_1 <- mask_df %>% st_as_sf(coords = c("x", "y")) %>% st_buffer(dist = cellsize, endCapStyle = "SQUARE") %>% st_union()
sap_1 <- sap_1 %>% st_buffer(dist = -cellsize * 0.4, endCapStyle = "SQUARE")
# place a grid over the area, with cells X sigma apart
my_grid <- st_make_grid(sap_1, cellsize = c(2 * sigma, 2 * sigma), what = "centers") %>%
st_intersection(sap_1)
grid_traps_full <- st_coordinates(my_grid) %>% as.data.frame() %>% rename(x = X, y = Y)
# choose a subset of nT of these, starting from a random trap and then choosing nT nearest neighbours
all_grid_traps <- list()
grid_traps <- grid_traps_full
set.seed(222)
xy_rand <- grid_traps[sample(1:nrow(grid_traps), 1), ]
grid_traps$dist2pt <- (grid_traps$x - xy_rand$x)^2 + (grid_traps$y - xy_rand$y)^2
grid_traps <- grid_traps %>% filter(rank(dist2pt, ties.method = "random") <= n) %>% mutate(trap_id = 2)
grid_traps_all <- rbind(grid_traps_all, cbind(nT = n, lambda0 = lambda0, sigma = sigma, buffer = buffer, dt = dt, grid_traps))
###############
### regular grid with optimal spacing
###############
grid_traps <- read.traps(data = grid_traps, detector = dt)
# compute optimal spacing for previous grid
dd <- optimalSpacing(D = D, traps = grid_traps, detectpar = list(lambda0 = lambda0, sigma = sigma), noccasions = 1)$rotRSE$optimum.spacing
# sometimes optimal spacing is too big to fit desired number of traps in; if so, reduce dd until it is
n_opt_grid <- 0
red_dd <- 0.9
while(n_opt_grid < n){
dd <- dd * red_dd
# place a grid over the area, with cells optimally spaced
my_grid <- st_make_grid(sap_1, cellsize = c(dd, dd), what = "centers") %>% st_intersection(sap_1)
opt_grid_traps_full <- st_coordinates(my_grid) %>% as.data.frame() %>% rename(x = X, y = Y)
# choose a subset of nT of these points, starting from a random trap and then choosing nT nearest neighbours
opt_grid_traps <- opt_grid_traps_full
set.seed(222)
xy_rand <- opt_grid_traps[sample(1:nrow(opt_grid_traps), 1), ]
opt_grid_traps$dist2pt <- (opt_grid_traps$x - xy_rand$x)^2 + (opt_grid_traps$y - xy_rand$y)^2
opt_grid_traps <- opt_grid_traps %>% filter(rank(dist2pt, ties.method = "random") <= n) %>% mutate(trap_id = 2)
n_opt_grid <- nrow(opt_grid_traps)
}
opt_grid_traps_all <- rbind(opt_grid_traps_all, cbind(nT = n, lambda0 = lambda0, sigma = sigma, buffer = buffer, dt = dt, opt_grid_traps))
}
# Fig 1 g-i: with zero buffer
buffer <- 0 # doesn't change anything, just says what pars were used to get these results
for(n in c(20, 40, 60)){
##########################
### Regular 2 sigma grid
##########################
# hacky way to make a polygon just bigger than boundary of mask points
# used later to decide which randomly generated detectors are on the mask and so allowed
sap_1 <- mask_df %>% st_as_sf(coords = c("x", "y")) %>% st_buffer(dist = cellsize, endCapStyle = "SQUARE") %>% st_union()
sap_1 <- sap_1 %>% st_buffer(dist = -cellsize * 0.4, endCapStyle = "SQUARE")
# place a grid over the area, with cells X sigma apart
my_grid <- st_make_grid(sap_1, cellsize = c(2 * sigma, 2 * sigma), what = "centers") %>%
st_intersection(sap_1)
grid_traps_full <- st_coordinates(my_grid) %>% as.data.frame() %>% rename(x = X, y = Y)
# choose a subset of nT of these, starting from a random trap and then choosing nT nearest neighbours
all_grid_traps <- list()
grid_traps <- grid_traps_full
set.seed(700)
xy_rand <- grid_traps[sample(1:nrow(grid_traps), 1), ]
grid_traps$dist2pt <- (grid_traps$x - xy_rand$x)^2 + (grid_traps$y - xy_rand$y)^2
grid_traps <- grid_traps %>% filter(rank(dist2pt, ties.method = "random") <= n) %>% mutate(trap_id = 1)
grid_traps_all <- rbind(grid_traps_all, cbind(nT = n, lambda0 = lambda0, sigma = sigma, buffer = buffer, dt = dt, grid_traps))
###############
### regular grid with optimal spacing
###############
grid_traps <- read.traps(data = grid_traps, detector = dt)
# compute optimal spacing for previous grid
dd <- optimalSpacing(D = D, traps = grid_traps, detectpar = list(lambda0 = lambda0, sigma = sigma), noccasions = 1)$rotRSE$optimum.spacing
# sometimes optimal spacing is too big to fit desired number of traps in; if so, reduce dd until it is
n_opt_grid <- 0
red_dd <- 0.9
while(n_opt_grid < n){
dd <- dd * red_dd
# place a grid over the area, with cells optimally spaced
my_grid <- st_make_grid(sap_1, cellsize = c(dd, dd), what = "centers") %>% st_intersection(sap_1)
opt_grid_traps_full <- st_coordinates(my_grid) %>% as.data.frame() %>% rename(x = X, y = Y)
# choose a subset of nT of these points, starting from a random trap and then choosing nT nearest neighbours
opt_grid_traps <- opt_grid_traps_full
set.seed(700)
xy_rand <- opt_grid_traps[sample(1:nrow(opt_grid_traps), 1), ]
opt_grid_traps$dist2pt <- (opt_grid_traps$x - xy_rand$x)^2 + (opt_grid_traps$y - xy_rand$y)^2
opt_grid_traps <- opt_grid_traps %>% filter(rank(dist2pt, ties.method = "random") <= n) %>% mutate(trap_id = 1)
n_opt_grid <- nrow(opt_grid_traps)
}
opt_grid_traps_all <- rbind(opt_grid_traps_all, cbind(nT = n, lambda0 = lambda0, sigma = sigma, buffer = buffer, dt = dt, opt_grid_traps))
}
# Fig 1 j-l: vary beta0/lambda0
nT <- 60
buffer <- 4 * sigma # doesn't change anything, just says what pars were used to get these results
for(lam in c(0.5*lambda0, 1.5*lambda0, 2*lambda0)){
##########################
### Regular 2 sigma grid
##########################
# hacky way to make a polygon just bigger than boundary of mask points
# used later to decide which randomly generated detectors are on the mask and so allowed
sap_1 <- mask_df %>% st_as_sf(coords = c("x", "y")) %>% st_buffer(dist = cellsize, endCapStyle = "SQUARE") %>% st_union()
sap_1 <- sap_1 %>% st_buffer(dist = -cellsize * 0.4, endCapStyle = "SQUARE")
# place a grid over the area, with cells X sigma apart
my_grid <- st_make_grid(sap_1, cellsize = c(2 * sigma, 2 * sigma), what = "centers") %>%
st_intersection(sap_1)
grid_traps_full <- st_coordinates(my_grid) %>% as.data.frame() %>% rename(x = X, y = Y)
# choose a subset of nT of these, starting from a random trap and then choosing nT nearest neighbours
all_grid_traps <- list()
grid_traps <- grid_traps_full
set.seed(700)
xy_rand <- grid_traps[sample(1:nrow(grid_traps), 1), ]
grid_traps$dist2pt <- (grid_traps$x - xy_rand$x)^2 + (grid_traps$y - xy_rand$y)^2
grid_traps <- grid_traps %>% filter(rank(dist2pt, ties.method = "random") <= nT) %>% mutate(trap_id = 1)
grid_traps_all <- rbind(grid_traps_all, cbind(nT = nT, lambda0 = lam, sigma = sigma, buffer = buffer, dt = dt, grid_traps))
###############
### regular grid with optimal spacing
###############
grid_traps <- read.traps(data = grid_traps, detector = dt)
# compute optimal spacing for previous grid
dd <- optimalSpacing(D = D, traps = grid_traps, detectpar = list(lambda0 = lam, sigma = sigma), noccasions = 1)$rotRSE$optimum.spacing
# sometimes optimal spacing is too big to fit desired number of traps in; if so, reduce dd until it is
n_opt_grid <- 0
red_dd <- 0.9
while(n_opt_grid < nT){
dd <- dd * red_dd
# place a grid over the area, with cells optimally spaced
my_grid <- st_make_grid(sap_1, cellsize = c(dd, dd), what = "centers") %>% st_intersection(sap_1)
opt_grid_traps_full <- st_coordinates(my_grid) %>% as.data.frame() %>% rename(x = X, y = Y)
# choose a subset of nT of these points, starting from a random trap and then choosing nT nearest neighbours
opt_grid_traps <- opt_grid_traps_full
set.seed(700)
xy_rand <- opt_grid_traps[sample(1:nrow(opt_grid_traps), 1), ]
opt_grid_traps$dist2pt <- (opt_grid_traps$x - xy_rand$x)^2 + (opt_grid_traps$y - xy_rand$y)^2
opt_grid_traps <- opt_grid_traps %>% filter(rank(dist2pt, ties.method = "random") <= nT) %>% mutate(trap_id = 1)
n_opt_grid <- nrow(opt_grid_traps)
}
opt_grid_traps_all <- rbind(opt_grid_traps_all, cbind(nT = nT, lambda0 = lam, sigma = sigma, buffer = buffer, dt = dt, opt_grid_traps))
}
# Fig 1 m-o: vary sigma (buffer is always 4 * sigma)
for(s in c(0.5*sigma, 1.5*sigma, 2*sigma)){
buffer = 4 * s
##########################
### Regular 2 sigma grid
##########################
# hacky way to make a polygon just bigger than boundary of mask points
# used later to decide which randomly generated detectors are on the mask and so allowed
sap_1 <- mask_df %>% st_as_sf(coords = c("x", "y")) %>% st_buffer(dist = cellsize, endCapStyle = "SQUARE") %>% st_union()
sap_1 <- sap_1 %>% st_buffer(dist = -cellsize * 0.4, endCapStyle = "SQUARE")
# 60 detectors only fit on if sigma < 3000, so reduce sigma if necessary
sm <- min(s, 3000)
# place a grid over the area, with cells X sigma apart
my_grid <- st_make_grid(sap_1, cellsize = c(2 * sm, 2 * sm), what = "centers") %>%
st_intersection(sap_1)
grid_traps_full <- st_coordinates(my_grid) %>% as.data.frame() %>% rename(x = X, y = Y)
# choose a subset of nT of these, starting from a random trap and then choosing nT nearest neighbours
all_grid_traps <- list()
grid_traps <- grid_traps_full
set.seed(700)
xy_rand <- grid_traps[sample(1:nrow(grid_traps), 1), ]
grid_traps$dist2pt <- (grid_traps$x - xy_rand$x)^2 + (grid_traps$y - xy_rand$y)^2
grid_traps <- grid_traps %>% filter(rank(dist2pt, ties.method = "random") <= nT) %>% mutate(trap_id = 1)
grid_traps_all <- rbind(grid_traps_all, cbind(nT = nT, lambda0 = lambda0, sigma = s, buffer = buffer, dt = dt, grid_traps))
###############
### regular grid with optimal spacing
###############
grid_traps <- read.traps(data = grid_traps, detector = dt)
# compute optimal spacing for previous grid
dd <- optimalSpacing(D = D, traps = grid_traps, detectpar = list(lambda0 = lambda0, sigma = s), noccasions = 1)$rotRSE$optimum.spacing
# sometimes optimal spacing is too big to fit desired number of traps in; if so, reduce dd until it is
n_opt_grid <- 0
red_dd <- 0.9
while(n_opt_grid < nT){
dd <- dd * red_dd
# place a grid over the area, with cells optimally spaced
my_grid <- st_make_grid(sap_1, cellsize = c(dd, dd), what = "centers") %>% st_intersection(sap_1)
opt_grid_traps_full <- st_coordinates(my_grid) %>% as.data.frame() %>% rename(x = X, y = Y)
# choose a subset of nT of these points, starting from a random trap and then choosing nT nearest neighbours
opt_grid_traps <- opt_grid_traps_full
set.seed(700)
xy_rand <- opt_grid_traps[sample(1:nrow(opt_grid_traps), 1), ]
opt_grid_traps$dist2pt <- (opt_grid_traps$x - xy_rand$x)^2 + (opt_grid_traps$y - xy_rand$y)^2
opt_grid_traps <- opt_grid_traps %>% filter(rank(dist2pt, ties.method = "random") <= nT) %>% mutate(trap_id = 1)
n_opt_grid <- nrow(opt_grid_traps)
}
opt_grid_traps_all <- rbind(opt_grid_traps_all, cbind(nT = nT, lambda0 = lambda0, sigma = s, buffer = buffer, dt = dt, opt_grid_traps))
}
# Fig 1 p-r: other kinds of detectors
# note: these use different values for sigma, lambda0 to show differences between designs more clearly
for(d in c("multi", "proximity", "count")){
##########################
### Regular 2 sigma grid
##########################
# hacky way to make a polygon just bigger than boundary of mask points
# used later to decide which randomly generated detectors are on the mask and so allowed
sap_1 <- mask_df %>% st_as_sf(coords = c("x", "y")) %>% st_buffer(dist = cellsize, endCapStyle = "SQUARE") %>% st_union()
sap_1 <- sap_1 %>% st_buffer(dist = -cellsize * 0.4, endCapStyle = "SQUARE")
# place a grid over the area, with cells X sigma apart
my_grid <- st_make_grid(sap_1, cellsize = c(2 * sigma, 2 * sigma), what = "centers") %>%
st_intersection(sap_1)
grid_traps_full <- st_coordinates(my_grid) %>% as.data.frame() %>% rename(x = X, y = Y)
# choose a subset of nT of these, starting from a random trap and then choosing nT nearest neighbours
all_grid_traps <- list()
grid_traps <- grid_traps_full
set.seed(700)
xy_rand <- grid_traps[sample(1:nrow(grid_traps), 1), ]
grid_traps$dist2pt <- (grid_traps$x - xy_rand$x)^2 + (grid_traps$y - xy_rand$y)^2
grid_traps <- grid_traps %>% filter(rank(dist2pt, ties.method = "random") <= n) %>% mutate(trap_id = 1)
grid_traps_all <- rbind(grid_traps_all, cbind(nT = nT, lambda0 = lambda0, sigma = sigma, buffer = buffer, dt = d, grid_traps))
###############
### regular grid with optimal spacing
###############
grid_traps <- read.traps(data = grid_traps, detector = d)
# compute optimal spacing for previous grid
dd <- optimalSpacing(D = D, traps = grid_traps, detectpar = list(lambda0 = lambda0/5, sigma = sigma), noccasions = 5)$rotRSE$optimum.spacing
# sometimes optimal spacing is too big to fit desired number of traps in; if so, reduce dd until it is
n_opt_grid <- 0
red_dd <- 0.9
while(n_opt_grid < nT){
dd <- dd * red_dd
# place a grid over the area, with cells optimally spaced
my_grid <- st_make_grid(sap_1, cellsize = c(dd, dd), what = "centers") %>% st_intersection(sap_1)
opt_grid_traps_full <- st_coordinates(my_grid) %>% as.data.frame() %>% rename(x = X, y = Y)
# choose a subset of nT of these points, starting from a random trap and then choosing nT nearest neighbours
opt_grid_traps <- opt_grid_traps_full
set.seed(700)
xy_rand <- opt_grid_traps[sample(1:nrow(opt_grid_traps), 1), ]
opt_grid_traps$dist2pt <- (opt_grid_traps$x - xy_rand$x)^2 + (opt_grid_traps$y - xy_rand$y)^2
opt_grid_traps <- opt_grid_traps %>% filter(rank(dist2pt, ties.method = "random") <= nT) %>% mutate(trap_id = 1)
n_opt_grid <- nrow(opt_grid_traps)
}
opt_grid_traps_all <- rbind(opt_grid_traps_all, cbind(nT = nT, lambda0 = lambda0, sigma = sigma, buffer = buffer, dt = d, opt_grid_traps))
}
save(mask_df, grid_traps_all, opt_grid_traps_all, file = "output/Tost_examples_nonopt_D0_new.Rdata")