IP Library › Granted Patent US 12,205,068
Granted Patent B2
US 12,205,068 · App. 17/231,590 · Granted Jan 21, 2025

Catchment modeling

Inventors: Sindiri Sai Kumar (Bengaluru, IN); Ravikumar Batchu (Bengaluru, IN); Tanvi Gupta (Bengaluru, IN); Rishi Saraf (Bengaluru, IN); Manful Ram (Bengaluru, IN)
Assignee: Walmart Apollo, LLC
G06Q10/08355H04W4/021H04W4/024H04W4/185G06Q10/0836
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,205,068
App. No.
17/231,590
Granted
Jan 21, 2025
Kind
B2
Abstract

Examples provide catchment modeling for identifying destination locations eligible for last mile delivery from source locations, such as a store or fulfillment center. The catchment modeling system divides a catchment area associated with the source location into a plurality of geohash blocks within a polygon fence. The size of the geohash blocks varies relative to proximity of each geohash block to a fence point within a polygon fence. The plurality of blocks includes a set of inclusion blocks within the predetermined distance from the source location and/or a set of exclusion blocks exceeding the predetermined distance from the source location. Data compression via polygon merging is performed. The compressed data is cached for utilization during catchment delivery eligibility determinations. If a destination address is within the set of inclusion address or absent from the set of exclusion addresses, the destination is eligible for delivery from the source to the destination.

Claims (47)

1. A system comprising:

a processor; and

a memory communicatively coupled to the processor and having stored thereon computer-executable instructions causing the processor to:

divide a catchment area within a polygon fence surrounding a source location into a plurality of geohash blocks, the polygon fence comprising a plurality of fence points located a predetermined distance from the source location, the plurality of geohash blocks comprising a set of inclusion points, wherein an inclusion point is a travel distance point having a travel distance from the source location less than or equal to the predetermined distance;

perform polygon merging data compression on geohash data representing the plurality of geohash blocks to form compressed geohash data, the geohash data representing the plurality of geohash blocks via a tree data structure having at least a parent geohash block and children geohash blocks common to the parent geohash block, the compressed geohash data representing the set of inclusion points, wherein performing polygon merging data compression on the geohash data includes removing the children geohash blocks common to the parent geohash block based on a determination that a number of the children geohash blocks common to the parent geohash block is greater than or equal to an expected number of children blocks; and

store the compressed geohash data in a data storage device, wherein a delivery address corresponding to at least one inclusion point within the polygon fence is approved for last mile delivery from the source location.

2. The system of claim 1 , wherein the computer-executable instructions further cause the processor to:

identify a destination address associated with delivery of at least one item from the source location within the catchment area and an actual travel distance between the source location and the destination address on condition the destination address corresponds to an inclusion point.

3. The system of claim 1 , wherein the computer-executable instructions further cause the processor to:

identify a plurality of source locations approved for last mile delivery to a destination address based on stored geohash data for the plurality of source locations; and

display, via a user interface device, the plurality of source locations as candidate source locations for last mile delivery to the destination address.

4. The system of claim 3 , wherein the instructions to identify the plurality of source locations approved for last mile delivery to the destination address include instructions to:

compare a location of the destination address with stored inclusion travel point(s) associated with a given source location to determine whether the given source location is eligible for last mile delivery to the destination address.

5. The system of claim 3 , wherein the instructions to identify the plurality of source locations approved for last mile delivery to the destination address further include instructions to:

compare an actual travel distance between the destination address and a given source location with a predetermined distance to determine whether the given source location is eligible for last mile delivery to the destination address.

6. The system of claim 5 , wherein the instructions to display, via the user interface device, the plurality of source locations as candidates for last mile delivery to the destination address include instructions to:

exclude the given source location from the plurality of source locations displayed as candidates for last mile delivery to the destination address responsive to determining that the actual travel distance from the given source location to the destination address is greater than the predetermined distance.

7. A method comprising:

dividing a catchment area within a polygon fence surrounding a source location into a plurality of geohash blocks, the polygon fence comprising a plurality of fence points located a predetermined distance from the source location, the plurality of geohash blocks comprising a set of inclusion points, wherein an inclusion point is a travel distance point having a travel distance from the source location less than or equal to the predetermined distance;

performing polygon merging data compression on geohash data representing the plurality of geohash blocks to form compressed geohash data, the geohash data representing the plurality of geohash blocks via a tree data structure having at least a parent geohash block and children geohash blocks common to the parent geohash block, the compressed geohash data representing the set of inclusion points, wherein performing polygon merging data compression on the geohash data includes removing the children geohash blocks common to the parent geohash block based on a determination that a number of the children geohash blocks common to the parent geohash block is greater than or equal to an expected number of children blocks; and

storing the compressed geohash data in a data storage device, wherein a delivery address corresponding to at least one inclusion point within the polygon fence is approved for last mile delivery from the source location.

8. The method of claim 7 , further comprising:

identifying a destination address associated with delivery of at least one item from the source location within the catchment area and an actual travel distance between the source location and the destination address on condition the destination address corresponds to an inclusion point.

9. The method of claim 7 , further comprising:

identifying a plurality of source locations approved for last mile delivery to a destination address based on stored geohash data for the plurality of source locations; and

displaying, via a user interface device, the plurality of source locations as candidate source locations for last mile delivery to the destination address.

10. The method of claim 9 , wherein identifying the plurality of source locations approved for last mile delivery to the destination address comprises:

