Local shopping and inventory

• US 8,392,261 B2
• Filed: 03/23/2011
• Issued: 03/05/2013
• Est. Priority Date: 07/15/2010
• Status: Expired due to Fees

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: Google Inc. (Alphabet Inc.)
• Inventors: Lee, Paul, Moisa, Dan, Konglathu, John Alexander, Gene Sokolov, Gene
• Primary Examiner(s): Zeender, Ryan
• Assistant Examiner(s): Wilder, Hunter
• Application Number:
  US13/070,344
• Publication Number:
  US 20120016780A1
• Time in Patent Office: 713 Days
• Field of Search: 705/16, 705/22, 705/26.1, 705/28
• US Class Current: 705/22
• CPC Class Codes: G06Q 10/087 Inventory or stock management, e.g. order filling, procurement or balancing against orders

Abstract

Estimating product inventory comprises determining a rate of sales events for a product and an amount of time that has elapsed since a previous product availability estimate from the product. Then, a new product availability estimate for the product is determined based on the rate sales events for the product. The rate of sales events for the product can be determined based on product data feeds from the merchant or other sales data.

Claims

1. A computer-implemented method for providing a

product availability indicator, comprising:

receiving, by a computer, point of sale (POS) data, the POS data identifying a product that was sold, a quantity of the product that was sold, a store at which the product was sold, and a first timestamp corresponding to the time at which the product was sold;

determining, by the computer, based at least on the quantity of the product that was sold and the first timestamp, a rate of sales (r_s) for the product at the store;

receiving, by the computer, an inventory snapshot, wherein the inventory snapshot reflects the inventory (Q) of the product at the store at a first time (T1), and wherein receipt of the inventory snapshot occurs at a second time (T2) subsequent to the first time;

determining, by the computer, a probability that fewer than Q products were sold between times T1 and T2, wherein the probability is based at least on the rate of sales (r_s), the first time (T1), and the second time (T2), and wherein (x=r_sΔ

T), (Δ

T=T2−

T1), (N=Q−

1), and the probability that fewer than Q products were sold between times T1 and T2 is determined according to an equation

2. The method of claim 1, wherein the rate of sales (r_s) is determined according to an exponential moving average.

3. The method of claim 2, wherein the rate of sales (r_s) is determined by an equation <

u>

/<

t>

, where <

u>

is determined recursively as

<

u>

_i=(1−

j)*<

u>

_i-1+j*u_i,

and <

t>

is determined recursively as

<

t>

_i=(1−

k)*<

t>

_i-1+k*t_i,

such that u_i is the number of units sold during sales event i, t_i is a period of time between sales events i and i-1, j is a constant in a range 0<

j<

1, and k is a constant in a range 0<

k<

1.

4. The method of claim 3, wherein j is in a range 0.02≦

j≦

0.5.

5. The method of claim 3, wherein k is in a range 0.03≦

k≦

0.1.

6. The method of claim 3, wherein j and k are equal.

7. The method of claim 1, wherein the first and second probability thresholds are the same threshold.

8. A computer-implemented method for providing a

product availability indicator, comprising:

receiving, by a computer, point of sale (POS) data, the POS data identifying a product that was sold, a quantity of the product that was sold, a store at which the product was sold, and a first timestamp corresponding to the time at which the product was sold;

determining, by the computer, based at least on the quantity of the product that was sold and the first timestamp, a rate of sales (r_s) for the product at the store;

receiving, by the computer, an inventory snapshot, wherein the inventory snapshot reflects the inventory (Q) of the product at the store at a first time (T1), and wherein receipt of the inventory snapshot occurs at a second time (T2) subsequent to the first time;

determining, by the computer, a probability that fewer than Q products were sold between times T1 and T2 wherein (x=r_sΔ

T), (Δ

T=T2−

T1), (N=Q−

1), and the probability that fewer than Q products were sold between times T1 and T2 is determined according to an equation

9. The method of claim 8, wherein the first and second probability thresholds are consistent for all products sold by the store.

10. The method of claim 8, wherein the first and second probability thresholds are static.

11. The method of claim 8, wherein the first probability threshold is not the same as the second probability threshold.

12. The method of claim 11, wherein the second probability threshold is less than the first probability threshold, the method further comprising the step of providing an “

unknown”

indicator when the probability is less than the first probability threshold and greater than a second probability threshold.

13. The method of claim 8, wherein the rate of sales (r_s) is determined according to an exponential moving average.

14. The method of claim 13, wherein the rate of sales (r_s) is determined by an equation <

u>

/<

t>

, where <

u>

is determined recursively as

<

u>

_i=(1−

j)*<

u>

_i-1+j*u_i,

and <

t>

is determined recursively as

<

t>

_i=(1−

k)*<

t>

_i-1+k*t_i,

such that u_i is the number of units sold during sales event i, t_i is a period of time between sales events i and i-1, j is a constant in a range 0<

j<

1, and k is a constant in a range 0<

k<

1.

15. The method of claim 14, wherein j is in a range 0.02≦

j≦

0.5.

16. The method of claim 14, wherein k is in a range 0.03≦

k≦

0.1.

17. The method of claim 14, wherein j and k are equal.

18. A product availability estimation system, comprising:

a storage resource;

a network module;

a processor communicatively coupled to the storage resource and the network module, wherein the processor executes application code instructions that are stored in the storage resource and that cause the product availability estimation system to;

