Solve (5) with the constraint that the agent can convert a maximum of γ obstacles into non-obstacles and pass them. Here γ is an additional input. Order is m, n, η, γ and α.
3 14 13 9 1 2 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 -1 -1 0 0 0 0 -1 -1 0 -1 -1 0 -1 -1 -1 -1 0 0 0 -1 -1 0 -1 -1 0 -1 -1 -1 -1 0 0 0 0 0 0 -1 -1 0 0 0 0 0 0 0 0 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 -1 -1 0 3 0 0 0 0 0 0 0 0 -1 -1 -1 0 0 0 0 0 0 0 0 0 0 -1 -1 -1 0 0 0 0 0 0 0 0 0 0 -1 -1 0 0 0 -1 -1 0 0 0 0 0 4 -1 -1 -1 -1 0 -1 -1 -1 -1 -1 0 0 4 0 0 -1 -1 0 0 0 -1 -1 -1 0 1 0 0 0 -1 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 12 14 12 11 1 2 0 -1 -1 0 0 0 0 0 0 0 0 0 0 -1 -1 0 0 0 0 0 0 0 0 0 0 -1 -1 0 0 0 0 3 0 0 0 0 0 0 2 0 -1 -1 -1 -1 0 0 0 0 0 -1 -1 0 -1 -1 -1 -1 0 0 0 0 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 0 0 0 0 -1 -1 -1 0 0 -1 -1 -1 1 0 0 0 -1 -1 -1 0 0 0 0 0 2 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 -1 -1 -1 0 0 0 4 0 0 0 -1 -1 -1 -1 -1 0 0 0 0 0 0 0 -1 -1 0 0 0 0 0 0 0 0 0 0 -1 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 1 6 12 11 8 1 2 0 -1 -1 -1 0 -1 -1 0 0 0 0 -1 -1 -1 -1 0 -1 -1 0 0 0 0 0 -1 -1 -1 -1 0 0 0 0 -1 0 0 0 0 0 -1 0 0 0 0 0 0 0 -1 -1 -1 -1 0 0 -1 -1 0 0 0 -1 -1 -1 -1 0 0 -1 -1 0 0 0 0 0 0 0 0 0 4 3 0 0 0 0 0 0 -1 -1 0 3 0 0 0 0 0 0 0 -1 -1 0 0 0 -1 0 0 0 0 0 0 0 3 0 0 -1 0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 6 6