IP Library Granted Patent US 12,277,614
Granted Patent B2
US 12,277,614 · App. 18/492,592 · Granted Apr 15, 2025

Non-sequential restaurant order system and method

Inventor: David C. Fox (College Station, TX)
Assignee: Blue Baker, LLC
G06Q50/12G06Q30/0621G06Q30/0635G06Q30/0641
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,277,614
App. No.
18/492,592
Granted
Apr 15, 2025
Kind
B2
Abstract

Systems and restaurant locations for use with a mobile ordering system, and methods thereof, to provide at least more time-efficient pick up of orders by customers than with traditional ordering and pick up windows.

Claims (43)

1. A method for scheduling an order for a customer, the method comprising the steps of:

receiving, at a data processor, at least one ordered menu selection;

transmitting, by the data processor using a network interface device connected to a network, the at least one ordered menu selection to a plurality of interconnected restaurant location servers that uses a feedback loop to update an overall order queue used for selecting a restaurant location to prepare the at least one ordered menu selection;

generating, at the data processor, an estimated preparation time of the at least one ordered menu selection;

based on a determined geographic location of at least one delivery service and the selected restaurant location, assigning, by the data processor, the at least one delivery service to deliver the at least one ordered menu selection from the selected restaurant location to a location of a user that made the at least one ordered menu selection;

sending, by the data processor using the network interface device connected to the network, the estimated preparation time to the at least one delivery service;

receiving, at the data processor, a request for starting to prepare the at least one ordered menu selection from the at least one delivery service; and

transmitting tracking information of the at least one delivery service for presentation on a computing device of the user.

2. The method of claim 1 , wherein the request received from the at least one assigned delivery service is transmitted with an estimated arrival time for pick-up of the at least one assigned delivery service.

3. The method of claim 2 , further comprising the step of comparing, at the data processor, the estimated arrival time for the pick-up with the estimated preparation time of the at least one ordered menu selection.

4. The method of claim 3 , wherein when the estimated arrival time for the pick-up is less than or equal to the estimated preparation time of the at least one ordered menu selection, the at least one ordered menu selection is immediately started to prepare for the pick-up.

5. The method of claim 3 , wherein when the estimated arrival time for the pick-up is greater than the estimated preparation time of the at least one ordered menu selection, the at least one ordered menu selection is started to prepare for the pick-up within a time determined by a difference between the estimated arrival time and the estimated preparation time.

6. The method of claim 1 , wherein the at least one delivery service includes a driverless delivery system and/or a delivery system with a driver.

7. The method of claim 6 , wherein the driverless delivery system sends the request for starting to prepare the at least one ordered menu selection when the driverless delivery system is in route for the pick-up.

8. The method of claim 1 , wherein the estimated preparation time is determined based on factors including a complexity of the order, a skill level of one or more staff members preparing the order, or some combination thereof to generate the estimated preparation time of the at least one ordered menu selection.

9. The method of claim 1 , wherein the at least one ordered menu selection comprises one or more of a food selection and a beverage selection.

10. A system for scheduling an order for a customer, the system comprising:

a memory storing instructions;

a processor communicatively coupled to the memory, wherein the processor executes the instructions to:

receive, at a data processor, at least one ordered menu selection;

transmit, by the data processor using a network interface device connected to a network, the at least one ordered menu selection to a plurality of interconnected restaurant location servers that uses a feedback loop to update an overall order queue used for selecting a restaurant location to prepare the at least one ordered menu selection;

generate, at the data processor, an estimated preparation time of the at least one ordered menu selection;

based on a determined geographic location of at least one delivery service and the selected restaurant location, assign, by the data processor, the at least one delivery service to deliver the at least one ordered menu selection from the selected restaurant location to a location of a user that made the at least one ordered menu selection;

send, by the data processor using the network interface device connected to the network, the estimated preparation time to the at least one delivery service;

receive, at the data processor, a request for starting to prepare the at least one ordered menu selection from the at least one delivery service; and

transmit tracking information of the at least one delivery service for presentation on a computing device of the user.

11. The system of claim 10 , wherein the request received from the at least one delivery service is transmitted with an estimated arrival time for pick-up of the at least one delivery service.

12. The system of claim 11 , wherein the processor further executes the instructions to compare the estimated arrival time for the pick-up with the estimated preparation time of the at least one ordered menu selection.

