IP Library Granted Patent US 9,928,455
Granted Patent B2
US 9,928,455 · App. 15/122,576 · Granted Mar 27, 2018

Container and code of system for preparing a beverage or foodstuff

Inventor: Jean-Marc Flick (Pomy, CH)
Assignee: Nestec S.A.
G06K19/067A23L5/00A47J31/4492G06K7/065G06K19/06018G06K19/06028G06K19/06168A23V2002/00
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 9,928,455
App. No.
15/122,576
Granted
Mar 27, 2018
Kind
B2
Abstract

Containers for a foodstuff or beverage preparation machine that includes beverage or foodstuff preparation material and a code encoding preparation information are disclosed. Beverage or foodstuff preparation machines and systems that can be utilized with the container are also disclosed. Methods of producing and using the containers, machines, and systems are also disclosed.

Claims (63)

1. A container for a foodstuff or beverage preparation machine, the container for containing beverage or foodstuff preparation material and comprising a code encoding preparation information, the code comprising:

a data sequence having a plurality of marker locations, whereby said marker locations either comprise or do not comprise a marker as a variable to at least partially encode the preparation information therein, with adjacent marker locations separated by a fixed distance of Δx, characterized in that the code further comprises:

a locator sequence to enable location of the data sequence, the locator sequence comprising two adjacent markers, whereby a distance X4 therebetween is distinct from the fixed distance Δx;

an end portion for identification of an end of the data sequence, the end portion comprising a marker and a marker location at the end of the data sequence, wherein a distance X3 therebetween is distinct from the fixed distance Δx and the distance X4; and

a calibration sequence having two adjacent markers with a distance of X1 therebetween, whereby X1 is a non-integer multiple or an integer multiple of the fixed distance Δx, the X1 distance being distinct from the X4 distance and the X3 distance.

2. The container according to claim 1 , wherein adjacent marker locations of the data sequence are equally spaced such that Δx is a fixed amount and adjacent edges of adjacent marker locations are at least 20% of a width of a marker location apart.

3. The container according to claim 1 , wherein the distance X1 of the calibration sequence is an integer multiple of the fixed Δx distance.

4. The container according to claim 1 , wherein the markers of the code are arranged sequentially to each other and radially on a single circumferentially extending line, which extends about an axis of rotation of the container or other rotational axis on a surface thereof.

5. The container according to claim 1 , wherein the markers of the code are formed by electrically conductive portions.

6. The container according to claim 1 , wherein the code is formed on a surface of the container or on an attachment, which is attached thereto.

7. The container according to claim 1 , wherein the container comprises one of the following: a capsule; a packet; a receptacle for consumption of the beverage or foodstuff therefrom.

8. A beverage or foodstuff preparation machine, said preparation machine comprising:

a preparation unit to receive a container according to any one of claim 1 , 2 , 3 , 4 , 5 , 6 , or 7 and to prepare a beverage or foodstuff therefrom;

a code processing system operable to: reading a code of said container or an attachment of the container or the machine to obtain encoded preparation information, process the encoded preparation information to decode said information;

a control system operable to control the preparation unit using said decoded preparation information;

wherein the code processing system is configured to process the encoded preparation information to locate one or more code reads therein by locating markers that are a predetermined distance X4 apart, and for the or each located code read(s) to determine the presence of a marker at each marker location of the data sequence, and is further configured to determine an end of the data sequence by locating an end portion of the data sequence by locating an X3 distance between a marker location of the data sequence and a marker of the end portion.

9. An attachment configured for attachment to a container for a beverage or foodstuff preparation machine according to claim 8 , the attachment comprising:

a carrier carrying on a surface thereof a code encoding preparation information, the code comprising a data sequence having a plurality of marker locations, whereby said marker locations either comprise or do not comprise a marker as a variable to at least partially encode the preparation information therein, with adjacent marker locations separated by the fixed distance of Δx, and wherein the code further comprises:

a locator sequence to enable location of the data sequence, the locator sequence comprising two adjacent markers, whereby a distance X4 therebetween is distinct from the fixed distance Δx; and

an end portion for identification of an end of the data sequence, the end portion comprising a marker and a marker location at the end of the data sequence, wherein a distance X3 therebetween is distinct from the fixed distance Δx and the distance X4; and

an attachment member for attachment to said container.

10. A non-transitory computer readable medium comprising program code to:

obtain encoded preparation information of a code of an attachment according to claim 9 ;

process the encoded preparation information to decode said information; and

wherein the program code is configured to process the encoded preparation information to locate one or more code reads therein by locating markers that are a predetermined distance X4 apart, and for each located code read(s) to determine the presence of a marker at each marker location of the data sequence; and

wherein the program code is further configured to determine an end of the data sequence by locating an end portion of the data sequence by locating an X3 distance between a marker location of the data sequence and a marker of the end portion.

11. An attachment configured for attachment to a beverage or foodstuff preparation machine according to claim 8 , the attachment comprising:

a carrier carrying on a surface thereof a code encoding preparation information, the code comprising a data sequence having a plurality of marker locations, whereby said marker locations either comprise or do not comprise a marker as a variable to at least partially encode the preparation information therein, with adjacent marker locations separated by the fixed distance of Δx, and wherein the code further comprises:

a locator sequence to enable location of the data sequence, the locator sequence comprising two adjacent markers, whereby a distance X4 therebetween is distinct from the fixed distance Δx; and

an end portion for identification of an end of the data sequence, the end portion comprising a marker and a marker location at the end of the data sequence, wherein a distance X3 therebetween is distinct from the distance fixed Δx and the distance X4; and

