IP Library Granted Patent US 12,493,855
Granted Patent B2
US 12,493,855 · App. 18/977,458 · Granted Dec 9, 2025

Validation system for conveyor

Inventors: Daniel James Thyer (Charlotte, NC); Matthew Doucette (Parker, TX); Peter Douglas Jackson (Alpharetta, GA); Robert Lee Martin, Jr. (Lucas, TX); Justin Michael Brown (Coppell, TX); Justin Corless (Flower Mound, TX); Swapna Muthuru (Frisco, TX); Carolina Lopez (Fort Worth, TX)
Assignee: Rehrig Pacific Company
G06Q10/0875
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,493,855
App. No.
18/977,458
Granted
Dec 9, 2025
Kind
B2
Abstract

A pallet loading and validation system provides several features that are particularly beneficial in the context of a conveyor product distribution system, such as a pallet loading system, although some features are not exclusive to a conveyor system. In some aspects, the techniques described herein relate to a method for identifying a SKU of a package using a computer system having at least one processor, the method including: (a) taking at least one image of a package on a conveyor; (b) receiving the at least one image in the computer system; and (c) based upon the at least one image, the computer system determining a SKU associated with the package.

Claims (98)

1 . A method for identifying a SKU of a package using a computer system having at least one processor, wherein the computer system stores a plurality of pick lists, wherein each pick list indicates a quantity of each of a plurality of desired SKUs to be placed on one of a plurality of pallets, wherein the plurality of desired SKUs are each associated with a package of beverage containers, the method including:

a) the computer system identifying an initial location of the package;

b) taking at least one image of a package on a conveyor;

c) receiving the at least one image in the computer system;

d) based upon the at least one image and based upon the initial location, the computer system determining a SKU associated with the package; and

e) comparing the SKU determined in step d) with at least one of the plurality of desired SKUs.

2 . The method of claim 1 wherein step e) includes comparing the SKU determined in step d) with the plurality of desired SKUs on the plurality of pick lists, the method further including:

f) based upon the comparison in step e), directing the package toward one of the plurality of pallets.

3 . The method of claim 1 , the method further including:

f) based upon the comparison in step e), directing the package toward one of the plurality of pallets;

g) instructing a pick of a first SKU of the plurality of desired SKUs of the plurality of pick lists, wherein the plurality of pick lists for the plurality of pallets are a first wave;

h) receiving an instruction to close the first wave without the computer system determining that a package is associated with the first SKU in step d); and

i) adjusting an invoice associated with one of the plurality of pallets based upon step h).

4 . The method of claim 1 , the method further including:

f) based upon the comparison in step e), directing the package toward one of the plurality of pallets;

g) instructing a pick of a first SKU of the plurality of desired SKUs of the plurality of pick lists, wherein the plurality of pick lists for the plurality of pallets are a first wave;

h) after step g), receiving an instruction from a user to skip the pick of the first SKU;

i) after step h), instructing a pick of a second SKU of the plurality of desired SKUs of the plurality of pick lists, wherein the first SKU is different from the second SKU; and

i), instructing the pick of the first SKU.

5 . The method of claim 1 wherein step a) is performed by an imaging system including at least one camera, the method further including:

f) based upon the comparison in step e), directing the package to an area proximate the conveyor upstream of the imaging system.

6 . The method of claim 1 wherein step d) includes the computer system inferring the SKU associated with the package using at least one machine learning model, wherein the computer system includes at least one non-transitory computer-readable media storing the at least one machine learning model, wherein the at least one machine learning model is trained with a plurality of images of packages of beverage containers.

7 . The method of claim 1 wherein the computer system includes at least one non-transitory computer-readable media storing at least one machine learning model, wherein the at least one machine learning model is trained with a plurality of images of packages of beverage containers and wherein the method includes:

f) the computer system inferring the SKU associated with the package using the at least one machine learning model;

g) the computer system analyzing the at least one image using text matching;

h) the computer system analyzing the at least one image using supervised contrastive learning and nearest neighbor methods; and

i) the computer system determining the SKU associated with the package in step d) based upon at least one of step f) or step g) or step h).

8 . The method of claim 7 wherein step g) includes using a decision forest.

9 . A computing system for identifying a SKU of a package of beverage containers comprising:

at least one processor; and

at least one non-transitory computer-readable media storing:

at least one machine learning model that has been trained with a plurality of images of packages of beverage containers; and

instructions that, when executed by the at least one processor, cause the computing system to perform the following operations:

a) receiving at least one image of a package on a conveyor, wherein the package is a package of beverage containers;

b) receiving an initial location of the package;

c) after operation b), identifying a SKU associated with the package based upon the initial location and based upon the at least one image using the at least one machine learning model; and

d) comparing the SKU identified in step c) to at least one desired SKU.

10 . The computing system of claim 9 wherein the computing system stores a plurality of pick lists, wherein each pick list indicates a quantity of each of a plurality of desired SKUs to be placed on one of a plurality of pallets, wherein operation d) includes comparing the SKU identified in step c) with at least one of the plurality of desired SKUs, wherein the operations further include:

