Method, apparatus and computer program for designing a corridor

1. A method for designing a corridor for conserving a wildlife habitat or building a road or a pipeline in a target area, so as to minimize an environmental, economic, behavioral or any other cost caused by implementing the corridor, the method comprising:

obtaining a grid of cells representing the target area, with each cell having associated a value corresponding to a cost impact triggered by including the cell in the corridor;

generating an optimized arrangement of cells to reduce variation of translation width with a translation direction through the grid;

calculating translation costs caused by straight-line translations of the optimized arrangement of cells through the grid, wherein each of the translation costs is determined using locations and values of cells swept during a respective one of the straight-line translation; and

designing the corridor as a subset of the straight-line translations sequenced to connect a start zone of cells in the grid to an end zone of cells in the grid, so as to have a lowest sum of translation costs for the subset, wherein the corridor is a reunion of cells swept along translations in the subset.

2. The method of claim 1 , wherein the grid of cells is made of two-dimensional square cells and the optimized arrangement covers cells of an equal number, w, of rows and columns, and has a number, d, of diagonal rows of cells removed from every corner, wherein 2d<w.

3. The method of claim 1 , wherein the grid is made of three-dimensional cubic cells and the optimized arrangement covers cells of an equal number, w, of rows, columns and layers, and has a number, d, of diagonal layers of cells removed from every edge, wherein 2d<w.

4. The method of claim 1 , further comprising:

selecting a start neighborhood in the start zone and/or selecting an end neighborhood in the end zone, the start neighborhood and the end neighborhood being made of cells having the optimized arrangement, wherein

a first translation of the subset starts from the start neighborhood and a last translation of the subset ends at the end neighborhood, and

the start neighborhood and the end neighborhood are selected according to at least one of a topologic, geometric or geographic criterion.

5. The method of claim 1 , further comprising:

redefining the start zone and/or the end zone; and

redesigning the corridor as an updated subset of the straight-line translations sequenced to connect the start zone to the end zone, so as to have an updated lowest sum of translation costs.

6. The method of claim 1 , wherein the designing includes:

building a graph wherein

each node of the graph represents a neighborhood in the grid having the optimized arrangement, and

an edge from any first node to any second node indicates that a second neighborhood represented by the second node is a straight-line translation of a first neighborhood represented by the first node, the edge being associated with a translation cost of the respective straight-line translation, and

identifying a lowest edge values sum between nodes in the start zone and nodes in the end zone.

7. The method of claim 1 , wherein the designing includes

generating a map representing lowest sums of translation costs from the start zone to possible grid locations of a neighborhood having the optimized arrangement.

8. The method of claim 1 , further comprising:

displaying at least a part of the grid of cells including the designed corridor; and/or

displaying information characterizing the corridor.

9. The method of claim 1 , further comprising:

receiving input for modifying at least one value of a cell in the grid of cells, and/or for updating the optimized arrangement;

re-calculating the translation costs; and

redesigning the corridor as a new subset of the straight-line translations sequenced to connect the start zone to the end zone, so as to have a new lowest sum of translation costs for the new subset.

10. The method of claim 1 , wherein the designing of the corridor is performed to comply with at least one design constraint.

11. The method of claim 1 , wherein the corridor is then optimized to meet at least one additional objective and/or comply with at least one additional constraint.

12. An apparatus for designing a corridor for conserving a wildlife habitat or building a road or a pipeline in a target area so that to trigger a minimal environmental, economic, behavioral or any other cost, the apparatus comprising:

an interface configured to exchange data and/or commands related to the designing of the corridor;

one or more processors connected to the interface and configured

to obtain a grid of cells representing the target area, with each cell having associated a value corresponding to a cost impact triggered by including the cell in the corridor,

to generate an optimized arrangement of cells to reduce variation of translation width with a translation direction through the grid,

to calculate translation costs caused by straight-line translations of the optimized arrangement of cells through the grid, wherein each of the translation costs is determined using locations and values of cells swept during a respective one of the straight-line translation, and

to design the corridor as a subset of the straight-line translations sequenced to connect a start zone of cells in the grid to an end zone of cells in the grid, so as to have a lowest sum of translation costs for the subset, wherein the corridor is a reunion of cells swept along translations in the subset; and

a display configured to display at least a part of the grid of cells including the designed corridor, and/or to display information characterizing the corridor.

13. The apparatus of claim 12 , wherein the grid of cells is a made of two-dimensional square cells and the optimized arrangement covers cells of an equal number, w, of rows and columns, and has a number, d, of diagonal rows of cells removed from every corner, wherein 2d<w.

14. The apparatus of claim 12 , wherein the one or more processors and the interface are further configured to enable selecting a start neighborhood in the start zone and/or selecting an end neighborhood in the end zone, the start neighborhood and the end neighborhood being made of cells having the optimized arrangement,

wherein

a first translation of the subset starts from the start neighborhood and a last translation of the subset ends at the end neighborhood, and

the start neighborhood and the end neighborhood are selected according to at least one of a topologic, geometric or geographic criterion.

15. The apparatus of claim 12 , wherein the one or more processors and the interface are further configured to enable at least one of redefining the start zone or the end zone, updating the optimized arrangement, and modifying at least one value of a cell in the grid of cells, wherein the translation costs are then re-calculated and the corridor is redesigned.

16. The apparatus of claim 12 , wherein the one or more processors and the interface are further configured to enable optimizing the corridor to meet at least one additional objective and/or comply with at least one additional constraint.

17. The apparatus of claim 12 , wherein the one or more processors are configured to generate a graph or a map for designing the corridor,

wherein each node of the graph represents a neighborhood in the grid having the optimized arrangement, and an edge from any first node to any second node indicates that a second neighborhood represented by the second node is a straight-line translation of a first neighborhood represented by the first node, the edge being associated with a translation cost of the respective straight-line translation, the corridor being identified based on a lowest edge values sum between nodes in the start zone and nodes in the end zone, and

the map representing lowest sums of translation costs from the start zone to possible grid locations of a neighborhood having the optimized arrangement.

18. A non-transitory computer-readable recording medium storing executable codes which when executed by a computer make the computer perform a method for designing a corridor for conserving a wildlife habitat or building a road or a pipeline in a target area, so as to minimize an environmental, economic, behavioral or any other cost caused by implementing the corridor, the method comprising:

obtaining a grid of cells representing the target area, with each cell having associated a value corresponding to a cost impact triggered by including the cell in the corridor;

generating an optimized arrangement of cells to reduce variation of a translation width with a translation direction through the grid;

calculating translation costs caused by straight-line translations of the optimized arrangement of cells through the grid, wherein each of the translation costs is determined using locations and values of cells swept during a respective one of the straight-line translation; and

designing the corridor as a subset of the straight-line translations sequenced to connect a start zone of cells in the grid to an end zone of cells in the grid, so as to have a lowest sum of translation costs for the subset, wherein the corridor is a reunion of cells swept along translations in the subset.