“…x min = 0.5, x max = 0.5+P, y min = 0, y max = 2, z min = H, z max = 0.5+H Target point grid 1 x min = 0.5001, x max = 0.5+P, y min = 0, y max = 1, z min = z max = H-0.0001 Target point grid 2 x min = 0.5001, x max = 0.5001, y min = 0, y max = 1, z min = 0, z max = H-0.0001 Alternatively, the Branching Algorithm (Dennis et al, 2022) can be used to identify unique inputs from initial conditions and the problem domain.…”