e) based upon the comparison in operation d), directing the package toward one of the plurality of pallets.

11 . The computing system of claim 10 wherein the operations further include:

f) instructing a pick of a first desired SKU of the plurality of desired SKUs of the plurality of pick lists, wherein the plurality of pick lists for the plurality of pallets are a first wave;

g) receiving an instruction to close the first wave without the computing system having determined that a package is associated with the first desired SKU in operation d); and

h) adjusting an invoice associated with one of the plurality of pallets based upon operation g).

12 . The computing system of claim 10 wherein the operations further include:

f) instructing a pick of a first desired SKU of the plurality of desired SKUs of the plurality of pick lists, wherein the plurality of pick lists for the plurality of pallets are a first wave;

g) after operation f), receiving an instruction from a user to skip the pick of the first desired SKU;

h) after operation g), instructing a pick of a second desired SKU of the desired SKUs of the plurality of pick lists; and

i) after operation h), instructing the pick of the first SKU.

13 . A validation system including the computing system of claim 9 , the validation system further including an imaging system including at least one camera, the operations further including:

e) based upon the comparison in operation d), directing the package to an area proximate the conveyor upstream of the imaging system.

14 . The computing system of claim 10 wherein the initial location of the package in step b) is the initial location of the package prior to being placed on the conveyor.

15 . The computing system of claim 10 wherein the initial location of the package is determined based upon at least one initial image.

16 . The computing system of claim 9 wherein operation c) further includes inferring a plurality of classifications each at a confidence level, analyzing the at least one image to detect text, and augmenting the confidence level of at least one of the plurality of classifications based upon the detected text, wherein a size of the augmentation is based upon a number of classifications with which the detected text is associated.

17 . The computing system of claim 9 wherein the at least one image is a plurality of images and wherein operation c) includes:

e) determining at least one classification independently based upon each of the plurality of images; and

f) identifying the SKU associated with the package based upon the classifications determined in step e);

wherein operation e) includes inferring the at least one classification independently based upon each of the plurality of images using the at least one machine learning model.

18 . A computing system for identifying a SKU of a package of beverage containers comprising:

at least one processor; and

at least one non-transitory computer-readable media storing:

instructions that, when executed by the at least one processor, cause the computing system to perform the following operations:

a) receiving a plurality of overhead images of a package as it picked and placed on a conveyor;

b) determining a location of the package in at least one of the plurality of images;

c) identifying a SKU associated with the package based upon the location; and

d) comparing the SKU identified in step c) to at least one desired SKU on at least one picklist.

19 . The computing system of claim 18 further including:

e) directing the package toward one of a plurality of final conveyors based upon the comparison of step d).

20 . The computing system of claim 19 further including an overhead camera configured to generate the plurality of images.

21 . The computing system of claim 19 wherein the at least one non-transitory computer-readable media further stores at least one machine learning model trained with images of packages of beverage containers and wherein the operations further include:

f) receiving at least one package image of the package;

g) generating an output based upon the at least one package image using the at least one machine learning model; and

h) using the output to identify an associated SKU of a subsequent package.

22 . A method for identifying a SKU of a package using a computer system having at least one processor, the method including:

a) instructing a pick of a first desired SKU of a plurality of desired SKUs on a pick list, wherein the first desired SKU has an appearance unknown to the computer system;

b) receiving at least one image of a package in the computer system, wherein the package is a package of beverage containers;

c) the computer system generating an output based upon the at least one image using an image feature extractor;

d) the computer system comparing the output of step c) to a plurality of known outputs each having an associated known SKU using a feature similarity technique;

e) based upon step d), the computer system determining that a SKU of the package is different from the known SKUs associated with the plurality of known outputs;

f) the computer system instructing a user to scan a barcode on the package based upon step e);

g) based upon step e) and step f), the computer system determining that the SKU of the package is the first desired SKU; and

h) based upon step g) the computer system diverting the package.

23 . The method of claim 22 wherein in step d) the computer system performs a nearest neighbor technique and weighs each of a plurality of known outputs based upon a distance of each of the plurality of known outputs to the output of step c).

24 . The method of claim 22 wherein the package is a first package and the output is a first output, the method further including:

i) after step g), receiving at least one image of a second package in the computer system;

j) the computer system generating a second output based upon the at least one image of the second package using the image feature extractor;

k) the computer system comparing the second output of step j) to the plurality of known outputs and the first output using the feature similarity technique;

l) based upon step k), the computer system determining that a SKU of the second package is the first desired SKU; and

m) based upon step l), the computer system diverting the second package.

25 . A method for identifying a SKU of a package using a computer system having at least one processor, the method including:

a) instructing a pick of a first desired SKU of a plurality of desired SKUs on a pick list, wherein the first desired SKU has an expected appearance in the computer system;

b) receiving at least one image of a package in the computer system, wherein the package is a package of beverage containers;

