IP Library Granted Patent US 10,386,192
Granted Patent B1
US 10,386,192 · App. 15/409,146 · Granted Aug 20, 2019

Autonomous vehicle routing

Inventors: Blake Konrardy (Bloomington, IL); Scott T. Christensen (Salem, OR); Gregory Hayward (Bloomington, IL); Scott Farris (Bloomington, IL)
Assignee: STATE FARM MUTUAL AUTOMOBILE INSURANCE COMPANY
G01C21/3453G01S19/13G05D1/0088G07C5/008
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 10,386,192
App. No.
15/409,146
Granted
Aug 20, 2019
Kind
B1
Abstract

Methods and systems for autonomous and semi-autonomous vehicle routing are disclosed. Roadway suitability for autonomous operation is scored to facilitate use in route determination. Maps of roadways suitable for various levels of autonomous operation may be generated. Such map data may be used by autonomous vehicles or other computer devices in determining routes based upon criteria for vehicle trips. Such routes may be automatically updated based upon changes in road conditions, vehicle conditions, operator conditions, or environmental conditions. Emergency routing using such map data is described, such as automatic routing and travel when a passenger is experiencing a medical emergency.

Claims (72)

1. A computer-implemented method for autonomous or semi-autonomous vehicle routing, comprising:

receiving, at one or more processors, a request to determine an optimal route for a vehicle;

receiving, at the one or more processors, a first geospatial location indicating a starting location;

receiving, at the one or more processors, a second geospatial location indicating a destination location;

receiving, at the one or more processors, a set of parameters indicating requirements for the optimal route;

accessing, from a database, map data including a plurality of road segments, wherein the map data includes one or more suitability scores for each road segment indicating the road segment's suitability for autonomous or semi-autonomous vehicle operation;

identifying, by the one or more processors, a set of suitable road segments from the plurality of road segments, wherein each suitable road segment of the set meets the requirements indicated by the set of parameters;

determining, by the one or more processors, one or more paths between the first geospatial location and the second geospatial location, each path composed of one or more of the suitable road segments of the set of suitable road segments; and

selecting, by the one or more processors, the optimal route from the one or more paths.

2. The computer-implemented method of claim 1 , wherein the parameters indicate a minimum safety rating for fully autonomous vehicle operation.

3. The computer-implemented method of claim 2 , wherein the minimum safety rating is associated with a risk level for fully autonomous operation of the vehicle below a risk threshold.

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

causing, by a vehicle control system of the vehicle, the vehicle to operate along the optimal route from the first geospatial location to the second geospatial location.

5. The computer-implemented method of claim 1 , wherein the optimal route is selected from the one or more paths based upon maximization or minimization of one or more optimization criteria determined for each path.

6. The computer-implemented method of claim 5 , wherein the optimization criteria include distance, time, risk, cost, or amount of manual driving required.

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

determining, by the one or more processors, that no path exists between the first geospatial location and the second geospatial location using the suitable road segments of the set of suitable road segments meeting the requirements indicated by the received parameters;

determining, by the one or more processors, a second set of parameters based upon the received set of parameters; and

adding, by the one or more processors, one or more suitable road segments from the plurality of road segments to the set of suitable road segments, wherein each suitable road segment that is added meets the requirements indicated by the second set of parameters,

wherein the one or more paths between the first geospatial location and the second geospatial location include at least one of the added suitable road segments.

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

determining, by the one or more processors, that no path exists between the first geospatial location and the second geospatial location using the suitable road segments of the set of suitable road segments meeting the requirements indicated by the received parameters;

determining, by the one or more processors, at least one of a substitute starting location or a substitute destination location along one of the suitable road segments; and

adjusting, by the one or more processors, at least one of the first geospatial location to indicate the substitute starting location or the second geospatial location to indicate the substitute destination location,

wherein the one or more paths between the first geospatial location and the second geospatial location are determined using the adjusted at least one of the first geospatial location or the second geospatial location.

9. The computer-implemented method of claim 1 , wherein the first geospatial location is automatically determined based upon the current location of the vehicle in response to the request to determine the optimal route.

10. The computer-implemented method of claim 9 , wherein the current location of the vehicle is obtained from a global positioning system (GPS) receiver within the vehicle.

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

the one or more processors are disposed within a server remote from the vehicle;

the computer-implemented method further comprises transmitting, from the server to a computing device associated with the vehicle via a communication network, an indication of the optimal route.

12. The computer-implemented method of claim 11 , further comprising:

receiving, at the one or more processors, operating data from the vehicle, the operating data including location data indicating a plurality of locations of the vehicle after the indication of the optimal route is transmitted;

determining, by the one or more processors, an extent to which the location data indicates the vehicle has followed the optimal route; and

implementing, by the one or more processors, a response based upon the determined extent to which the vehicle has followed the optimal route.

13. A computer system for autonomous or semi-autonomous vehicle routing, comprising:

one or more processors;

a map database communicatively connected to the one or more processors and storing data including one or more suitability scores for each of a plurality of road segments indicating the road segment's suitability for autonomous or semi-autonomous vehicle operation; and

a program memory coupled to the one or more processors and storing executable instructions that, when executed by the one or more processors, cause the computer system to:

receive a request to determine an optimal route for a vehicle;

receive a first geospatial location indicating a starting location;

receive a second geospatial location indicating a destination location;

receive a set of parameters indicating requirements for the optimal route;

access map data for a plurality of road segments from the map database;

identify a set of suitable road segments from the plurality of road segments, wherein each suitable road segment of the set meets the requirements indicated by the set of parameters;

