# US 12,006,151 B2 · Dynamic cart optimization system > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,006,151 B2 - Document ID: US12006151B2 - Status: Granted - Kind: B2 - Application number: 17/939,755 - Filed: 2022-09-07 - Published: 2023-01-05 - Granted: 2024-06-11 - Earliest claimed: 2019-08-02 - Assignees: Packsize LLC - Applicants: Packsize, LLC - Inventors: Jeffrey L. Rasmussen; Eric Branch Bulloch; Kevin Bradon Maughan; Andreas Harnesk; Rodney Gallaway - Web page: https://patentgrep.com/patent/US12006151B2 ## CPC - B65G 1/1371: {with data records} - B65G 1/1373: {for fulfilling orders in warehouses} - G06Q 10/04: Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" (market predictions or forecasting for commercial activities G06Q30/0202) - G06Q 10/087: Inventory or stock management, e.g. order filling, procurement or balancing against orders - G06Q 10/08724: {by shelf level inventory management, e.g. planograms} - G06Q 10/08743: {using optimisation of routes} - B65G: TRANSPORT OR STORAGE DEVICES, e.g. CONVEYORS FOR LOADING OR TIPPING, SHOP CONVEYOR SYSTEMS OR PNEUMATIC TUBE CONVEYORS (packaging B65B; handling thin or filamentary materials, e.g. paper sheets or thread, B65H; cranes B66C; portable mobile or lifting or hauling appliances, e.g. hoists, B66D; devices for lifting or lowering goods for loading or unloading purposes, e.g. fork-lift trucks, B66F9/00; emptying bottles, jars, casks, barrels or similar containers, not otherwise provided for, B67C9/00; delivering or transferring liquids B67D; filling or discharging vessels for liquefied, solidified or compressed gases F17C; pipe-line systems for fluids F17D) - G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR ## Abstract A computer system for optimizing node and edge selections within a digital graph model accesses a digital graph model of a physical warehouse location. The digital graph model comprises information indicating a location of multiple specific items of inventory among shelves in the physical warehouse location. The computer system identifies a set of orders that each comprise one or more items and an order priority. The computer system then maps each item in each order selected from the set or orders to the multiple nodes within the digital graph model. The computer system identifies a ranking node from the multiple nodes. The computer system then traverses one or more edges that extend from the ranking node to identify a shortest path within the digital graph model to fill a digital model of a picking cart above a packing threshold level. ## Claims ### Claim 1 A computer system for optimizing paths within a digital model, comprising: one or more processors; and one or more computer-readable media having stored thereon executable instructions that when executed by the one or more processors configure the computer system to perform at least the following: access a digital model of a physical warehouse location, wherein: the digital model comprises information indicating a location of multiple specific items of inventory among shelves in the physical warehouse location; identify a set of orders, wherein each order within the set of orders comprises one or more items; map each item in each order selected from the set of orders to a location within the digital model of the physical warehouse location; identify a ranking location within the digital model, wherein the ranking location comprises a location with a highest number of mapped items; and identify a shortest path to the ranking location within the digital model to fill a digital model of a picking cart above a packing threshold level. ### Claim 2 (depends on 1) The computer system as recited in claim 1, wherein the executable instructions include instructions that are executable to configure the computer system to: generate a pick request based upon the shortest path, wherein the pick request comprises one or more orders selected from the set of orders that are located along the shortest path. ### Claim 3 (depends on 2) The computer system as recited in claim 2, wherein the executable instructions include instructions that are executable to configure the computer system to: display, on a user interface, one or more visual directions for a user to travel within the physical warehouse location to complete the pick request. ### Claim 4 (depends on 2) The computer system as recited in claim 2, wherein the executable instructions include instructions that are executable to configure the computer system to: generate one or more computer instructions for communication to an automated picking device, wherein the one or more computer instructions cause the automated picking device to travel along the shortest path. ### Claim 5 (depends on 2) The computer system as recited in claim 2, wherein identifying the shortest path within the digital model comprises: accessing the ranking location within the digital model; identifying a subset of orders within the one or more orders that are each associated with at least one item located at the ranking location; identify a set of associated locations that are associated with items from the subset of orders; identify one or more paths from the ranking location to one or more associated locations of the ranking location; at the one or more associated locations, identifying additional items associated with orders within the subset of orders; identifying one or more completed orders by continuing to identify paths from the ranking location to each of the one or more associated locations until the one or more completed orders are completely accounted for among the set of associated locations; and generating the pick request when the digital model of the picking cart is determined to be filled above the packing threshold level with completed orders. ### Claim 6 (depends on 5) The computer system as recited in claim 5, wherein determining that the digital model of the picking cart is filled above the packing threshold level with the one or more completed orders comprises: applying a cubing algorithm to the one or more completed orders; and determining based upon results of the cubing algorithm that the digital model of the picking cart is filled above the packing threshold level. ### Claim 7 (depends on 5) The computer system as recited in claim 5, wherein generating the pick request comprises: including, within the pick request, a particular order that is associated with a particular order priority that exceeds a priority threshold, wherein the particular order does not fall along the shortest path. ### Claim 8 (depends on 5) The computer system as recited in claim 5, wherein the packing threshold level comprises a weight. ### Claim 9 (depends on 5) The computer system as recited in claim 5, wherein the packing threshold level comprises a volume utilization. ### Claim 10 A computer-implemented method for optimizing paths within a digital model, the computer-implemented method performed at a computer system comprising one or more processors and computer-readable media, the computer-implemented method comprising: accessing a digital model of a physical warehouse location, wherein: the digital model comprises information indicating a location of multiple specific items of inventory among shelves in the physical warehouse location; identifying a set of orders, wherein each order within the set of orders comprises one or more items; mapping each item in each order selected from the set of orders to a location within the digital model of the physical warehouse location; identifying a ranking location within the digital model, wherein the ranking location comprises a location with a highest number of mapped items; and identifying a shortest path to the ranking location within the digital model to fill a digital model of a picking cart above a packing threshold level. ### Claim 11 (depends on 10) The computer-implemented method as recited in claim 10, further comprising: generating a pick request based upon the shortest path, wherein the pick request comprises one or more orders selected from the set of orders that are located along the shortest path. ### Claim 12 (depends on 11) The computer-implemented method as recited in claim 11, further comprising: displaying, on a user interface, one or more visual directions for a user to travel within the physical warehouse location to complete the pick request. ### Claim 13 (depends on 11) The computer-implemented method as recited in claim 11, further comprising: generating one or more computer instructions for communication to an automated picking device, wherein the one or more computer instructions cause the automated picking device to travel along the shortest path. ### Claim 14 (depends on 11) The computer-implemented method as recited in claim 11, wherein identifying the shortest path within the digital model comprises: accessing the ranking location within the digital model; identifying a subset of orders within the one or more orders that are each associated with at least one item located at the ranking location; identify a set of associated locations that are associated with items from the subset of orders; identify one or more paths from the ranking location to one or more associated locations of the ranking location; at the one or more associated locations, identifying additional items associated with orders within the subset of orders; identifying one or more completed orders by continuing to identify paths from the ranking location to each of the one or more associated locations until the one or more completed orders are completely accounted for among the set of associated locations; and generating the pick request when the digital model of the picking cart is determined to be filled above the packing threshold level with completed orders. ### Claim 15 (depends on 14) The computer-implemented method as recited in claim 14, wherein determining that the digital model of the picking cart is filled above the packing threshold level with completed ordered comprises: applying a cubing algorithm to the one or more completed orders; and determining based upon results of the cubing algorithm that the digital model of the picking cart is filled above the packing threshold level. ### Claim 16 (depends on 14) The computer-implemented method as recited in claim 14, wherein generating the pick request comprises: including, within the pick request, a particular order that is associated with a particular order priority that exceeds a priority threshold, wherein the particular order does not fall along the shortest path. ### Claim 17 (depends on 14) The computer-implemented method as recited in claim 14, wherein the packing threshold level comprises a weight. ### Claim 18 (depends on 14) The computer-implemented method as recited in claim 14, wherein the packing threshold level comprises a volume utilization. ### Claim 19 A computer-readable media comprising one or more physical computer-readable storage media having stored thereon computer-executable instructions that, when executed at a processor, cause a computer system to perform a method of optimizing paths within a digital model, the method comprising: accessing a digital model of a physical warehouse location, wherein: the digital model comprises information indicating a location of multiple specific items of inventory among shelves in the physical warehouse location; identifying a set of orders, wherein each order within the set of orders comprises one or more items; mapping each item in each order selected from the set of orders to a location within the digital model; identifying a ranking location within the digital model, wherein the ranking location comprises a location with a highest number of mapped items; and identifying a shortest path to the ranking location within the digital model to fill a digital model of a picking cart above a packing threshold level. ### Claim 20 (depends on 19) The computer-readable media as recited in claim 19, wherein identifying the shortest path within the digital model comprises: accessing the ranking location within the digital model; identifying a subset of orders within one or more orders that are each associated with at least one item located at the ranking location; identify a set of associated nodes that are associated with items from the subset of orders; traversing each edge extending from the ranking node to one or more associated nodes of the ranking node; at the one or more associated nodes, identifying additional items associated with orders within the subset of orders; identifying one or more completed orders by continuing to traverse each edge extending from the ranking node to each of the one or more associated nodes until the one or more completed orders are completely accounted for among the set of associated nodes; and generating a pick request when the digital model of the picking cart is determined to be filled above the packing threshold level with completed orders.