IP Library › Granted Patent US 12,619,942
Granted Patent B2
US 12,619,942 · App. 18/942,244 · Granted May 5, 2026

Systems and methods for delivering items having encoded delivery points

Inventors: Robert E. Dixon, Jr. (Haymarket, VA); Gary C. Reblin (Falls Church, VA); Naomi Miller (Washington, DC)
Assignee: United States Postal Service
G06Q10/083G06K7/1413G06K19/06028
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,619,942
App. No.
18/942,244
Granted
May 5, 2026
Kind
B2
Abstract

Systems and methods for delivering items are disclosed. The systems and methods comprise assigning a unique internal control value to each profile having an identified physical address delivery point. They also receive a request for delivery point information for each of a plurality of items to be distributed and providing a response comprising a list of internal control values thereto. They further receive a plurality of items, each item having printed thereon one of the internal control values on the list. For each of the plurality of items, they scan, by item processing equipment, the item to read the internal control value printed thereon, identifying, in the profile database, the physical address delivery point corresponding to the assigned internal control value, routing, by the item processing equipment, the item according to the identified physical address delivery point, and delivering the item to the identified physical address delivery point.

Claims (56)

1 . A method of dynamic item delivery comprising:

receiving a plurality of items by a distribution network, each of the plurality of items having thereon a unique computer readable code that encodes a unique identifier associated with one of a plurality of general geographic areas, wherein the unique identifier is not associated with a specific delivery point when the plurality of items are received by the distribution network;

transporting each of the plurality of items toward the one of the plurality of general geographic areas associated with the unique identifier on each item;

receiving a delivery request specifying an item type corresponding to the plurality of items, the delivery request identifying a specific delivery point within the one of the plurality of general geographic areas, wherein the delivery request does not specify an individual one of the plurality of items;

selecting one of the plurality of items and the associated unique identifier to fulfill the delivery request;

storing, in a memory, an association between one of the plurality of items and the associated unique identifier and the specific delivery point;

scanning the unique computer readable codes of the plurality of items on item processing equipment in the one of the plurality of general geographic areas; and

in response to scanning the unique computer readable code that encodes the one of the unique identifiers:

identifying the specific delivery point from the scan on the item processing equipment based on the stored association; and

delivering the item corresponding to the one of the unique identifiers to the specific delivery point.

2 . The method of claim 1 , further comprising, in response to receiving the delivery request:

determining that the specific delivery point is located within the one of the plurality of general geographic areas; and

selecting the one of the unique identifiers based at least in part on the one of the unique identifiers not yet being associated with a specific delivery point.

3 . The method of claim 1 , further comprising estimating how many items will be requested to be delivered to specific delivery points in each of the plurality of general geographic areas.

4 . The method of claim 3 , wherein transporting each of the plurality of items comprises transporting a quantity of items corresponding to the estimated number of items for each of the plurality of general geographic areas.

5 . The method of claim 1 , wherein the delivery request comprises information regarding a purchaser of the item.

6 . The method of claim 5 , wherein the plurality of items are deliverable to the purchaser only on or after a specified date.

7 . The method of claim 6 , wherein transporting each of the plurality of items begins at a time before the specified date.

8 . The method of claim 1 , wherein the unique computer readable identifier further encodes information identifying a sender or shipper of the item.

9 . The method of claim 1 , further comprising:

receiving, from a provider of the plurality of items, a request for a plurality of computer readable codes;

generating the plurality of unique computer readable codes, the unique computer readable codes encoding information identifying the provider of the item and information indicating that the unique computer readable code is intended for use with a dynamic warehousing service.

10 . The method of claim 1 , further comprising applying the plurality of unique computer readable codes to the plurality of items.

11 . A system for dynamic item delivery comprising:

a plurality of items, each of the items having thereon a unique computer readable code that encodes a unique identifier associated with one of a plurality of general geographic areas;

