Methods, apparatuses and computer program products for dynamically generating a tote plan for movement of rectangular prisms through a multi-dimensional space
Methods, apparatuses and computer program products for movement of rectangular prisms in a multi-dimensional space are provided.
1. A computer-implemented method for generating a tote plan comprising:
determining a closest perpendicular peer smart rack to a current smart rack having a target rectangular prism;
dynamically generating movement instructions related to the current smart rack having the target rectangular prism in the tote plan to cause the target rectangular prism in the current smart rack to be moved to the closest perpendicular peer smart rack in an instance in which the closest perpendicular peer smart rack has state information that is set to open; and
dynamically generating one or more other movement instructions in the tote plan in an instance in which the closest perpendicular peer smart rack has state information that is set to occupied, wherein generating the one or more other movement instructions in the tote plan in the instance in which the closest perpendicular peer smart rack has the state information that is set to occupied further comprises:
determining whether at least one peer smart rack other than the closest perpendicular peer smart rack and positioned adjacent to the closest perpendicular peer smart rack has state information set to open; and
causing a rectangular prism occupying the closest perpendicular peer smart rack to be moved to a peer smart rack of the at least one peer smart rack other than the closest perpendicular peer smart rack that has the state information set to open.
2. The computer-implemented method of claim 1 , further comprising identifying the target rectangular prism, the current smart rack, and an egress point of a modular superstructure.
3. The computer-implemented method of claim 2 , wherein determining the closest perpendicular peer smart rack comprises determining a perpendicular smart rack that is perpendicular to the current smart rack and closest to the egress point.
4. The computer-implemented method of claim 1 , further comprising determining state information for one or more peer smart racks positioned adjacent to the current smart rack, wherein the state information comprises at least one of open or occupied.
5. The computer-implemented method of claim 1 , further comprising:
updating a location of the target rectangular prism; and
setting the closest perpendicular peer smart rack as the current smart rack in an instance in which the target rectangular prism is moved to the closest perpendicular peer smart rack.
6. The computer-implemented method of claim 1 , wherein generating the one or more other movement instructions in the tote plan in the instance in which the closest perpendicular peer smart rack has the state information that is set to occupied further comprises:
determining whether at least one peer smart rack at a distance n has state information set to open; and
determining one or more movements to position the target rectangular prism in the at least one peer smart rack at the distance n has the state information set to open closer to the current smart rack.
7. An apparatus for generating a tote plan, 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:
determine a closest perpendicular peer smart rack to a current smart rack having a target rectangular prism;
dynamically generate movement instructions related to the current smart rack having the target rectangular prism in the tote plan to cause the target rectangular prism in the current smart rack to be moved to the closest perpendicular peer smart rack in an instance in which the closest perpendicular peer smart rack has state information that is set to open; and
dynamically generate one or more other movement instructions in the tote plan in an instance in which the closest perpendicular peer smart rack has state information that is set to occupied, wherein, when generating the one or more other movement instructions in the tote plan in the instance in which the closest perpendicular peer smart rack has the state information that is set to occupied, the at least one non-transitory memory and the program code are configured to, with the at least one processor, cause the apparatus to:
determine whether at least one peer smart rack other than the closest perpendicular peer smart rack and positioned adjacent to the closest perpendicular peer smart rack has state information set to open; and
cause a rectangular prism occupying the closest perpendicular peer smart rack to be moved to a peer smart rack of the at least one peer smart rack other than the closest perpendicular peer smart rack that has the state information set to open.
8. The apparatus of claim 7 , 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 the target rectangular prism, the current smart rack, and an egress point of a modular superstructure.
9. The apparatus of claim 8 , wherein, when determining the closest perpendicular peer smart rack, the at least one non-transitory memory and the program code are configured to, with the at least one processor, cause the apparatus to determine a perpendicular smart rack that is perpendicular to the current smart rack and closest to the egress point.
10. The apparatus of claim 7 , 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 determine state information for one or more peer smart racks positioned adjacent to the current smart rack, wherein the state information comprises at least one of open or occupied.
11. The apparatus of claim 7 , 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:
update a location of the target rectangular prism; and
set the closest perpendicular peer smart rack as the current smart rack in an instance in which the target rectangular prism is moved to the closest perpendicular peer smart rack.
12. The apparatus of claim 7 , wherein, when generating the one or more other movement instructions in the tote plan in the instance in which the closest perpendicular peer smart rack has the state information that is set to occupied, the at least one non-transitory memory and the program code are configured to, with the at least one processor, cause the apparatus to:
determine whether at least one peer smart rack at a distance n has state information set to open; and
determine one or more movements to position the target rectangular prism in the at least one peer smart rack at the distance n has the state information set to open closer to the current smart rack.
13. A computer program product for generating a tote plan, 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:
determine a closest perpendicular peer smart rack to a current smart rack having a target rectangular prism;
dynamically generate movement instructions related to the current smart rack having the target rectangular prism in the tote plan to cause the target rectangular prism in the current smart rack to be moved to the closest perpendicular peer smart rack in an instance in which the closest perpendicular peer smart rack has state information that is set to open; and
dynamically generate one or more other movement instructions in the tote plan in an instance in which the closest perpendicular peer smart rack has state information that is set to occupied, wherein, when generating the one or more other movement instructions in the tote plan in the instance in which the closest perpendicular peer smart rack has the state information that is set to occupied, the computer-readable program code portions comprise the executable portion configured to:
determine whether at least one peer smart rack other than the closest perpendicular peer smart rack and positioned adjacent to the closest perpendicular peer smart rack has state information set to open; and
cause a rectangular prism occupying the closest perpendicular peer smart rack to be moved to a peer smart rack of the at least one peer smart rack other than the closest perpendicular peer smart rack that has the state information set to open.
14. The computer program product of claim 13 , wherein the computer-readable program code portions comprise the executable portion configured to identify the target rectangular prism, the current smart rack, and an egress point of a modular superstructure.
15. The computer program product of claim 14 , wherein, when determining the closest perpendicular peer smart rack, the computer-readable program code portions comprise the executable portion configured to determine a perpendicular smart rack that is perpendicular to the current smart rack and closest to the egress point.
16. The computer program product of claim 13 , wherein the computer-readable program code portions comprise the executable portion configured to determine state information for one or more peer smart racks positioned adjacent to the current smart rack, wherein the state information comprises at least one of open or occupied.
17. The computer program product of claim 13 , wherein the computer-readable program code portions comprise the executable portion configured to:
update a location of the target rectangular prism; and
set the closest perpendicular peer smart rack as the current smart rack in an instance in which the target rectangular prism is moved to the closest perpendicular peer smart rack.