Methods, apparatuses and computer program products for operating a modular superstructure
Methods, apparatuses and computer program products for movement of rectangular prisms in a multi-dimensional space are provided.
1. A computer-implemented method for operating a modular superstructure, the computer-implemented method comprising:
identifying rack arrangement data comprising a cell velocity grid associated with a plurality of racks in the modular superstructure;
generating a travel time grid corresponding to the plurality of racks based at least in part on a starting position, an ending position, and the rack arrangement data;
generating a gradient grid corresponding to the plurality of racks by applying at least one filter to the travel time grid;
generating pathing data for traversing a rectangular prism from the starting position to the ending position in the modular superstructure based at least in part on applying a gradient descent algorithm to the gradient grid; and
causing the rectangular prism to traverse based at least in part on the pathing data.
2. The computer-implemented method of claim 1 , wherein the cell velocity grid comprises a plurality of cell velocities each assigned to a corresponding rack location based at least in part on a rack status associated with the corresponding rack location.
3. The computer-implemented method of claim 2 , wherein each of the plurality of cell velocities represents a resistance value associated with traversing the rectangular prism at the corresponding rack location.
4. The computer-implemented method of claim 2 , wherein the plurality of cell velocities comprises:
a first cell velocity assigned to a first rack location associated with an obstructed status; and
a second cell velocity assigned to a second rack location associated with an open status.
5. The computer-implemented method of claim 1 , further comprising:
identifying at least one obstructed rack location from the pathing data;
generating clearing move data based at least in part on the at least one obstructed rack location; and
causing the rectangular prism to traverse based at least in part on the pathing data and the clearing move data.
6. The computer-implemented method of claim 1 , wherein generating the travel time grid comprises applying a fast-marching method to the cell velocity grid.
7. The computer-implemented method of claim 1 , wherein generating the gradient grid comprises applying a Sobel filter to the travel time grid.
8. An apparatus for operating a modular superstructure, the apparatus comprising at least one processor and at least one non-transitory memory comprising program code, the at least one non-transitory memory and the program code configured to, with the at least one processor, cause the apparatus to at least:
identify rack arrangement data comprising a cell velocity grid associated with the plurality of racks in the modular superstructure;
generate a travel time grid corresponding to the plurality of racks based at least in part on a starting position, an ending position, and the rack arrangement data;
generate a gradient grid corresponding to the plurality of racks by applying at least one filter to the travel time grid;
generate pathing data for traversing a rectangular prism from the starting position to the ending position in the modular superstructure based at least in part on applying a gradient descent algorithm to the gradient grid; and
cause the rectangular prism to traverse based at least in part on the pathing data.
9. The apparatus of claim 8 , wherein the cell velocity grid comprises a plurality of cell velocities each assigned to a corresponding rack location based at least in part on a rack status associated with the corresponding rack location.
10. The apparatus of claim 9 , wherein each of the plurality of cell velocities represents a resistance value associated with traversing the rectangular prism at the corresponding rack location.
11. The apparatus of claim 9 , wherein the plurality of cell velocities comprises:
a first cell velocity assigned to a first rack location associated with an obstructed status; and
a second cell velocity assigned to a second rack location associated with an open status.
12. The apparatus of claim 8 , wherein the at least one non-transitory memory and the program code are configured to, with the at least one processor, cause the apparatus to:
identify at least one obstructed rack location from the pathing data;
generate clearing move data based at least in part on the at least one obstructed rack location; and
cause the rectangular prism to traverse based at least in part on the pathing data and the clearing move data.
13. The apparatus of claim 8 , wherein, when generating the travel time grid, the at least one non-transitory memory and the program code are configured to, with the at least one processor, cause the apparatus to apply a fast-marching method to the cell velocity grid.
14. The apparatus of claim 8 , wherein, when generating the gradient grid, the at least one non-transitory memory and the program code are configured to, with the at least one processor, cause the apparatus to apply a Sobel filter to the travel time grid.
15. A computer program product for operating a modular superstructure, the computer program product comprising at least one non-transitory computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising an executable portion configured to:
identify rack arrangement data comprising a cell velocity grid associated with the plurality of racks in the modular superstructure;
generate a travel time grid corresponding to the plurality of racks based at least in part on a starting position, an ending position, and the rack arrangement data;
generate a gradient grid corresponding to the plurality of racks by applying at least one filter to the travel time grid;
generate pathing data for traversing a rectangular prism from the starting position to the ending position in the modular superstructure based at least in part on applying a gradient descent algorithm to the gradient grid; and
cause the rectangular prism to traverse based at least in part on the pathing data.
16. The computer program product of claim 15 , wherein the cell velocity grid comprises a plurality of cell velocities each assigned to a corresponding rack location based at least in part on a rack status associated with the corresponding rack location.
17. The computer program product of claim 16 , wherein each of the plurality of cell velocities represents a resistance value associated with traversing the rectangular prism at the corresponding rack location.
18. The computer program product of claim 16 , wherein the plurality of cell velocities comprises:
a first cell velocity assigned to a first rack location associated with an obstructed status; and
a second cell velocity assigned to a second rack location associated with an open status.
19. The computer program product of claim 15 , wherein the computer-readable program code portions comprise the executable portion configured to:
identify at least one obstructed rack location from the pathing data;
generate clearing move data based at least in part on the at least one obstructed rack location; and
cause the rectangular prism to traverse based at least in part on the pathing data and the clearing move data.
20. The computer program product of claim 15 , wherein, when generating the travel time grid, the computer-readable program code portions comprise the executable portion configured to apply a fast-marching method to the cell velocity grid.