one or more vehicles for transporting the plurality of items toward the one of the plurality of general geographic areas;

item processing equipment located within the one of the plurality of general geographic areas, the item processing equipment comprising a scanner configured to read the unique computer readable codes;

a memory storing the unique identifier for each of the plurality of items and an association between each unique identifier and one of the plurality of general geographic areas; and

one or more processors in communication with the memory, the one or more processors configured to:

receive, after the one or more vehicles have begun transporting the plurality of items toward the one of the plurality of general geographic areas, a delivery request specifying an item type corresponding to the plurality of items, the delivery request identifying a specific delivery point within the one of the plurality of general geographic areas, wherein the delivery request does not specify an individual one of the plurality of items;

select one of the plurality of items and the associated unique identifier to fulfill the delivery request;

store, in a memory, an association between the selected one of the plurality of items and the associated unique identifier and the specific delivery point;

receive scan information from the item processing equipment including the one of the unique identifiers;

identify the specific delivery point corresponding to the one of the unique identifiers from the received scan information; and

cause the item corresponding to the one of the unique identifiers to be delivered to the specific delivery point.

12 . The system of claim 11 , wherein the one or more processors are further configured to:

determine that the specific delivery point is located within the one of the plurality of general geographic areas; and

select the one of the unique identifiers based at least in part on the one of the unique identifiers not yet being associated with a specific delivery point.

13 . The system of claim 11 wherein the one or more processors are further configured to estimate a quantity of items that are to be requested to be delivered to specific delivery points in each of the plurality of general geographic areas.

14 . The system of claim 11 , wherein the one or more processors are further configured to track the locations and unique computer readable codes of the plurality of items on vehicles en route to each of the plurality of general geographic areas.

15 . The system of claim 11 , wherein the received delivery request further comprises a request to deliver the item to an address of a purchaser of the item.

16 . The system of claim 15 , wherein the plurality of items are deliverable to the purchaser only on or after a specified date.

17 . The system of claim 16 , wherein requests from the purchaser are received at a time after the items are being transported to the general geographic area.

18 . The system of claim 16 , wherein the transportation of the item began before the specified date.

19 . The system of claim 11 , wherein the unique computer readable code further encodes information identifying a sender or shipper of the item.

20 . A method of dynamic item delivery comprising:

receiving, from a provider of a plurality of items, a request for a plurality of computer readable codes;

generating, in response to the request, a plurality of unique computer readable codes, the plurality of unique computer readable codes encoding information identifying the provider of the item, an identifier associated with one of a plurality of general geographic areas, and an identifier that the unique computer readable code is intended for use with a dynamic warehousing service;

receiving the plurality of items by a distribution network, each of the plurality of items having thereon one of the generated plurality of unique computer readable codes, wherein each of the plurality of unique computer readable codes is not associated with a specific delivery point when the plurality of items are received by the distribution network;

transporting each of the plurality of items toward the one of the plurality of general geographic areas associated with the unique identifier on each item;

receiving a delivery request for an item of a type corresponding to the plurality of items, the delivery request identifying a specific delivery point within the one of the plurality of general geographic areas;

storing, in a memory, an association between one of the unique identifiers and the specific delivery point;

scanning the unique computer readable codes of the plurality of items on item processing equipment in the one of the plurality of general geographic areas; and

in response to scanning the unique computer readable code that encodes the one of the unique identifiers:

identifying the specific delivery point from the scan on the item processing equipment based on the stored association; and

