IP Library › Granted Patent US 12,291,166
Granted Patent B2
US 12,291,166 · App. 18/227,024 · Granted May 6, 2025

Autonomous vehicle delivery

Inventors: Ryan Gammelgard (Bloomington, IL); Justin Davis (Bloomington, IL)
Assignee: STATE FARM MUTUAL AUTOMOBILE INSURANCE COMPANY
B60R25/1004B60K35/00B60R25/023B60R25/045B60R25/08B60R25/102B60R25/25B60R25/305B60R25/31B60W60/00256G01C21/3407G05B13/0265G05D1/0016G05D1/0022G05D1/0061G05D1/0212G05D1/028G05D1/0287G05D1/223G05D1/646G05D1/692G05D1/81G06Q10/047G06Q10/06315G06Q10/08G06T19/006G06V20/56G09B9/042G09B9/052B60K35/28B60K35/60B60K2360/172B60K2360/177B60K2360/785B60R2025/1016B60W2540/21B64U10/13B64U2101/60G10L15/22
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,291,166
App. No.
18/227,024
Filed
Jul 27, 2023
Granted
May 6, 2025
Kind
B2
Examiner
WANG, JINGLI
Art Unit
3666
USPC
701/2
Abstract

Autonomous vehicle methods and systems are described herein for communicating with an autonomous or semi-autonomous vehicle to remotely control operation of the vehicle, to detect and remove unauthorized passengers, to deliver loads, to receive registration information for the vehicle, to provide accessibility information to the vehicle, and/or to receive sensor or other environmental data to integrate with an electronic game or other extended reality experience.

Claims (63)

1. A computer-implemented method for optimizing delivery routes and delivering loads using a combination of one or more autonomous or semi-autonomous vehicles and one or more drones, comprising:

determining, by one or more processors, a destination location for transporting a load from a starting location;

determining, by the one or more processors, a first route for one or more autonomous or semi-autonomous vehicles to transport the load to an intermediate location;

determining, by the one or more processors, a second route for one or more drones to transport the load from the intermediate location to the destination location;

determining, by the one or more processors, one or more physical characteristics of the load;

determining, by the one or more processors, a number of drones to deliver the load from the intermediate location to the destination location within a user-determined time frame based upon the one or more physical characteristics of the load;

determining, by the one or more processors, whether the one or more autonomous or semi-autonomous vehicles are capable of carrying both the load and the determined number of drones based upon at least the one or more physical characteristics of the load;

causing, by the one or more processors, the one or more autonomous or semi-autonomous vehicles to transport the load to the intermediate location along the first route; and

causing, by the one or more processors, the determined number of drones to transport the load along the second route from the intermediate location to the destination location.

2. The computer-implemented method of claim 1 , wherein:

the first route is determined based upon at least one of: (i) geographical data for a geographic area including the starting location and the destination location, or (ii) one or more vehicle characteristics of the one or more autonomous or semi-autonomous vehicles; and

the second route is determined based upon at least one of: (i) the geographical data and (ii) one or more vehicle characteristics of the one or more drones.

3. The computer-implemented method of claim 1 , wherein the one or more autonomous or semi-autonomous vehicles transport the determined number of drones from the starting location to the intermediate location alongside the load.

4. The computer-implemented method of claim 1 , further comprising:

determining, by the one or more processors, at least one third route for the determined number of drones from one or more drone starting locations to the intermediate location, wherein the at least one third route intersects with the first route at the intermediate location; and

causing, by the one or more processors, the determined number of drones to travel along the at least one third route to the intermediate location.

5. The computer-implemented method of claim 1 , wherein:

the intermediate location includes a drop-off location that is adjacent to the destination location; and

the determined number of drones transport the load to an entrance of the destination location.

6. The computer-implemented method of claim 1 , further comprising:

receiving, by the one or more processors, a verbal command directed to the determined number of drones; and

causing, by the one or more processors, the determined number of drones to perform one or more tasks based upon the verbal command.

7. A computer system configured to optimize delivery routes and deliver loads using a combination of one or more autonomous or semi-autonomous vehicles and one or more drones, the computer system comprising one or more local or remote processors, transceivers, and/or sensors configured to:

determine a destination location for transporting a load from a starting location;

determine a first route for one or more autonomous or semi-autonomous vehicles to transport the load to an intermediate location;

determine a second route for one or more drones to transport the load from the intermediate location to the destination location;

determine one or more physical characteristics of the load;

determine a number of drones necessary to deliver the load from the intermediate location to the destination location within a user-determined time frame based upon the one or more physical characteristics of the load;