receive, via the network module, a periodic inventory snapshot, wherein the inventory snapshot reflects the inventory (Q) of a product at a store at a first time (T1), and wherein receipt of the inventory snapshot occurs at a second time (T2) subsequent to the first time;

store, into the storage resource, the inventory (Q) and the value (Δ

T=T2−

T1) in a data object corresponding to the product and the store;

receive, via the network module, real-time point of sale (POS) data, the POS data identifying the product, the store, a quantity of the product that was sold, and a first timestamp corresponding to the time at which the product was sold;

retrieve, from the storage resource, the data object corresponding to the product and store, wherein the data object comprises a first rate field indicating an average number of units sold in a sales event for the product, a second rate field indicating an average time between sales events for the product, a timestamp field corresponding to the time of the last sale of the product, a quantity field corresponding to the stored inventory (Q), and a Δ

T field corresponding to the stored value (Δ

T=T2−

T1);

determine a probability that fewer than Q products were sold between times T1 and T2 according to an equation

19. The system of claim 18, wherein the first and second probability thresholds are the same threshold.

20. The system of claim 18, wherein the rate of sales (r_s) is determined according to an exponential moving average.

21. The system of claim 20, wherein the rate of sales (r_s) is determined by an equation <

u>

/<

t>

, where <

u>

is determined recursively as

<

u>

₁=(1−

j)*<

u>

_i-1+j*u_i,

and <

t>

is determined recursively as

<

t>

_i=(1−

k)*<

t>

_i-1+k*t_i,

such that u_i is the number of units sold during sales event i, t_i is a period of time between sales events i and i-1, j is a constant in a range 0<

j<

1, and k is a constant in a range 0<

k<

1.

22. The system of claim 21, wherein j is in a range 0.02≦

j≦

0.5.

23. The system of claim 21, wherein k is in a range 0.03≦

k≦

0.1.

24. The system of claim 21, wherein j and k are equal.

25. A computer program product for use in conjunction with a computer system having a network interface and a storage resource, the computer program product comprising a computer readable storage medium and a computer program mechanism embedded therein, the computer program mechanism comprising:

instructions for receiving, via the network interface, real-time point of sale (POS) data, the POS data identifying a product that was sold, a quantity of the product that was sold, a store at which the product was sold, and a first timestamp corresponding to the time at which the product was sold;

instructions for determining, based at least on the quantity of the product that was sold and the first timestamp, a rate of sales (r_s) for the product at the store;

instructions for receiving, via the network interface, an inventory snapshot, wherein the inventory snapshot reflects the inventory (Q) of the product at the store at a first time (T1), and wherein receipt of the inventory snapshot occurs at a second time (T2) subsequent to the first time;

instructions for determining a probability that fewer than Q products were sold between times T1 and T2, wherein the probability is based at least on the rate of sales (r_s), the first time (T1), and the second time (T2), and wherein (x=r_sΔ

T), (Δ

T=T2−

T1), (N=Q−

1), and the probability that fewer than Q products were sold between times T1 and T2 is determined according to an equation

26. The computer program product of claim 25, wherein the first and second probability thresholds are the same threshold.

27. The computer program product of claim 25, wherein the rate of sales (r_s) is determined according to an exponential moving average.

28. The computer program product of claim 27, wherein the rate of sales (r_s) is determined by an equation <

u>

/<

t>

, where <

u>

is determined recursively as

<

u>

_i=(1−

j)*<

u>

_i-1+j*u_i,

and <

t>

is determined recursively as

<

t>

_i=(1−

k)*<

t>

_i-1+k*t_i,

such that u_i is the number of units sold during sales event i, t_i is a period of time between sales events i and i-1, j is a constant in a range 0<

j<

1, and k is a constant in a range 0<

k<

1.

29. The computer program product of claim 28, wherein j is in a range 0.02≦

j≦

0.5.

30. The computer program product of claim 28, wherein k is in a range 0.03≦

k≦

0.1.

31. The computer program product of claim 28, wherein j and k are equal.

36. The system of claim 25, wherein j is in a range 0.02≦

j≦

0.5.

32. A product availability estimation system, comprising:

a storage resource;

a network module;

a means for determining a rate of sales (r_s) for a product at a store based on received point of sale (POS) data;

a means for determining a probability that fewer than a quantity (Q) products were sold between a first time (T1) and a second time (T2), wherein the probability is based at least on the rate of sales (r_s), the first time (T1), and the second time (T2), wherein the quantity (Q), the first time (T1), and the second time (T2) correspond to a received periodic inventory snapshot, and wherein (x=r_sΔ

T), (Δ

T=T2−

T1), (N=Q−

1 and the probability that fewer than 0 products were sold between times T1 and T2 is determined according to an equation

33. The system of claim 32, wherein the first and second probability thresholds are the same threshold.

34. The system of claim 32, wherein the rate of sales (r_s) is determined according to an exponential moving average.

35. The system of claim 34, wherein the rate of sales (r_s) is determined by an equation <

u>

/<

t>

, where <

u>

is determined recursively as

<

u_i>

=(1−

j)*<

u>

_i-1+j*u_i,

and <

t>

is determined recursively as

<

t>

_i=(1−

k)*<

t>

_i-1+k*t_i,

such that u_i is the number of units sold during sales event i, t_i is a period of time between sales events i and i-1, j is a constant in a range 0<

j<

1, and k is a constant in a range 0<

k<

1.

37. The system of claim 35, wherein k is in a range 0.03≦

k≦

0.1.

38. The system of claim 35, wherein j and k are equal.