13. The system of claim 12 , wherein when the estimated arrival time for the pick-up is less than or equal to the estimated preparation time of the at least one ordered menu selection, the at least one ordered menu selection is immediately started to prepare for the pick-up.

14. The system of claim 12 , wherein when the estimated arrival time for the pick-up is greater than the estimated preparation time of the at least one ordered menu selection, the at least one ordered menu selection is started to prepare for the pick-up within a time determined by a difference between the estimated arrival time and the estimated preparation time.

15. The system of claim 10 , wherein the at least one delivery service includes a driverless delivery system and/or a delivery system with a driver.

16. A tangible, non-transitory computer-readable medium storing instructions that, when executed, cause a processor to:

receive, at a data processor, at least one ordered menu selection;

transmit, by the data processor using a network interface device connected to a network, the at least one ordered menu selection to a plurality of interconnected restaurant location servers that uses a feedback loop to update an overall order queue used for selecting a restaurant location to prepare the at least one ordered menu selection;

generate, at the data processor, an estimated preparation time of the at least one ordered menu selection;

based on a determined geographic location of at least one delivery service and the selected restaurant location, assign, by the data processor, the at least one delivery service to deliver the at least one ordered menu selection from the selected restaurant location to a location of a user that made the at least one ordered menu selection;

send, by the data processor using the network interface device connected to the network, the estimated preparation time to the at least one delivery service;

receive, at the data processor, a request for starting to prepare the at least one ordered menu selection from the at least one delivery service; and

transmit tracking information of the at least one delivery service for presentation on a computing device of the user.

17. The computer-readable medium of claim 16 , wherein the request received from the at least one delivery service is transmitted with an estimated arrival time for pick-up of the at least one delivery service.

18. The computer-readable medium of claim 17 , wherein the processor compares the estimated arrival time for the pick-up with the estimated preparation time of the at least one ordered menu selection.

19. The computer-readable medium of claim 18 , wherein when the estimated arrival time for the pick-up is less than or equal to the estimated preparation time of the at least one ordered menu selection, the at least one ordered menu selection is immediately started to prepare for the pick-up.