determine whether the one or more autonomous or semi-autonomous vehicles are capable of carrying both the load and the determined number of drones based upon at least the one or more physical characteristics of the load;

cause the one or more autonomous or semi-autonomous vehicles to transport the load to the intermediate location along the first route; and

cause the determined number of drones to transport the load along the second route from the intermediate location to the destination location.

8. The computer system of claim 7 , wherein:

the first route is determined based upon at least one of: (i) geographical data for a geographic area including the starting location and the destination location, or (ii) one or more vehicle characteristics of the one or more autonomous or semi-autonomous vehicles; and

the second route is determined based upon at least one of: (i) the geographical data and (ii) one or more vehicle characteristics of the one or more drones.

9. The computer system of claim 7 , wherein the one or more autonomous or semi-autonomous vehicles transport the determined number of drones from the starting location to the intermediate location alongside the load.

10. The computer system of claim 7 , wherein the one or more local or remote processors, transceivers, and/or sensors are further configured to:

determine at least one third route for the determined number of drones from one or more drone starting locations to the intermediate location, wherein the at least one third route intersects with the first route at the intermediate location; and

cause the determined number of drones to travel along the at least one third route to the intermediate location.

11. The computer system of claim 7 , wherein:

the intermediate location includes a drop-off location that is adjacent to the destination location; and

the determined number of drones transport the load to an entrance of the destination location.

12. The computer system of claim 7 , wherein the one or more local or remote processors, transceivers, and/or sensors are further configured to:

receive a verbal command directed to the determined number of drones; and

cause the determined number of drones to perform one or more tasks based upon the verbal command.

13. A non-transitory computer-readable medium storing thereon a set of instructions that, when executed by one or more processors, causes the one or more processors to:

determine a destination location for transporting a load from a starting location;

determine a first route for one or more autonomous or semi-autonomous vehicles to transport the load to an intermediate location;

determine a second route for one or more drones to transport the load from the intermediate location to the destination location;

determine one or more physical characteristics of the load;

determine a number of drones necessary to deliver the load from the intermediate location to the destination location within a user-determined time frame based upon the one or more physical characteristics of the load;

determine whether the one or more autonomous or semi-autonomous vehicles are capable of carrying both the load and the determined number of drones based upon at least the one or more physical characteristics of the load;

cause the one or more autonomous or semi-autonomous vehicles to transport the load to the intermediate location along the first route; and

cause the determined number of drones to transport the load along the second route from the intermediate location to the destination location.

14. The non-transitory computer-readable medium of claim 13 , wherein:

the first route is determined based upon at least one of: (i) geographical data for a geographic area including the starting location and the destination location, or (ii) one or more vehicle characteristics of the one or more autonomous or semi-autonomous vehicles; and

the second route is determined based upon at least one of: (i) the geographical data and (ii) one or more vehicle characteristics of the one or more drones.

15. The non-transitory computer-readable medium of claim 13 , wherein the one or more autonomous or semi-autonomous vehicles transport the determined number of drones from the starting location to the intermediate location alongside the load.

16. The non-transitory computer-readable medium of claim 13 , wherein the set of instructions further cause the one or more processors to:

determine at least one third route for the determined number of drones from one or more drone starting locations to the intermediate location, wherein the at least one third route intersects with the first route at the intermediate location; and

cause the determined number of drones to travel along the at least one third route to the intermediate location.

17. The non-transitory computer-readable medium of claim 13 , wherein:

the intermediate location includes a drop-off location that is adjacent to the destination location; and