delivering the item corresponding to the one of the unique identifiers to the specific delivery point.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 9, 2026
From: DIXON, ROBERT E., JR.; REBLIN, GARY C.
To: UNITED STATES POSTAL SERVICE
Reel/Frame 073427/0384 →
Continuity (4)
Continuation 18343328 · Jun 28, 2023
Continuation 17010671 · Sep 2, 2020
Provisional Application 62895433 · Sep 3, 2019
Related Publication 20250069024A1 · Feb 27, 2025
References Cited (89)
US 5422821A · Allen et al. · 1995 [cited by applicant]
US 5454038A · Cordery et al. · 1995 [cited by applicant]
US 5892900A · Ginter et al. · 1999 [cited by applicant]
US 5893464A · Kiani et al. · 1999 [cited by applicant]
US 6519571B1 · Guheen et al. · 2003 [cited by applicant]
US 6671813B2 · Ananda · 2003 [cited by applicant]
US 6961711B1 · Chee · 2005 [cited by applicant]
US 7124101B1 · Mikurak · 2006 [cited by applicant]
US 8060756B2 · Rao et al. · 2011 [cited by applicant]
US 8862901B2 · Rao et al. · 2014 [cited by applicant]
US 10437435B2 · Ladden et al. · 2019 [cited by applicant]
US 10572851B2 · Skaaksrud · 2020 [cited by applicant]
US 10592845B2 · Skaaksrud · 2020 [cited by applicant]
US 10671962B2 · Skaaksrud · 2020 [cited by applicant]
US 10726382B2 · Skaaksrud · 2020 [cited by applicant]
US 10726383B2 · Skaaksrud · 2020 [cited by applicant]
US 10860973B2 · Skaaksrud · 2020 [cited by applicant]
US 10911571B2 · Goel et al. · 2021 [cited by applicant]
US 11049062B2 · Skaaksrud · 2021 [cited by applicant]
US 11238397B2 · Skaaksrud · 2022 [cited by applicant]
US 20030149674A1 · Good et al. · 2003 [cited by applicant]
US 20030158785A1 · Erca · 2003 [cited by applicant]
US 20030182017A1 · O'Donohue et al. · 2003 [cited by applicant]
US 20030231112A1 · Raju · 2003 [cited by applicant]
US 20040002903A1 · Stolfo · 2004 [cited by applicant]
US 20040128254A1 · Pintsov · 2004 [cited by applicant]
US 20040128524A1 · Ezaki · 2004 [cited by applicant]
US 20040174259A1 · Peel et al. · 2004 [cited by applicant]
US 20040233065A1 · Freeman · 2004 [cited by applicant]
US 20040246130A1 · Lambright et al. · 2004 [cited by applicant]
US 20050205719A1 · Hendrickson et al. · 2005 [cited by applicant]
US 20050222853A1 · Black et al. · 2005 [cited by applicant]
US 20050226514A1 · Getzinger et al. · 2005 [cited by applicant]
US 20050251330A1 · Waterhouse et al. · 2005 [cited by applicant]
US 20050259658A1 · Logan et al. · 2005 [cited by applicant]
US 20060030969A1 · Norris et al. · 2006 [cited by applicant]
US 20060136237A1 · Spiegel et al. · 2006 [cited by applicant]
US 20070187183A1 · Saigh et al. · 2007 [cited by applicant]
US 20080288785A1 · Rao et al. · 2008 [cited by applicant]
US 20090164662A1 · Mather · 2009 [cited by applicant]
US 20100230328A1 · Bonnell et al. · 2010 [cited by applicant]
US 20110066281A1 · Ksiazek · 2011 [cited by applicant]
US 20120047373A1 · Rao et al. · 2012 [cited by applicant]
US 20130024326A1 · Dearing et al. · 2013 [cited by applicant]
US 20140081951A1 · Greenspan et al. · 2014 [cited by applicant]
US 20140330738A1 · Falcone et al. · 2014 [cited by applicant]
US 20150227890A1 · Bednarek et al. · 2015 [cited by applicant]
US 20160171439A1 · Ladden et al. · 2016 [cited by applicant]
US 20160232479A1 · Skaaksrud · 2016 [cited by applicant]
US 20160232481A1 · Skaaksrud · 2016 [cited by applicant]
US 20160232484A1 · Skaaksrud · 2016 [cited by applicant]
US 20160232485A1 · Skaaksrud · 2016 [cited by applicant]
US 20160232486A1 · Skaaksrud · 2016 [cited by applicant]
US 20160232488A1 · Skaaksrud · 2016 [cited by applicant]
US 20160232489A1 · Skaaksrud · 2016 [cited by applicant]
US 20170154304A1 · Aryeetey et al. · 2017 [cited by applicant]
US 20170193444A1 · Dearing · 2017 [cited by applicant]
US 20170228687A1 · Stephen et al. · 2017 [cited by applicant]
US 20170320101A1 · Bombaugh et al. · 2017 [cited by applicant]
US 20180246983A1 · Rathod · 2018 [cited by applicant]
US 20180357848A1 · McLellan et al. · 2018 [cited by applicant]
US 20190026692A1 · Dearing et al. · 2019 [cited by applicant]
US 20190102805A1 · Gersh · 2019 [cited by applicant]
US 20190156280A1 · Skaaksrud · 2019 [cited by applicant]
US 20190161190A1 · Gil et al. · 2019 [cited by applicant]
US 20190228375A1 · Laury et al. · 2019 [cited by applicant]
US 20190311325A1 · Reblin · 2019 [cited by applicant]
US 20210042694A1 · Skaaksrud · 2021 [cited by applicant]
US 20210065105A9 · Skaaksrud · 2021 [cited by applicant]
JP 01159088A · 1989 [cited by applicant]
JP 2002230373A · 2002 [cited by applicant]
JP 2008117027A · 2008 [cited by applicant]
JP 2012012177A · 2012 [cited by applicant]
JP 2014203103A · 2014 [cited by applicant]
KR 20010076609 · 2001 [cited by applicant]
RU 2597572C1 · 2016 [cited by applicant]
WO WO9906161A1 · 1999 [cited by applicant]
WO WO2006065945A2 · 2006 [cited by applicant]
WO WO2008047117A2 · 2008 [cited by examiner]
WO WO2015089570 · 2015 [cited by applicant]
WO WO2017059129A1 · 2017 [cited by applicant]
Anonymous: “Mail sorter—Wikipedia”, May 11, 2015 (May 11, 2015), XP055708743, Retreived from theInternet: URL:https://en.wikipedia.org/w/index.php?title=Mail_sorter&oldid=661866552[retreived on Jun. 25, 2020]. [cited by applicant]
Anonymous: “Multiline optical-character reader—Wikipedia”, Sep. 14, 2014 (Sep. 14, 2014), XP055708744, Retrieved from the Internet: URL:https://en.wikipedia.org/w/index.php?title=Multiline_opticalcharacterreader&oldid=6… [cited by applicant]
Bruce Schneier. NSA surveillance: A guide to staying secure. (Sep. 6, 2013). Retrieved online May 7, 2021. https://www.theguardian.com/world/2013/sep/05/nsa-how-to-remain-secure-surveillance (Year: 2013). [cited by applicant]
Endicia. Understanding FIM (Facing Identification Marks) on Envelopes. (Dec. 7, 2004).Retrieved online May 7, 2021. https://www.endicia.com/tools-resources/hanrys-hints/facing-identification-marks (Year: 2004). [cited by applicant]
Fortin et. Forti Mail Identity Based Encryption a Business and Compliance Enabler. (Oct. 15, 2011). Retrieved online Oct. 22, 2020. https ://www.fortinet.com/content/dam/fortinet/assets/white-papers/fortimail-identity-b… [cited by applicant]
International Search Report and Written Opinion dated Dec. 29, 2016 in International Application No. PCT/US16/54529. [cited by applicant]
International Preliminary Report on Patentability dated Oct. 6, 2017 in International Application No. PCT/US16/54529. [cited by applicant]
International Search Report and Written Opinion mailed Jun. 14, 2019 in International Application No. PCT/US2019/025434. [cited by applicant]