an attachment member for attachment to said machine.

12. A non-transitory computer readable medium comprising program code to:

obtain encoded preparation information of a code of an attachment according to claim 11 ;

process the encoded preparation information to decode said information; and

wherein the program code is configured to process the encoded preparation information to locate one or more code reads therein by locating markers that are a predetermined distance X4 apart, and for each located code read(s) to determine the presence of a marker at each marker location of the data sequence; and

wherein the program code is further configured to determine an end of the data sequence by locating an end portion of the data sequence by locating an X3 distance between a marker location of the data sequence and a marker of the end portion.

13. A beverage or foodstuff preparation system comprising:

a container according to any one of claim 1 , 2 , 3 , 4 , 5 , 6 , or 7 ;

a preparation unit to receive the container and to prepare a beverage or foodstuff therefrom;

a code processing system operable to: reading a code of said container and decoding preparation information contained therein; and

a control system operable to control the preparation unit using said decoded preparation information;

wherein the code processing system is configured to process the encoded preparation information to locate one or more code reads therein by locating markers that are a predetermined distance X4 apart, and for the or each located code read(s) to determine the presence of a marker at each marker location of the data sequence, and is further configured to determine an end of the data sequence by locating an end portion of the data sequence by locating an X3 distance between a marker location of the data sequence and a marker of the end portion.

14. A method of preparing a beverage or foodstuff using the system according to claim 13 , the method comprising:

reading the code of the container or an attachment of the container or machine to obtain encoded preparation information;

processing the encoded preparation information to decode said information;

controlling a preparation operation using said preparation information;

wherein processing the encoded preparation information comprises locating one or more code reads therein by locating markers that are a predetermined distance X4 apart, and for each of the located code read(s);

determining the presence of a marker at each marker location of the data sequence; and

determining an end of the data sequence by locating an end portion of the data sequence by locating an X3 distance between a marker location of the data sequence and a marker of the end portion.

15. A non-transitory computer readable medium comprising program code to:

obtain encoded preparation information of a code of a container according any one of claim 1 , 2 , 3 , 4 , 5 , 6 , or 7 ;

process the encoded preparation information to decode said information; and

wherein the program code is configured to process the encoded preparation information to locate one or more code reads therein by locating markers that are a predetermined distance X4 apart, and for each located code read(s) to determine the presence of a marker at each marker location of the data sequence; and

wherein the program code is further configured to determine an end of the data sequence by locating an end portion of the data sequence by locating an X3 distance between a marker location of the data sequence and a marker of the end portion.

16. A method of encoding preparation information, the method comprising:

arranging a code on at least one of:

a container for a food stuff or beverage preparation machine, the container for containing beverage or foodstuff material; or

an attachment for attachment to said container or said foodstuff or beverage preparation machine;

wherein the code comprises:

a data sequence having a plurality of marker locations, whereby said marker locations either comprise or do not comprise a marker as a variable to at least partially encode the preparation information therein, with adjacent marker locations separated by a fixed distance of Δx;

a locator sequence to enable location of the data sequence, the locator sequence comprising two adjacent markers, whereby a distance X4 therebetween is distinct from the fixed distance Δx;

an end portion for identification of an end of the data sequence, the end portion comprising a marker and a marker location at the end of the data sequence, wherein a distance X3 therebetween is distinct from the fixed distance Δx and the distance X4; and

a calibration sequence having two adjacent markers with a distance of X1 therebetween, whereby X1 is a non-integer multiple or an integer multiple of the fixed distance Δx, the X1 distance being distinct from the X4 distance and the X3 distance.

Assignments (5)
CORRECTIVE ASSIGNMENT TO CORRECT THE PATENT NUMBER 16062921 PREVIOUSLY RECORDED ON REEL 049391 FRAME 0756. ASSIGNOR(S) HEREBY CONFIRMS THE PATENT NUMBER SHOULD HAVE BEEN 16062912. Recorded Jul 3, 2020
From: NESTEC S.A.
To: SOCIÉTÉ DES PRODUITS NESTLÉ S.A.
Reel/Frame 054082/0001 →
CORRECTIVE ASSIGNMENT TO CORRECT THE PATENT NUMBER 16062921 PREVIOUSLY RECORDED ON REEL 049391 FRAME 0756. ASSIGNOR(S) HEREBY CONFIRMS THE PATENT NUMBER SHOULD HAVE BEEN 16062912. Recorded Jul 3, 2020
From: NESTEC S.A.
To: SOCIÉTÉ DES PRODUITS NESTLÉ S.A.
Reel/Frame 054082/0165 →
CORRECTIVE ASSIGNMENT TO CORRECT THE ENGLISH TRANSLATION TO SHOW THE FULL AND CORRECT NEW NAME IN SECTION 51. PREVIOUSLY RECORDED AT REEL: 049391 FRAME: 0756. ASSIGNOR(S) HEREBY CONFIRMS THE MERGER. Recorded Jun 13, 2019
From: NESTEC S.A.
To: SOCIÉTÉ DES PRODUITS NESTLÉ S.A.
Reel/Frame 049853/0398 →
MERGER Recorded Jun 6, 2019
From: NESTEC S.A.
To: SOCIÉTÉ DES PRODUITS NESTLÉ S.A.
Reel/Frame 049391/0756 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 30, 2016
From: FLICK, JEAN-MARC
To: NESTEC S.A.
Reel/Frame 039588/0314 →
Priority Claims (2)
EP 14168063 · May 13, 2014 · regional
EP 15151956 · Jan 21, 2015 · regional
Continuity (1)
Related Publication 20170068878A1 · Mar 9, 2017