determine one or more paths between the first geospatial location and the second geospatial location, each path composed of one or more of the suitable road segments of the set of suitable road segments; and

select the optimal route from the one or more paths.

14. The computer system of claim 13 , wherein:

the parameters indicate a minimum safety rating for fully autonomous vehicle operation associated with a risk level for fully autonomous operation of the vehicle below a risk threshold; and

the optimal route is selected from the one or more paths based upon maximization or minimization of one or more optimization criteria determined for each path, the optimization criteria including one or more of: distance, time, risk, cost, or amount of manual driving required.

15. The computer system of claim 13 , wherein the program memory further stores executable instructions that cause the computer system to:

control the vehicle to operate along the optimal route from the first geospatial location to the second geospatial location.

16. The computer system of claim 15 , wherein:

the one or more processors are disposed within a server remote from the vehicle;

the computer system further comprises a communication unit configured to communicate between the one or more processors of the server and an on-board computer of the vehicle; and

control the vehicle to operate along the optimal route further comprises transmitting an indication of the optimal route from the server to the on-board computer via the communication unit.

17. The computer system of claim 13 , wherein the program memory further stores executable instructions that cause the computer system to:

receive operating data from the vehicle, the operating data including location data indicating a plurality of locations of the vehicle after the indication of the optimal route is transmitted;

determine an extent to which the location data indicates the vehicle has followed the optimal route; and

implement a response based upon the determined extent to which the vehicle has followed the optimal route.

18. The computer system of claim 13 , wherein the first geospatial location is automatically determined based upon the current location of the vehicle in response to the request to determine the optimal route.

19. A tangible, non-transitory computer-readable medium storing instructions for autonomous or semi-autonomous vehicle routing that, when executed by at least one processor of a computer system, cause the computer system to:

receive a request to determine an optimal route for a vehicle;

receive a first geospatial location indicating a starting location;

receive a second geospatial location indicating a destination location;

receive a set of parameters indicating requirements for the optimal route;

access map data including a plurality of road segments from a database, wherein the map data includes one or more suitability scores for each road segment indicating the road segment's suitability for autonomous or semi-autonomous vehicle operation;

identify a set of suitable road segments from the plurality of road segments, wherein each suitable road segment of the set meets the requirements indicated by the set of parameters;

determine one or more paths between the first geospatial location and the second geospatial location, each path composed of one or more of the suitable road segments of the set of suitable road segments; and

select the optimal route from the one or more paths.

20. The tangible, non-transitory computer-readable medium of claim 19 , wherein:

the parameters indicate a minimum safety rating for fully autonomous vehicle operation associated with a risk level for fully autonomous operation of the vehicle below a risk threshold; and

the optimal route is selected from the one or more paths based upon maximization or minimization of one or more optimization criteria determined for each path, the optimization criteria including one or more of: distance, time, risk, cost, or amount of manual driving required.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 24, 2017
From: KONRARDY, BLAKE; CHRISTENSEN, SCOTT T.; HAYWARD, GREGORY; FARRIS, SCOTT
To: STATE FARM MUTUAL AUTOMOBILE INSURANCE COMPANY
Reel/Frame 041471/0673 →
Continuity (35)
Provisional Application 62434359 · Dec 14, 2016
Provisional Application 62434355 · Dec 14, 2016
Provisional Application 62434361 · Dec 14, 2016
Provisional Application 62434370 · Dec 14, 2016
Provisional Application 62434368 · Dec 14, 2016
Provisional Application 62434365 · Dec 14, 2016
Provisional Application 62430215 · Dec 5, 2016
Provisional Application 62428843 · Dec 1, 2016
Provisional Application 62424078 · Nov 18, 2016
Provisional Application 62424093 · Nov 18, 2016
Provisional Application 62419017 · Nov 8, 2016
Provisional Application 62418999 · Nov 8, 2016
Provisional Application 62419009 · Nov 8, 2016
Provisional Application 62418988 · Nov 8, 2016
Provisional Application 62419023 · Nov 8, 2016
Provisional Application 62419002 · Nov 8, 2016
Provisional Application 62415672 · Nov 1, 2016
Provisional Application 62415668 · Nov 1, 2016
Provisional Application 62415678 · Nov 1, 2016
Provisional Application 62415673 · Nov 1, 2016
Provisional Application 62406605 · Oct 11, 2016
Provisional Application 62406600 · Oct 11, 2016
Provisional Application 62406595 · Oct 11, 2016
Provisional Application 62406611 · Oct 11, 2016
Provisional Application 62381848 · Aug 31, 2016
Provisional Application 62380686 · Aug 29, 2016
Provisional Application 62376044 · Aug 17, 2016
Provisional Application 62373084 · Aug 10, 2016
Provisional Application 62351559 · Jun 17, 2016
Provisional Application 62349884 · Jun 14, 2016
Provisional Application 62312109 · Mar 23, 2016
Provisional Application 62303500 · Mar 4, 2016
Provisional Application 62302990 · Mar 3, 2016
Provisional Application 62287659 · Jan 27, 2016
Provisional Application 62286017 · Jan 22, 2016
Cited By (16)
US 12,192,865 US 12,230,073 US 12,272,247 US 12,291,166 US 12,313,414 US 12,345,536 US 12,359,927 US 12,384,410 US 12,400,272 US 12,483,869 US 12,524,040 US 12,561,585 US 12,610,210 US 12,643,556 US 12,662,083 US 12,680,819