the determined number of drones transport the load to an entrance of the destination location.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 9, 2023
From: GAMMELGARD, RYAN; DAVIS, JUSTIN
To: STATE FARM MUTUAL AUTOMOBILE INSURANCE COMPANY
Reel/Frame 064532/0736 →
Continuity (4)
Continuation 17208724 · Mar 22, 2021
Provisional Application 63159772 · Mar 11, 2021
Provisional Application 63158968 · Mar 10, 2021
Related Publication 20230373532A1 · Nov 23, 2023
References Cited (119)
US 4787205A · Fontaine · 1988 [cited by applicant]
US 7221260B2 · Berezowski et al. · 2007 [cited by applicant]
US RE43891E · Golden · 2013 [cited by applicant]
US 8738523B1 · Sanchez et al. · 2014 [cited by applicant]
US 8876535B2 · Fields et al. · 2014 [cited by applicant]
US 9311271B2 · Wright · 2016 [cited by applicant]
US 9459620B1 · Schaffalitzky · 2016 [cited by applicant]
US 9633487B2 · Wright · 2017 [cited by applicant]
US 9830748B2 · Rosenbaum · 2017 [cited by applicant]
US 9832241B1 · Hayward · 2017 [cited by applicant]
US 9852620B1 · Hoeft · 2017 [cited by applicant]
US 9990782B2 · Rosenbaum · 2018 [cited by applicant]
US 10095229B2 · Myers et al. · 2018 [cited by applicant]
US 10185327B1 · Konrardy et al. · 2019 [cited by applicant]
US 10192369B2 · Wright · 2019 [cited by applicant]
US 10198879B2 · Wright · 2019 [cited by applicant]
US 10246097B1 · Fields et al. · 2019 [cited by applicant]
US 10269190B2 · Rosenbaum · 2019 [cited by applicant]
US 10308246B1 · Konrardy et al. · 2019 [cited by applicant]
US 10324463B1 · Konrardy et al. · 2019 [cited by applicant]
US 10332211B1 · Cielocha · 2019 [cited by applicant]
US 10336321B1 · Fields et al. · 2019 [cited by applicant]
US 10354330B1 · Konrardy et al. · 2019 [cited by applicant]
US 10386192B1 · Konrardy et al. · 2019 [cited by applicant]
US 10416670B1 · Fields et al. · 2019 [cited by applicant]
US 10431018B1 · Fields et al. · 2019 [cited by applicant]
US 10467824B2 · Rosenbaum · 2019 [cited by applicant]
US 10475350B1 · Nepomuceno · 2019 [cited by applicant]
US 10493936B1 · Konrardy et al. · 2019 [cited by applicant]
US 10549759B1 · Chan et al. · 2020 [cited by applicant]
US 10618523B1 · Fields et al. · 2020 [cited by applicant]
US 10809081B1 · Kentley-Klay et al. · 2020 [cited by applicant]
US 10810504B1 · Fields et al. · 2020 [cited by applicant]
US 10831204B1 · Fields et al. · 2020 [cited by applicant]
US 10977956B1 · Madison et al. · 2021 [cited by applicant]
US 11227452B2 · Rosenbaum · 2022 [cited by applicant]
US 11407410B2 · Rosenbaum · 2022 [cited by applicant]
US 11441916B1 · Konrardy et al. · 2022 [cited by applicant]
US 11524707B2 · Rosenbaum · 2022 [cited by applicant]
US 11594083B1 · Rosenbaum · 2023 [cited by applicant]
US 20050105743A1 · Faltesek et al. · 2005 [cited by applicant]
US 20050248444A1 · Joao · 2005 [cited by applicant]
US 20070050108A1 · Larschan et al. · 2007 [cited by applicant]
US 20100086139A1 · Nicolino, Jr. et al. · 2010 [cited by applicant]
US 20140156157A1 · Johnson et al. · 2014 [cited by applicant]
US 20140297061A1 · Takahashi · 2014 [cited by applicant]
US 20140343758A1 · Kraimer et al. · 2014 [cited by applicant]
US 20150035685A1 · Strickland et al. · 2015 [cited by applicant]
US 20150091740A1 · Bai et al. · 2015 [cited by applicant]
US 20150310742A1 · Albornoz · 2015 [cited by applicant]
US 20150363986A1 · Hoyos et al. · 2015 [cited by applicant]
US 20160116293A1 · Grover et al. · 2016 [cited by applicant]
US 20160225211A1 · Gehin et al. · 2016 [cited by applicant]
US 20160379411A1 · Harbach et al. · 2016 [cited by applicant]
US 20170140624A1 · Orglmeister · 2017 [cited by applicant]
US 20170217478A1 · Maguire et al. · 2017 [cited by applicant]
US 20170316696A1 · Bartel · 2017 [cited by applicant]
US 20170327082A1 · Kamhi et al. · 2017 [cited by applicant]
US 20180086261A1 · Sugimoto et al. · 2018 [cited by applicant]
US 20180291575A1 · Roe, Jr. et al. · 2018 [cited by applicant]
US 20180354502A1 · Yaldo et al. · 2018 [cited by applicant]
US 20190009786A1 · Liu · 2019 [cited by applicant]
US 20190012636A1 · Simon et al. · 2019 [cited by applicant]
US 20190017839A1 · Eyler et al. · 2019 [cited by applicant]
US 20190061619A1 · Reymann et al. · 2019 [cited by applicant]
US 20190149956A1 · Chiang et al. · 2019 [cited by applicant]
US 20190266522A1 · Li · 2019 [cited by examiner]
US 20200010051A1 · Dumov · 2020 [cited by applicant]
US 20200064141A1 · Bell et al. · 2020 [cited by applicant]
US 20200114871A1 · Kicinski et al. · 2020 [cited by applicant]
US 20200117217A1 · Yuzawa et al. · 2020 [cited by applicant]
US 20200167722A1 · Goldberg · 2020 [cited by examiner]
US 20200185112A1 · Aso et al. · 2020 [cited by applicant]
US 20200238952A1 · Lindsay et al. · 2020 [cited by applicant]
US 20210001887A1 · Wang et al. · 2021 [cited by applicant]
US 20210099834A1 · Mountford et al. · 2021 [cited by applicant]
US 20210101563A1 · Azarko · 2021 [cited by applicant]
US 20210109538A1 · Graefe et al. · 2021 [cited by applicant]
US 20210110378A1 · Rule et al. · 2021 [cited by applicant]
US 20210155264A1 · MacPherson et al. · 2021 [cited by applicant]
US 20210178936A1 · Yetukuri et al. · 2021 [cited by applicant]
US 20210300549A1 · Beloussov et al. · 2021 [cited by applicant]
US 20220092893A1 · Rosenbaum · 2022 [cited by applicant]
US 20220108228A1 · Salter et al. · 2022 [cited by applicant]
US 20220126748A1 · Diamond et al. · 2022 [cited by applicant]
US 20220176999A1 · Golgiri et al. · 2022 [cited by applicant]
US 20220219605A1 · Mitsui et al. · 2022 [cited by applicant]
US 20220230081A1 · Goldman-Shenhar · 2022 [cited by applicant]
US 20220244736A1 · Konrardy et al. · 2022 [cited by applicant]
US 20220283582A1 · Crinklaw et al. · 2022 [cited by applicant]
US 20220340148A1 · Rosenbaum · 2022 [cited by applicant]
US 20230060300A1 · Rosenbaum · 2023 [cited by applicant]
EP 3239686A1 · 2017 [cited by applicant]
EP 3578433B1 · 2020 [cited by applicant]
EP 3730375B1 · 2021 [cited by applicant]
EP 3960576A1 · 2022 [cited by applicant]
EP 4190659A1 · 2023 [cited by applicant]
EP 4190660A1 · 2023 [cited by applicant]
JP 3890747B2 · 2007 [cited by applicant]
U.S. Appl. No. 17/734,275, Non-final Office Action, dated Aug. 31, 2023. [cited by applicant]
U.S. Appl. No. 17/208,701, Notice of Allowance, dated Oct. 5, 2023. [cited by applicant]
U.S. Appl. No. 17/208,770, Notice of Allowance, dated Mar. 15, 2024. [cited by applicant]
U.S. Appl. No. 17/208,778, Final Office Action, dated May 3, 2024. [cited by applicant]
Final Office Action, U.S. Appl. No. 17/208,770 mailed Apr. 6, 2023. [cited by applicant]
Non-final Office Action, U.S. Appl. No. 17/208,724, mailed Jan. 18, 2023. [cited by applicant]
Non-final Office Action, U.S. Appl. No. 17/208,770 mailed Nov. 9, 2022. [cited by applicant]
Non-final Office Action, U.S. Appl. No. 17/208,778, mailed Dec. 14, 2022. [cited by applicant]
Non-final Office Action, U.S. Appl. No. 17/208,790, mailed Dec. 29, 2021. [cited by applicant]
Non-final Office Action, U.S. Appl. No. 17/734,275, mailed Oct. 25, 2022. [cited by applicant]
U.S. Appl. No. 17/208,724, Notice of Allowance, dated May 8, 2023. [cited by applicant]
U.S. Appl. No. 17/208,755, Nonfinal Office Action, dated Jun. 22, 2023. [cited by applicant]
U.S. Appl. No. 17/208,778, Final Office Action, dated Jun. 9, 2023. [cited by applicant]
U.S. Appl. No. 17/208,790, Notice of Allowance, dated Mar. 22, 2022. [cited by applicant]
U.S. Appl. No. 17/734,275, Final Office Action, dated Apr. 26, 2023. [cited by applicant]
U.S. Appl. No. 17/208,770, Nonfinal Office Action, dated Jul. 17, 2023. [cited by applicant]
U.S. Appl. No. 17/208,770, Nonfinal Office Action, dated Nov. 16, 2023. [cited by applicant]
U.S. Appl. No. 17/208,755, Final Office Action, dated Jan. 4, 2024. [cited by applicant]
U.S. Appl. No. 17/208,778, Nonfinal Office Action, dated Dec. 28, 2023. [cited by applicant]
U.S. Appl. No. 17/734,275, Final Office Action, dated Dec. 12, 2023. [cited by applicant]