20. The computer-readable medium of claim 18 , wherein when the estimated arrival time for the pick-up is greater than the estimated preparation time of the at least one ordered menu selection, the at least one ordered menu selection is started to prepare for the pick-up within a time determined by a difference between the estimated arrival time and the estimated preparation time.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 27, 2025
From: FOX, DAVID C.
To: BLUE BAKER, LLC
Reel/Frame 072589/0466 →
Continuity (6)
Continuation 18090161 · Dec 28, 2022
Continuation In Part 17532077 · Nov 22, 2021
Continuation 16504123 · Jul 5, 2019
Continuation In Part 15168952 · May 31, 2016
Provisional Application 62191772 · Jul 13, 2015
Related Publication 20240054579A1 · Feb 15, 2024
References Cited (77)
US 5969968A · Pentel · 1999 [cited by applicant]
US 6366220B1 · Elliott · 2002 [cited by applicant]
US 6425524B2 · Pentel et al. · 2002 [cited by applicant]
US 6585516B1 · Alabaster · 2003 [cited by applicant]
US 6940393B2 · Dev et al. · 2005 [cited by applicant]
US 7680690B1 · Catalano · 2010 [cited by applicant]
US 7895797B2 · Bridgman et al. · 2011 [cited by applicant]
US 7992355B2 · Bridgman et al. · 2011 [cited by applicant]
US 8059029B2 · Juang · 2011 [cited by applicant]
US 8190483B2 · Woycik et al. · 2012 [cited by applicant]
US 8280775B2 · Armstrong · 2012 [cited by applicant]
US 8650095B1 · Shimoff et al. · 2014 [cited by applicant]
US 8660906B2 · Woycik et al. · 2014 [cited by applicant]
US 9105041B2 · Harman · 2015 [cited by applicant]
US 9129289B2 · Vaughn · 2015 [cited by examiner]
US 9406084B2 · Havas · 2016 [cited by applicant]
US 10026055B2 · Riel-Dalpe et al. · 2018 [cited by applicant]
US 10204373B2 · Pugh et al. · 2019 [cited by applicant]
US 10321263B1 · Alkarmi et al. · 2019 [cited by applicant]
US 10360616B2 · Lopez et al. · 2019 [cited by applicant]
US 10445819B2 · Renfroe · 2019 [cited by applicant]
US 10572476B2 · Skinder · 2020 [cited by applicant]
US 10679278B2 · Harman · 2020 [cited by applicant]
US 10740715B1 · Kumar et al. · 2020 [cited by applicant]
US 20020138350A1 · Cogen · 2002 [cited by applicant]
US 20020188492A1 · Borton · 2002 [cited by applicant]
US 20030046166A1 · Liebman · 2003 [cited by applicant]
US 20040044578A1 · Kim et al. · 2004 [cited by applicant]
US 20050108097A1 · McAleenan · 2005 [cited by applicant]
US 20060006025A1 · Dev et al. · 2006 [cited by applicant]
US 20060085266A1 · Wei et al. · 2006 [cited by applicant]
US 20060178943A1 · Rollinson et al. · 2006 [cited by applicant]
US 20060218043A1 · Rosenzweig et al. · 2006 [cited by applicant]
US 20070061209A1 · Jackson · 2007 [cited by applicant]
US 20090106124A1 · Yang · 2009 [cited by applicant]
US 20090187488A1 · Shamilian · 2009 [cited by applicant]
US 20090204492A1 · Scifo · 2009 [cited by examiner]
US 20090319381A1 · Armstrong · 2009 [cited by applicant]
US 20100106607A1 · Riddiford et al. · 2010 [cited by applicant]
US 20120078673A1 · Koke et al. · 2012 [cited by applicant]
US 20120209730A1 · Garrett · 2012 [cited by applicant]
US 20130024299A1 · Wong et al. · 2013 [cited by applicant]
US 20130151380A1 · Holt · 2013 [cited by examiner]
US 20140070743A1 · Yoshida et al. · 2014 [cited by applicant]
US 20140074743A1 · Rademaker · 2014 [cited by applicant]
US 20140100971A1 · Klearman · 2014 [cited by examiner]
US 20140214465A1 · L'Heureux et al. · 2014 [cited by applicant]
US 20140279081A1 · Marx et al. · 2014 [cited by applicant]
US 20140330672A1 · Olszewski et al. · 2014 [cited by applicant]
US 20150227890A1 · Bednarek · 2015 [cited by examiner]
US 20150262121A1 · Riel-Dalpe et al. · 2015 [cited by applicant]
US 20160244311A1 · Burks · 2016 [cited by examiner]
US 20160247113A1 · Rademaker · 2016 [cited by applicant]
US 20160275470A1 · Straw et al. · 2016 [cited by applicant]
US 20170061518A1 · Cao · 2017 [cited by applicant]
US 20180012210A1 · Harman · 2018 [cited by applicant]
US 20180109908A1 · Swanson et al. · 2018 [cited by applicant]
US 20190122291A1 · Fang · 2019 [cited by examiner]
US 20190355034A1 · Moring et al. · 2019 [cited by applicant]
US 20210374885A1 · Musk et al. · 2021 [cited by applicant]
US 20220101250A1 · Wang et al. · 2022 [cited by applicant]
CA 2509734A1 · 2006 [cited by applicant]
CA 2760307A1 · 2012 [cited by applicant]
CA 2834875A1 · 2012 [cited by applicant]
CN 103745266A · 2014 [cited by applicant]
DE 10338155A1 · 2004 [cited by applicant]
EP 2551808A1 · 2013 [cited by applicant]
EP 2707848A2 · 2014 [cited by applicant]
JP 2003187115A · 2003 [cited by applicant]
KR 100597520B1 · 2006 [cited by applicant]
MX 03010839A · 2004 [cited by applicant]
WO 1999054808A1 · 1999 [cited by applicant]
WO 2000039722A1 · 2000 [cited by applicant]
WO 2008071979A1 · 2008 [cited by applicant]
WO 2009126266A3 · 2009 [cited by applicant]
International Search Report and Written Opinion for PCT Application No. PCT/US2023/080344, dated Mar. 20, 2024, 13 pages. [cited by applicant]
International Search Report and Written Opinion for PCT Application No. PCT/US2023/081772, dated Mar. 7, 2024, 11 pages. [cited by applicant]