Methods, apparatuses and computer program products for transporting rectangular prisms in 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 transporting a rectangular prism through a modular superstructure comprising a plurality of racks, the computer-implemented method comprising:
generating a data graph matrix representation that is associated with the modular superstructure and comprises a plurality of nodes connected by a plurality of edges, the plurality of nodes corresponding to the plurality of racks;
receiving a query comprising one or more query attributes and representing a request to transport the rectangular prism from a starting position to an ending position;
computing a retrieval priority associated with the query based on the one or more query attributes, wherein the one or more query attributes comprise at least one of a requesting party or a requested retrieval time, and wherein the retrieval priority identifies a priority of the query relative to a plurality of queued queries;
determining a length of queued time for the query in query list, wherein the query list includes an ordered list of the plurality of queries based on at least the retrieval priority;
modifying an ordering of the plurality of queries in the query list based on the length of queued time associated with the query such that a lower priority query in the query list is prioritized over a higher priority query after a threshold time period; and
executing, via a controller, a movement path by transmitting control signal to at least one actuator associated with the modular superstructure, wherein the at least one actuator is configured to move the rectangular prism, using a lead screw actuator and a linear motor, along the movement path based on the retrieval priority.
2 . The computer-implemented method of claim 1 further comprising:
computing the movement path for transporting the rectangular prism utilizing the data graph matrix representation, wherein the movement path comprises a set of rack operations for transporting the rectangular prism.
3 . The computer-implemented method of claim 1 , further comprising:
generating at least one movement instruction for initiating a rack operation for transporting the rectangular prism based on the retrieval priority, wherein the at least one movement instruction is indicative of a movement of the rectangular prism from a current node to a peer node within the modular superstructure, wherein execution of the at least one movement instruction is based on a comparison between (i) an operation priority of the at least one movement instruction and (ii) an ancillary operation priority associated with the peer node.
4 . The computer-implemented method of claim 3 , wherein generating the at least one movement instruction comprises:
accessing a query list comprising an ordered list of the plurality of queued queries;
augmenting the query list with the query based on the retrieval priority for the query; and
generating, based on the query list, the at least one movement instruction for initiating the rack operation.
5 . The computer-implemented method of claim 4 further comprising:
accessing operational data indicative of an operational capacity associated with the modular superstructure;
computing a retrieval rate associated with the modular superstructure based on operational data indicative of the operational capacity of the modular superstructure, wherein the retrieval rate is indicative of a number of rectangular prisms transported from a current rack position to an egress point within a time period; and
generating the at least one movement instruction for initiating the rack operation based on the retrieval rate.
6 . The computer-implemented method of claim 1 , wherein the one or more query attributes further comprise a requested item, wherein computing the retrieval priority for the query comprises:
accessing item data that is associated with the requested item and indicative of a shelf life for the requested item; and
computing the retrieval priority for the query based on the shelf life for the requested item.
7 . An apparatus for transporting a rectangular prism through a modular superstructure comprising a plurality of racks, 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:
generate a data graph matrix representation that is associated with the modular superstructure and comprises a plurality of nodes connected by a plurality of edges, the plurality of nodes corresponding to the plurality of racks;
receive a query comprising one or more query attributes and representing a request to transport the rectangular prism from a starting position to an ending position;
compute a retrieval priority associated with the query based on the one or more query attributes, wherein the one or more query attributes comprise at least one of a requesting party or a requested retrieval time, and wherein the retrieval priority identifies a priority of the query relative to a plurality of queued queries;
determine a length of queued time for the query in query list, wherein the query list includes an ordered list of the plurality of queries based on at least the retrieval priority;
modify an ordering of the plurality of queries in the query list based on the length of queued time associated with the query such that a lower priority query in the query list is prioritized over a higher priority query after a threshold time period; and
execute, via a controller, a movement path by transmitting control signal to at least one actuator associated with the modular superstructure, wherein the at least one actuator is configured to move the rectangular prism, using a lead screw actuator and a linear motor, along the movement path based on the retrieval priority.
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:
compute the movement path for transporting the rectangular prism utilizing the data graph matrix representation, wherein the movement path comprises a set of rack operations for transporting the rectangular prism.
9 . 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:
generate at least one movement instruction for initiating a rack operation for transporting the rectangular prism based on the retrieval priority, wherein the at least one movement instruction is indicative of a movement of the rectangular prism from a current node to a peer node within the modular superstructure, wherein execution of the at least one movement instruction is based on a comparison between (i) an operation priority of the at least one movement instruction and (ii) an ancillary operation priority associated with the peer node.
10 . The apparatus of claim 9 , wherein, when generating the at least one movement instruction, the at least one non-transitory memory and the program code are configured to, with the at least one processor, cause the apparatus to:
access a query list comprising an ordered list of the plurality of queued queries;
augment the query list with the query based on the retrieval priority for the query; and
generate, based on the query list, the at least one movement instruction for initiating the rack operation.
11 . The apparatus of claim 10 , 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:
access operational data indicative of an operational capacity associated with the modular superstructure;
compute a retrieval rate associated with the modular superstructure based on operational data indicative of the operational capacity of the modular superstructure, wherein the retrieval rate is indicative of a number of rectangular prisms transported from a current rack position to an egress point within a time period; and
generate the at least one movement instruction for initiating the rack operation based on the retrieval rate.
12 . The apparatus of claim 7 , wherein the one or more query attributes further comprise a requested item, wherein, when computing the retrieval priority for the query, the at least one non-transitory memory and the program code are configured to, with the at least one processor, cause the apparatus to:
access item data that is associated with the requested item and indicative of a shelf life for the requested item; and
compute the retrieval priority for the query based on the shelf life for the requested item.
13 . A computer program product for transporting a rectangular prism through a modular superstructure comprising a plurality of racks, 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:
generate a data graph matrix representation that is associated with the modular superstructure and comprises a plurality of nodes connected by a plurality of edges, the plurality of nodes corresponding to the plurality of racks;
receive a query comprising one or more query attributes and representing a request to transport the rectangular prism from a starting position to an ending position;
compute a retrieval priority associated with the query based on the one or more query attributes, wherein the one or more query attributes comprise at least one of a requesting party or a requested retrieval time, and wherein the retrieval priority identifies a priority of the query relative to a plurality of queued queries;
determine a length of queued time for the query in query list, wherein the query list includes an ordered list of the plurality of queries based on at least the retrieval priority;
modify an ordering of the plurality of queries in the query list based on the length of queued time associated with the query such that a lower priority query in the query list is prioritized over a higher priority query after a threshold time period; and
execute, via a controller, a movement path by transmitting control signal to at least one actuator associated with the modular superstructure, wherein the at least one actuator is configured to move the rectangular prism, using a lead screw actuator and a linear motor, along the movement path based on the retrieval priority.
14 . The computer program product of claim 13 , wherein the computer-readable program code portions comprise the executable portion configured to:
compute the movement path for transporting the rectangular prism utilizing the data graph matrix representation, wherein the movement path comprises a set of rack operations for transporting the rectangular prism.
15 . The computer program product of claim 13 , wherein the computer-readable program code portions comprise the executable portion configured to:
generate at least one movement instruction for initiating a rack operation for transporting the rectangular prism based on the retrieval priority, wherein the at least one movement instruction is indicative of a movement of the rectangular prism from a current node to a peer node within the modular superstructure, wherein execution of the at least one movement instruction is based on a comparison between (i) an operation priority of the at least one movement instruction and (ii) an ancillary operation priority associated with the peer node.
16 . The computer program product of claim 15 , wherein, when generating the at least one movement instruction, the computer-readable program code portions comprise the executable portion configured to:
access a query list comprising an ordered list of the plurality of queued queries;
augment the query list with the query based on the retrieval priority for the query; and
generate, based on the query list, the at least one movement instruction for initiating the rack operation.
17 . The computer program product of claim 16 , the computer-readable program code portions comprise the executable portion configured to:
access operational data indicative of an operational capacity associated with the modular superstructure;
compute a retrieval rate associated with the modular superstructure based on operational data indicative of the operational capacity of the modular superstructure, wherein the retrieval rate is indicative of a number of rectangular prisms transported from a current rack position to an egress point within a time period; and
generate the at least one movement instruction for initiating the rack operation based on the retrieval rate.