comparing a location of the destination address with stored inclusion travel point(s) associated with a given source location to determine whether the given source location is eligible for last mile delivery to the destination address.

11. The method of claim 9 , wherein identifying the plurality of source locations approved for last mile delivery to the destination address comprises:

comparing an actual travel distance between the destination address and a given source location with a predetermined distance to determine whether the given source location is eligible for last mile delivery to the destination address.

12. The method of claim 11 , wherein displaying, via the user interface device, the plurality of source locations as candidates for last mile delivery to the destination address comprises:

excluding the given source location from the plurality of source locations displayed as candidates for last mile delivery to the destination address responsive to determining that the actual travel distance from the given source location to the destination address is greater than the predetermined distance.

13. One or more computer storage devices having computer-executable instructions stored thereon, which, on execution by a computer, cause the computer to perform operations comprising:

dividing a catchment area within a polygon fence surrounding a source location into a plurality of geohash blocks, the polygon fence comprising a plurality of fence points located a predetermined distance from the source location, the plurality of geohash blocks comprising a set of inclusion points, wherein an inclusion point is a travel distance point having a travel distance from the source location less than or equal to the predetermined distance;

performing polygon merging data compression on geohash data representing the plurality of geohash blocks to form compressed geohash data, the geohash data representing the plurality of geohash blocks via a tree data structure having at least a parent geohash block and children geohash blocks common to the parent geohash block, the compressed geohash data representing the set of inclusion points, wherein performing polygon merging data compression on the geohash data includes removing the children geohash blocks common to the parent geohash block based on a determination that a number of the children geohash blocks common to the parent geohash block is greater than or equal to an expected number of children blocks; and

storing the compressed geohash data in a data storage device, wherein a delivery address corresponding to at least one inclusion point within the polygon fence is approved for last mile delivery from the source location.

14. The one or more computer storage devices of claim 13 , wherein the operations further comprise:

identifying a destination address associated with delivery of at least one item from the source location within the catchment area and an actual travel distance between the source location and the destination address on condition the destination address corresponds to an inclusion point.

15. The one or more computer storage devices of claim 13 , wherein the operations further comprise:

identifying a plurality of source locations approved for last mile delivery to a destination address based on stored geohash data for the plurality of source locations; and

displaying, via a user interface device, the plurality of source locations as candidate source locations for last mile delivery to the destination address.

16. The one or more computer storage devices of claim 15 , wherein identifying the plurality of source locations approved for last mile delivery to the destination address comprises:

comparing a location of the destination address with stored inclusion travel point(s) associated with a given source location to determine whether the given source location is eligible for last mile delivery to the destination address.

17. The one or more computer storage devices of claim 15 , wherein identifying the plurality of source locations approved for last mile delivery to the destination address comprises:

comparing an actual travel distance between the destination address and a given source location with a predetermined distance to determine whether the given source location is eligible for last mile delivery to the destination address.

18. The one or more computer storage devices of claim 17 , wherein displaying, via the user interface device, the plurality of source locations as candidates for last mile delivery to the destination address comprises:

excluding the given source location from the plurality of source locations displayed as candidates for last mile delivery to the destination address responsive to determining that the actual travel distance from the given source location to the destination address is greater than the predetermined distance.

Assignments (2)
CORRECTIVE ASSIGNMENT TO CORRECT THE NAME OF SECOND INVENTOR AND EXECUTION DATES FOR EACH INVENTOR PREVIOUSLY RECORDED AT REEL: 055932 FRAME: 0662. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Nov 2, 2021
From: KUMAR, SINDIRI SAI; BATCHU, RAVIKUMAR; GUPTA, TANVI; SARAF, RISHI; RAM, MANFUL
To: WALMART APOLLO, LLC
Reel/Frame 058769/0380 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 15, 2021
From: SARAF, RISHI; KUMAR, SINDIRI SAI; KUMAR, BATCHU RAVI; GUPTA, TANVI; RAM, MANFUL
To: WALMART APOLLO, LLC
Reel/Frame 055932/0662 →
Continuity (1)
Related Publication 20220335380A1 · Oct 20, 2022
References Cited (15)
US 9465811B2 · Basovnik et al. · 2016 [cited by applicant]
US 10317219B1 · Borgerson et al. · 2019 [cited by applicant]
US 10432311B1 · Poon · 2019 [cited by examiner]
US 10638264B1 · Pao et al. · 2020 [cited by applicant]
US 10810235B1 · Bakshi · 2020 [cited by examiner]
US 20020007321A1 · Burton · 2002 [cited by examiner]
US 20130187915A1 · Lee · 2013 [cited by examiner]
US 20140274154A1 · Rana · 2014 [cited by examiner]
US 20160189102A1 · Schreiber · 2016 [cited by examiner]
US 20190228377A1 · Pande · 2019 [cited by examiner]
US 20200193550A1 · Colonna · 2020 [cited by examiner]
US 20200351655A1 · Sunkavally · 2020 [cited by examiner]
US 20200356114A1 · Uçar · 2020 [cited by examiner]
Hwang, Richard et al., “How we Designed Road Distances in DoorDash Search”, https://medium.com/@DoorDash/how-we-designed-road-distances-in-doordash-search-913ef8434099, Sep. 23, 2017, 6 pages. [cited by applicant]
Nair Ashwin, “GeoRaptor: Python Geohash Compression Tool”, GitHub, https://github.com/ashwin711/georaptor, captured Dec. 22, 2020, 4 pages. [cited by applicant]