c) the computer system generating an output based upon the at least one image using an image feature extractor;

d) the computer system comparing the output of step c) to a plurality of known outputs each having an associated known SKU using a feature similarity technique;

e) based upon step d), the computer system determining distances between the output and the plurality of known outputs;

f) based upon step a) and step e) the computer system determining that the SKU of the package is the first desired SKU, but that an appearance of the first desired SKU has changed; and

g) based upon step f), the computer system diverting the package.

26 . The method of claim 25 wherein in step f) the computer system performs a nearest neighbor technique and weighs each of a plurality of known outputs based upon the distance of each of the plurality of known outputs to the output of step c).

27 . The method of claim 25 wherein the computer system instructs a user to scan a barcode on the package based upon step e).

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 29, 2025
From: THYER, DANIEL JAMES; BROWN, JUSTIN MICHAEL; DOUCETTE, MATTHEW; JACKSON, PETER DOUGLAS; MARTIN, ROBERT LEE, JR.; CORLESS, JUSTIN; MUTHURU, SWAPNA; LOPEZ, CAROLINA
To: REHRIG PACIFIC COMPANY
Reel/Frame 072408/0492 →
Continuity (6)
Provisional Application 63662876 · Jun 21, 2024
Provisional Application 63563918 · Mar 11, 2024
Provisional Application 63559839 · Feb 29, 2024
Provisional Application 63557466 · Feb 23, 2024
Provisional Application 63611198 · Dec 17, 2023
Related Publication 20250200513A1 · Jun 19, 2025
References Cited (377)
US 1086727A · Palmer · 1914 [cited by applicant]
US 4509636A · Godbois · 1985 [cited by applicant]
US 4562689A · Hannen · 1986 [cited by applicant]
US 4575989A · Hannen · 1986 [cited by applicant]
US 4798275A · Leemkuil et al. · 1989 [cited by applicant]
US 4832204A · Handy et al. · 1989 [cited by applicant]
US 5018339A · Hannen et al. · 1991 [cited by applicant]
US 5140795A · Steding · 1992 [cited by applicant]
US 5188210A · Malow · 1993 [cited by applicant]
US 5450709A · Steding · 1995 [cited by applicant]
US 5623808A · Franklin et al. · 1997 [cited by applicant]
US 5701722A · Franklin et al. · 1997 [cited by applicant]
US 5730252A · Herbinet · 1998 [cited by applicant]
US 6026378A · Onozaki · 2000 [cited by applicant]
US 6626634B2 · Hwang et al. · 2003 [cited by applicant]
US 6721762B1 · Levine et al. · 2004 [cited by applicant]
US 6892515B2 · Cere · 2005 [cited by applicant]
US 6918229B2 · Lancaster et al. · 2005 [cited by applicant]
US 7097045B2 · Winkler · 2006 [cited by applicant]
US 7480640B1 · Elad et al. · 2009 [cited by applicant]
US 7548166B2 · Roeder et al. · 2009 [cited by applicant]
US 7557714B2 · Roeder et al. · 2009 [cited by applicant]
US 7602288B2 · Broussard · 2009 [cited by applicant]
US 7679504B2 · Wang et al. · 2010 [cited by applicant]
US 7698179B2 · Leung et al. · 2010 [cited by applicant]
US 7739147B2 · Branigan et al. · 2010 [cited by applicant]
US 7765668B2 · Townsend et al. · 2010 [cited by applicant]
US 7865398B2 · Schon · 2011 [cited by applicant]
US 7877164B2 · Grunbach et al. · 2011 [cited by applicant]
US 7882366B2 · Sen et al. · 2011 [cited by applicant]
US 8494673B2 · Miranda et al. · 2013 [cited by applicant]
US 8718372B2 · Holeva et al. · 2014 [cited by applicant]
US 8739502B2 · Lancaster, III · 2014 [cited by applicant]
US 8839132B2 · Reichert · 2014 [cited by applicant]
US 8849007B2 · Holeva et al. · 2014 [cited by applicant]
US 8885948B2 · Holeva et al. · 2014 [cited by applicant]
US 8892241B2 · Weiss · 2014 [cited by applicant]
US 8908995B2 · Benos et al. · 2014 [cited by applicant]
US 8918976B2 · Townsend et al. · 2014 [cited by applicant]
US 8934672B2 · Holeva et al. · 2015 [cited by applicant]
US 8938126B2 · Holeva et al. · 2015 [cited by applicant]
US 8965559B2 · Pankratov et al. · 2015 [cited by applicant]
US 8977032B2 · Holeva et al. · 2015 [cited by applicant]
US 8978984B2 · Hennick et al. · 2015 [cited by applicant]
US 8995743B2 · Holeva et al. · 2015 [cited by applicant]
US 9025827B2 · Holeva et al. · 2015 [cited by applicant]
US 9025886B2 · Holeva et al. · 2015 [cited by applicant]
US 9082195B2 · Holeva et al. · 2015 [cited by applicant]
US 9087384B2 · Holeva et al. · 2015 [cited by applicant]
US 9171278B1 · Kong et al. · 2015 [cited by applicant]
US 9224120B2 · Grabiner et al. · 2015 [cited by applicant]
US 9367827B1 · Lively et al. · 2016 [cited by applicant]
US 9373098B2 · Nashif et al. · 2016 [cited by applicant]
US 9481516B1 · Kraus · 2016 [cited by examiner]
US 9488466B2 · Hanson · 2016 [cited by applicant]
US 9488986B1 · Solanki · 2016 [cited by applicant]
US 9489655B1 · Lecky · 2016 [cited by applicant]
US 9503704B2 · Toshiyuki · 2016 [cited by applicant]
US 9505554B1 · Kong et al. · 2016 [cited by applicant]
US 9725195B2 · Lancaster, III et al. · 2017 [cited by applicant]
US 9727840B2 · Bernhardt · 2017 [cited by applicant]
US 9734367B1 · Lecky et al. · 2017 [cited by applicant]
US 9811632B2 · Grabiner et al. · 2017 [cited by applicant]
US 9821344B2 · Zsigmond et al. · 2017 [cited by applicant]
US 9826213B1 · Russell et al. · 2017 [cited by applicant]
US 9830485B1 · Lecky · 2017 [cited by applicant]
US 9944417B2 · Lemieux et al. · 2018 [cited by applicant]
US 9969572B2 · Pankratov et al. · 2018 [cited by applicant]
US 9984339B2 · Hance et al. · 2018 [cited by applicant]
US 9990535B2 · Phillips et al. · 2018 [cited by applicant]
US 10005581B2 · Lancaster, III et al. · 2018 [cited by applicant]
US 10026044B1 · Wurman et al. · 2018 [cited by applicant]
US 10042079B2 · Patnaik · 2018 [cited by applicant]
US 10055805B2 · Satou · 2018 [cited by applicant]
US 10071856B2 · Hance et al. · 2018 [cited by applicant]
US 10089509B2 · Nachtrieb · 2018 [cited by applicant]
US 10133990B2 · Hance et al. · 2018 [cited by applicant]
US 10134120B2 · Jovanovski et al. · 2018 [cited by applicant]
US 10140724B2 · Benos et al. · 2018 [cited by applicant]
US 10155199B2 · Sakai et al. · 2018 [cited by applicant]
US 10198653B2 · Kotula · 2019 [cited by applicant]
US 10198805B2 · Halata · 2019 [cited by applicant]
US 10217075B1 · Ward et al. · 2019 [cited by applicant]
US 10220970B2 · Lemieux et al. · 2019 [cited by applicant]
US 10227152B2 · Lancaster, III et al. · 2019 [cited by applicant]
US 10229301B2 · Cumoli et al. · 2019 [cited by applicant]
US 10229487B2 · Goyal et al. · 2019 [cited by applicant]
US 10265871B2 · Hance et al. · 2019 [cited by applicant]
US 10266349B2 · Pankratov et al. · 2019 [cited by applicant]
US 10280009B2 · Taylor et al. · 2019 [cited by applicant]
US 10328578B2 · Holz · 2019 [cited by applicant]
US 10346987B1 · Landman · 2019 [cited by applicant]
US 10347095B2 · Mattingly et al. · 2019 [cited by applicant]
US 10363664B2 · Yoshii · 2019 [cited by applicant]
US 10369701B1 · Diankov et al. · 2019 [cited by applicant]
US 10402956B2 · Jovanovski et al. · 2019 [cited by applicant]
US 10430969B2 · Kopelke et al. · 2019 [cited by applicant]
US 10442640B2 · Pankratov et al. · 2019 [cited by applicant]
US 10456915B1 · Diankov · 2019 [cited by applicant]
US 10482401B2 · Wurman et al. · 2019 [cited by applicant]
US 10491881B1 · Russell et al. · 2019 [cited by applicant]
US 10504343B2 · Mattingly et al. · 2019 [cited by applicant]
US 10518973B2 · Hance et al. · 2019 [cited by applicant]
US 10562188B1 · Diankov et al. · 2020 [cited by applicant]
US 10562189B1 · Diankov et al. · 2020 [cited by applicant]
US 10569416B1 · Diankov · 2020 [cited by applicant]
US 10569417B1 · Diankov · 2020 [cited by applicant]
US 10576631B1 · Diankov · 2020 [cited by applicant]
US 10592842B2 · High et al. · 2020 [cited by applicant]
US 10596701B1 · Diankov · 2020 [cited by applicant]
US 10607182B2 · Shah et al. · 2020 [cited by applicant]
US 10614319B2 · Douglas et al. · 2020 [cited by applicant]
US 10616553B1 · Russell et al. · 2020 [cited by applicant]
US 10618172B1 · Diankov et al. · 2020 [cited by applicant]
US 10621457B2 · Schimmel · 2020 [cited by applicant]
US 10627244B1 · Lauka et al. · 2020 [cited by applicant]
US 10628763B2 · Hance et al. · 2020 [cited by applicant]
US 10643038B1 · Mccalib, Jr. et al. · 2020 [cited by applicant]
US 10643170B2 · Lee et al. · 2020 [cited by applicant]
US 10655945B2 · Nanda et al. · 2020 [cited by applicant]
US 10657341B2 · Wilkinson · 2020 [cited by applicant]
US 10679379B1 · Diankov et al. · 2020 [cited by applicant]
US 10685197B2 · Plummer et al. · 2020 [cited by applicant]
US 10703584B2 · Diankov et al. · 2020 [cited by applicant]
US 10703585B2 · Pankratov et al. · 2020 [cited by applicant]
US 10706571B2 · Sugimura et al. · 2020 [cited by applicant]
US 10724973B2 · Paresi · 2020 [cited by applicant]
US 10745210B2 · Aljoe et al. · 2020 [cited by applicant]
US 10759599B2 · Hance et al. · 2020 [cited by applicant]
US 10769806B2 · Driegen et al. · 2020 [cited by applicant]
US 10796423B2 · Goja · 2020 [cited by applicant]
US 10810534B2 · Taylor et al. · 2020 [cited by applicant]
US 10810540B1 · Gopal et al. · 2020 [cited by applicant]
US 10845184B2 · Benos et al. · 2020 [cited by applicant]
US 10845499B2 · Paresi · 2020 [cited by applicant]
US 10867275B1 · Dholakia et al. · 2020 [cited by applicant]
US 10984207B2 · Sone et al. · 2021 [cited by applicant]
US 11046519B2 · Martin, Jr. et al. · 2021 [cited by applicant]
US 11068841B1 · Lui et al. · 2021 [cited by applicant]
US 11087160B2 · Martin, Jr. et al. · 2021 [cited by applicant]
US 11087273B1 · Bergamo · 2021 [cited by applicant]
US 11205059B2 · Wagner et al. · 2021 [cited by applicant]
US 11227458B1 · Farah et al. · 2022 [cited by applicant]
US 11275815B2 · Siani Cohen et al. · 2022 [cited by applicant]
US 11308616B2 · Ceballos Lentini et al. · 2022 [cited by applicant]
US 11383930B2 · Martin, Jr. et al. · 2022 [cited by applicant]
US 11494580B2 · Naito et al. · 2022 [cited by applicant]
US 11531953B2 · Taylor et al. · 2022 [cited by applicant]
US 11542047B2 · Parrucci · 2023 [cited by applicant]
US 11620607B2 · Yanagihashi et al. · 2023 [cited by applicant]
US 11648676B2 · Diankov et al. · 2023 [cited by applicant]
US 11667416B2 · Lancaster, III et al. · 2023 [cited by applicant]
US 11685605B2 · Makhal et al. · 2023 [cited by applicant]
US 11724895B1 · Kocheta · 2023 [cited by examiner]
US 11767169B2 · Ericson et al. · 2023 [cited by applicant]
US 11783606B2 · Jackson et al. · 2023 [cited by applicant]
US 11823440B2 · Brown et al. · 2023 [cited by applicant]
US 11868947B2 · Taylor et al. · 2024 [cited by applicant]
US 11922253B2 · Jackson et al. · 2024 [cited by applicant]
US 11972624B2 · Jackson et al. · 2024 [cited by applicant]
US 20030200730A1 · Cere · 2003 [cited by applicant]
US 20040069850A1 · De Wilde · 2004 [cited by applicant]
US 20040220694A1 · Smith · 2004 [cited by applicant]
US 20050071234A1 · Schon · 2005 [cited by applicant]
US 20050138897A1 · Eldridge · 2005 [cited by applicant]
US 20050223683A1 · Cere′ · 2005 [cited by applicant]
US 20050246056A1 · Marks et al. · 2005 [cited by applicant]
US 20060096244A1 · Cere′ · 2006 [cited by applicant]
US 20060187041A1 · Olsen, III et al. · 2006 [cited by applicant]
US 20060242820A1 · Townsend et al. · 2006 [cited by applicant]
US 20060255949A1 · Roeder et al. · 2006 [cited by applicant]
US 20060255950A1 · Roeder et al. · 2006 [cited by applicant]
US 20070017986A1 · Carrender et al. · 2007 [cited by applicant]
US 20070126578A1 · Broussard · 2007 [cited by applicant]
US 20070156281A1 · Leung et al. · 2007 [cited by applicant]
US 20070163099A1 · Townsend et al. · 2007 [cited by applicant]
US 20070174148A1 · Schuler et al. · 2007 [cited by applicant]
US 20080046116A1 · Khan · 2008 [cited by examiner]
US 20080131255A1 · Hessler et al. · 2008 [cited by applicant]
US 20080267759A1 · Morency et al. · 2008 [cited by applicant]
US 20090008450A1 · Ebert et al. · 2009 [cited by applicant]
US 20090112675A1 · Servais · 2009 [cited by applicant]
US 20090293425A1 · Carter et al. · 2009 [cited by applicant]
US 20100127870A1 · Rinkes et al. · 2010 [cited by applicant]
US 20100150689A1 · Berry et al. · 2010 [cited by applicant]
US 20100176964A1 · Kobayashi et al. · 2010 [cited by applicant]
US 20100202702A1 · Benos et al. · 2010 [cited by applicant]
US 20100316470A1 · Lert et al. · 2010 [cited by applicant]
US 20110118130A1 · Loring et al. · 2011 [cited by applicant]
US 20110132800A1 · Cerf · 2011 [cited by applicant]
US 20110238207A1 · Bastian, II et al. · 2011 [cited by applicant]
US 20120057022A1 · Nechiporenko et al. · 2012 [cited by applicant]
US 20120106787A1 · Nechiporenko et al. · 2012 [cited by applicant]
US 20120175170A1 · Martin et al. · 2012 [cited by applicant]
US 20120175412A1 · Osborn · 2012 [cited by applicant]
US 20120274784A1 · Hofman · 2012 [cited by applicant]
US 20130017051A1 · Therkildsen · 2013 [cited by applicant]
US 20130063567A1 · Burns et al. · 2013 [cited by applicant]
US 20130101166A1 · Yoder · 2013 [cited by applicant]
US 20130101167A1 · Yoder · 2013 [cited by applicant]
US 20130101173A1 · Yoder · 2013 [cited by applicant]
US 20130101201A1 · Seelinger · 2013 [cited by applicant]
US 20130101202A1 · Seelinger · 2013 [cited by applicant]
US 20130101203A1 · Yoder · 2013 [cited by applicant]
US 20130101204A1 · Yoder · 2013 [cited by applicant]
US 20130101227A1 · Seelinger · 2013 [cited by applicant]
US 20130101228A1 · Yoder · 2013 [cited by applicant]
US 20130101229A1 · Yoder · 2013 [cited by applicant]
US 20130101230A1 · Yoder · 2013 [cited by applicant]
US 20130282165A1 · Pankratov et al. · 2013 [cited by applicant]
US 20130300047A1 · Hendren et al. · 2013 [cited by applicant]
US 20140197926A1 · Nikitin et al. · 2014 [cited by applicant]
US 20150101281A1 · Kudia · 2015 [cited by applicant]
US 20150102100A1 · Hattrup et al. · 2015 [cited by applicant]
US 20150149946A1 · Benos et al. · 2015 [cited by applicant]
US 20150166272A1 · Pankratov et al. · 2015 [cited by applicant]
US 20150325013A1 · Patnaik · 2015 [cited by applicant]
US 20150363758A1 · Wu et al. · 2015 [cited by applicant]
US 20160104274A1 · Jovanovski et al. · 2016 [cited by applicant]
US 20160104290A1 · Patnaik · 2016 [cited by applicant]
US 20160110630A1 · Heusch et al. · 2016 [cited by applicant]
US 20160154939A1 · Grabiner et al. · 2016 [cited by applicant]
US 20160260161A1 · Atchley et al. · 2016 [cited by applicant]
US 20160275441A1 · Barber et al. · 2016 [cited by applicant]
US 20160371512A1 · Hattrup et al. · 2016 [cited by applicant]
US 20170011364A1 · Whitman et al. · 2017 [cited by applicant]
US 20170032285A1 · Sharma et al. · 2017 [cited by applicant]
US 20170076469A1 · Sonoura et al. · 2017 [cited by applicant]
US 20170132773A1 · Toedtli · 2017 [cited by applicant]
US 20170154397A1 · Satou · 2017 [cited by applicant]
US 20170161673A1 · High et al. · 2017 [cited by applicant]
US 20170193432A1 · Bernhardt · 2017 [cited by applicant]
US 20170193434A1 · Shah et al. · 2017 [cited by applicant]
US 20170286876A1 · Tingler et al. · 2017 [cited by applicant]
US 20170286907A1 · Rizkallah et al. · 2017 [cited by applicant]
US 20170300742A1 · Wei et al. · 2017 [cited by applicant]
US 20170316253A1 · Phillips et al. · 2017 [cited by applicant]
US 20170323376A1 · Glaser et al. · 2017 [cited by applicant]
US 20180001481A1 · Shah et al. · 2018 [cited by applicant]
US 20180025185A1 · Hattrup et al. · 2018 [cited by applicant]
US 20180029797A1 · Hance et al. · 2018 [cited by applicant]
US 20180043547A1 · Hance et al. · 2018 [cited by applicant]
US 20180057284A1 · Carpenter et al. · 2018 [cited by applicant]
US 20180060630A1 · Nachtrieb · 2018 [cited by applicant]
US 20180060764A1 · Hance et al. · 2018 [cited by applicant]
US 20180089517A1 · Douglas et al. · 2018 [cited by applicant]
US 20180108120A1 · Venable et al. · 2018 [cited by applicant]
US 20180218247A1 · Lee et al. · 2018 [cited by applicant]
US 20180224569A1 · Paresi · 2018 [cited by applicant]
US 20180225597A1 · Hance et al. · 2018 [cited by applicant]
US 20180247404A1 · Goyal et al. · 2018 [cited by applicant]
US 20180253857A1 · Driegen et al. · 2018 [cited by applicant]
US 20180257879A1 · Pankratov et al. · 2018 [cited by applicant]
US 20180260772A1 · Chaubard et al. · 2018 [cited by applicant]
US 20180273226A1 · Lancaster, III et al. · 2018 [cited by applicant]
US 20180304468A1 · Holz · 2018 [cited by applicant]
US 20180314866A1 · Kotula · 2018 [cited by applicant]
US 20180314867A1 · Kotula · 2018 [cited by applicant]
US 20180322424A1 · Wurman et al. · 2018 [cited by applicant]
US 20180370046A1 · Hance et al. · 2018 [cited by applicant]
US 20180370727A1 · Hance et al. · 2018 [cited by applicant]
US 20190005668A1 · Sugimura et al. · 2019 [cited by applicant]
US 20190026878A1 · Jovanovski et al. · 2019 [cited by applicant]
US 20190034839A1 · Hance et al. · 2019 [cited by applicant]
US 20190041341A1 · Paresi · 2019 [cited by applicant]
US 20190049234A1 · Benos et al. · 2019 [cited by applicant]
US 20190080207A1 · Chang et al. · 2019 [cited by applicant]
US 20190102146A1 · Swift · 2019 [cited by applicant]
US 20190102654A1 · Trehan · 2019 [cited by applicant]
US 20190102874A1 · Goja · 2019 [cited by applicant]
US 20190122173A1 · Souder et al. · 2019 [cited by applicant]
US 20190156086A1 · Plummer et al. · 2019 [cited by applicant]
US 20190156316A1 · Simske et al. · 2019 [cited by applicant]
US 20190197561A1 · Adato et al. · 2019 [cited by applicant]
US 20190206059A1 · Landman · 2019 [cited by applicant]
US 20190220990A1 · Goja et al. · 2019 [cited by applicant]
US 20190236793A1 · Chan · 2019 [cited by applicant]
US 20190248604A1 · Pankratov et al. · 2019 [cited by applicant]
US 20190251385A1 · Kotula · 2019 [cited by applicant]
US 20190279017A1 · Graham et al. · 2019 [cited by applicant]
US 20190295385A1 · Mattingly et al. · 2019 [cited by applicant]
US 20190322451A1 · Bastian, II et al. · 2019 [cited by applicant]
US 20200005531A1 · Jiang · 2020 [cited by applicant]
US 20200034658A1 · Chung et al. · 2020 [cited by applicant]
US 20200039765A1 · Pankratov et al. · 2020 [cited by applicant]
US 20200074523A1 · Wang et al. · 2020 [cited by applicant]
US 20200087068A1 · Hance et al. · 2020 [cited by applicant]
US 20200104785A1 · Ehrman et al. · 2020 [cited by applicant]
US 20200105008A1 · Ehrman et al. · 2020 [cited by applicant]
US 20200130961A1 · Diankov et al. · 2020 [cited by applicant]
US 20200130962A1 · Yu et al. · 2020 [cited by applicant]
US 20200134828A1 · Diankov et al. · 2020 [cited by applicant]
US 20200134830A1 · Yu et al. · 2020 [cited by applicant]
US 20200139553A1 · Diankov et al. · 2020 [cited by applicant]
US 20200156254A1 · Li et al. · 2020 [cited by applicant]
US 20200202175A1 · Hieida et al. · 2020 [cited by applicant]
US 20200210768A1 · Turkelson et al. · 2020 [cited by applicant]
US 20200238517A1 · Diankov · 2020 [cited by applicant]
US 20200238519A1 · Diankov et al. · 2020 [cited by applicant]
US 20200265494A1 · Glaser · 2020 [cited by examiner]
US 20200273131A1 · Martin, Jr. et al. · 2020 [cited by applicant]
US 20200283176A1 · Lancaster, III et al. · 2020 [cited by applicant]
US 20200294244A1 · Diankov et al. · 2020 [cited by applicant]
US 20200302207A1 · Perkins et al. · 2020 [cited by applicant]
US 20200302243A1 · Fryshman · 2020 [cited by applicant]
US 20200311362A1 · Plummer et al. · 2020 [cited by applicant]
US 20200334856A1 · Staudinger et al. · 2020 [cited by applicant]
US 20200356798A1 · Kotula · 2020 [cited by applicant]
US 20210004589A1 · Turkelson et al. · 2021 [cited by applicant]
US 20210009362A1 · Grupp · 2021 [cited by examiner]
US 20210042662A1 · Pu et al. · 2021 [cited by applicant]
US 20210070483A1 · Parrucci · 2021 [cited by applicant]
US 20210082220A1 · Boerger et al. · 2021 [cited by applicant]
US 20210125199A1 · Woodbeck et al. · 2021 [cited by applicant]
US 20210133666A1 · Eckman et al. · 2021 [cited by applicant]
US 20210149948A1 · Nayak · 2021 [cited by applicant]
US 20210198042A1 · Martin, Jr. et al. · 2021 [cited by applicant]
US 20210287109A1 · Cmielowski et al. · 2021 [cited by applicant]
US 20210326544A1 · Jackson et al. · 2021 [cited by applicant]
US 20210342708A1 · Klug et al. · 2021 [cited by applicant]
US 20210342857A1 · Tzur et al. · 2021 [cited by applicant]
US 20210350485A1 · Majumdar et al. · 2021 [cited by applicant]
US 20210357429A1 · Watson et al. · 2021 [cited by applicant]
US 20210398045A1 · Hanebeck · 2021 [cited by applicant]
US 20210403066A1 · Martin, Jr. et al. · 2021 [cited by applicant]
US 20220016779A1 · Wang et al. · 2022 [cited by applicant]
US 20220021803A1 · Miller et al. · 2022 [cited by applicant]
US 20220055840A1 · Schumacher · 2022 [cited by applicant]
US 20220058511A1 · McCusker et al. · 2022 [cited by applicant]
US 20220100935A1 · Chen · 2022 [cited by applicant]
US 20220121866A1 · Balch et al. · 2022 [cited by applicant]
US 20220122029A1 · Martin, Jr. et al. · 2022 [cited by applicant]
US 20220129836A1 · Jackson et al. · 2022 [cited by applicant]
US 20220219846A1 · Jackson et al. · 2022 [cited by applicant]
US 20220237530A1 · Franey · 2022 [cited by examiner]
US 20220250845A1 · Martin, Jr. et al. · 2022 [cited by applicant]
US 20230054508A1 · Brown et al. · 2023 [cited by applicant]
US 20230058363A1 · Reynolds et al. · 2023 [cited by applicant]
US 20230059103A1 · Jackson et al. · 2023 [cited by applicant]
US 20230096840A1 · Perkins et al. · 2023 [cited by applicant]
US 20230140119A1 · Jackson et al. · 2023 [cited by applicant]
US 20230147974A1 · Martin, Jr. et al. · 2023 [cited by applicant]
US 20230183019A1 · Pilney et al. · 2023 [cited by applicant]
US 20230252542A1 · Bjelcevic · 2023 [cited by examiner]
US 20230259951A1 · Weintraub et al. · 2023 [cited by applicant]
US 20230360419A1 · Jackson et al. · 2023 [cited by applicant]
US 20240020957A1 · Brown et al. · 2024 [cited by applicant]
US 20240095650A1 · Taylor et al. · 2024 [cited by applicant]
US 20240127012A1 · Jackson et al. · 2024 [cited by applicant]
US 20240211712A1 · Barkan · 2024 [cited by examiner]
US 20240242470A1 · Yarlagadda · 2024 [cited by examiner]
US 20240290121A1 · Jackson et al. · 2024 [cited by applicant]
US 20240308711A1 · Jackson et al. · 2024 [cited by applicant]
AU 2021212010A1 · 2022 [cited by applicant]
CN 202729702U · 2013 [cited by applicant]
CN 107516220A · 2017 [cited by applicant]
CN 109906486A · 2019 [cited by applicant]
CN 107944454B · 2021 [cited by applicant]
CN 215554778U · 2022 [cited by applicant]
CN 113377850B · 2022 [cited by applicant]
CN 114354637A · 2022 [cited by applicant]
EP 3399329A1 · 2018 [cited by applicant]
EP 3667356A1 · 2020 [cited by applicant]
KR 20100051156A · 2010 [cited by applicant]
RU 2708504C1 · 2019 [cited by applicant]
TW 201926167A · 2019 [cited by applicant]
TW 1755918B · 2022 [cited by applicant]
WO 2010123458A1 · 2010 [cited by applicant]
WO 2015004502A1 · 2015 [cited by applicant]
WO 2017040933A1 · 2017 [cited by applicant]
WO 2018166652A1 · 2018 [cited by applicant]
WO 2018195200A1 · 2018 [cited by applicant]
WO 2022052959A1 · 2022 [cited by applicant]
“Wave picking _Cancellation”, Aug. 2020, https://community.sap.com/t5/supply-chain-management-q-a/wave-picking-cancellation/qaq-p/12256666, hereinafter “SAP” (Year: 2020). [cited by examiner]
Laviale, “Deep Dive on KNN: Understanding and Implementing the K-Nearest Neighbors Algorithm”, Mar. 2023, https://arize.com/blog-course/knn-algorithm-k-nearest-neighbor/ (Year: 2023). [cited by examiner]
Decision on Appeal for U.S. Appl. No. 17/508,021 dated Nov. 20, 2024. [cited by applicant]
International Search Report and Written Opinion for International Application No. PCT/US2024/060367 dated Feb. 17, 2025. [cited by applicant]