IP Library Granted Patent US 10,185,327
Granted Patent B1
US 10,185,327 · App. 15/409,099 · Granted Jan 22, 2019

Autonomous vehicle path coordination

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
G05D1/0289G05D1/0088G05D1/0212G08G1/0965G08G1/161G08G1/166G05D2201/0213
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,185,327
App. No.
15/409,099
Filed
Jan 18, 2017
Granted
Jan 22, 2019
Kind
B1
Examiner
JOS, BASIL T
Art Unit
3668
USPC
701/26
Abstract

Methods and systems for communicating between autonomous vehicles are described herein. Such communication may be performed for signaling, collision avoidance, path coordination, and/or autonomous control. Several communications from autonomous vehicles may be received at a computing device, where the autonomous vehicles are travelling within a threshold distance of each other. Each communication may include an indication of the next waypoint on a route for the respective vehicle. The computing device may analyze the communications to determine maneuvers for the autonomous vehicles so that each autonomous vehicle may navigate to the corresponding waypoint in the least amount of time or distance. The computing device also may cause each of the autonomous vehicles to move in accordance with the maneuvers for the respective vehicle.

Claims (50)

1. A computer-implemented method for coordinating paths for a plurality of vehicles having one or more autonomous operation features, comprising:

receiving, at one or more processors, a plurality of communications from a plurality of vehicles each having one or more autonomous operation features, wherein the plurality of vehicles are travelling within a threshold distance of each other, and wherein each communication includes identification information for the respective vehicle, an indication of a location of the respective vehicle, and an indication of a waypoint on a route for the respective vehicle;

analyzing, by the one or more processors, the plurality of communications to determine one or more maneuvers for each of the plurality of vehicles, wherein the one or more maneuvers are determined for each vehicle to navigate to a corresponding waypoint in a least amount of time or distance; and

causing, by the one or more processors, each of the plurality of vehicles to move in accordance with the one or more maneuvers for the respective vehicle.

2. The computer-implemented method of claim 1 , wherein analyzing the plurality of communications to determine one or more maneuvers for each of the plurality of vehicles includes:

for each of the plurality of vehicles:

identifying, by the one or more processors, a distance between the vehicle and each of the other vehicles and current speeds of the vehicle and each of the other vehicles;

determining, by the one or more processors, a minimum distance to the corresponding waypoint for the vehicle;

determining, by the one or more processors, one or more first maneuvers to arrive at the corresponding waypoint for the vehicle over the minimum distance;

determining, by the one or more processors, whether the vehicle will collide with any of the other vehicles when travelling to the corresponding waypoint over the minimum distance; and

when the vehicle will collide with any of the other vehicles, determining, by the one or more processors for each of the other vehicles which will collide with the vehicle, one or more second maneuvers for the other vehicles to perform to avoid colliding with the vehicle.

3. The computer-implemented method of claim 2 , further comprising:

assigning, by the one or more processors, a priority level to each of the plurality of vehicles, wherein the priority levels are assigned in order of the minimum distances from the vehicles to the corresponding waypoints.

4. The computer-implemented method of claim 3 , wherein the one or more first maneuvers are determined for each of the vehicles in order of priority level.

5. The computer-implemented method of claim 4 , wherein the one or more first maneuvers include the one or more second maneuvers to avoid colliding with another vehicle.

6. The computer-implemented method of claim 1 , wherein a waypoint includes a destination, a highway exit, or a highway entrance.

7. The computer-implemented method of claim 1 , wherein analyzing the plurality of communications to determine one or more maneuvers for each of the plurality of vehicles includes assigning, by the one or more processors, a lane to each of the plurality of vehicles for maneuvering.

8. The computer-implemented method of claim 1 , wherein the corresponding waypoint for a vehicle of the plurality of vehicles is a highway exit and the one or more maneuvers for the vehicle includes a series of lane changes to reach the highway exit in a shortest amount of time without colliding with any other of the plurality of vehicles.

9. A computer system configured to coordinate paths for a plurality of vehicles having one or more autonomous operation features, the computer system comprising one or more local or remote processors, transceivers, and/or sensors configured to:

receive a plurality of communications from a plurality of vehicles each having one or more autonomous operation features, wherein the plurality of vehicles are travelling within a threshold distance of each other, and wherein each communication includes identification information for the respective vehicle, an indication of a location of the respective vehicle, and an indication of a waypoint on a route for the respective vehicle;

analyze the plurality of communications to determine one or more maneuvers for each of the plurality of vehicles, wherein the one or more maneuvers are determined for each vehicle to navigate to a corresponding waypoint in a least amount of time or distance; and

cause each of the plurality of vehicles to move in accordance with the one or more maneuvers for the respective vehicle.

10. The computer system of claim 9 , wherein to analyze the plurality of communications to determine one or more maneuvers for each of the plurality of vehicles, the one or more local or remote processors, transceivers, and/or sensors are configured to:

for each of the plurality of vehicles:

identify a distance between the vehicle and each of the other vehicles and current speeds of the vehicle and each of the other vehicles;

determine a minimum distance to the corresponding waypoint for the vehicle;

determine one or more first maneuvers to arrive at the corresponding waypoint for the vehicle over the minimum distance;

determine whether the vehicle will collide with any of the other vehicles when travelling to the corresponding waypoint over the minimum distance; and

when the vehicle will collide with any of the other vehicles, determine, for each of the other vehicles which will collide with the vehicle, one or more second maneuvers for the other vehicles to perform to avoid colliding with the vehicle.

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

assign a priority level to each of the plurality of vehicles, wherein the priority levels are assigned in order of the minimum distances from the vehicles to the corresponding waypoints.

12. The computer system of claim 11 , wherein the one or more first maneuvers are determined for each of the vehicles in order of priority level.

13. The computer system of claim 12 , wherein the one or more first maneuvers include the one or more second maneuvers to avoid colliding with another vehicle.

14. The computer system of claim 9 , wherein a waypoint includes a destination, a highway exit, or a highway entrance.

15. The computer system of claim 9 , wherein to analyze the plurality of communications to determine one or more maneuvers for each of the plurality of vehicles, the one or more local or remote processors, transceivers, and/or sensors are configured to assign a lane to each of the plurality of vehicles for maneuvering.

16. The computer system of claim 9 , wherein the corresponding waypoint for a vehicle of the plurality of vehicles is a highway exit and the one or more maneuvers for the vehicle includes a series of lane changes to reach the highway exit in a shortest amount of time without colliding with any other of the plurality of vehicles.

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

receive a plurality of communications from a plurality of vehicles each having one or more autonomous operation features, wherein the plurality of vehicles are travelling within a threshold distance of each other, and wherein each communication includes identification information for the respective vehicle, an indication of a location of the respective vehicle, and an indication of a waypoint on a route for the respective vehicle;

analyze the plurality of communications to determine one or more maneuvers for each of the plurality of vehicles, wherein the one or more maneuvers are determined for each vehicle to navigate to a corresponding waypoint in a least amount of time or distance; and

cause each of the plurality of vehicles to move in accordance with the one or more maneuvers for the respective vehicle.

18. The computer-readable medium of claim 17 , wherein to analyze the plurality of communications to determine one or more maneuvers for each of the plurality of vehicles, the set of instructions causes the one or more processors to:

for each of the plurality of vehicles:

identify a distance between the vehicle and each of the other vehicles and current speeds of the vehicle and each of the other vehicles;

determine a minimum distance to the corresponding waypoint for the vehicle;

determine one or more first maneuvers to arrive at the corresponding waypoint for the vehicle over the minimum distance;

determine whether the vehicle will collide with any of the other vehicles when travelling to the corresponding waypoint over the minimum distance; and

when the vehicle will collide with any of the other vehicles, determine, for each of the other vehicles which will collide with the vehicle, one or more second maneuvers for the other vehicles to perform to avoid colliding with the vehicle.

19. The computer-readable medium of claim 18 , wherein the set of instructions further causes the one or more processors to:

assign a priority level to each of the plurality of vehicles, wherein the priority levels are assigned in order of the minimum distances from the vehicles to the corresponding waypoints.

20. The computer-readable medium of claim 19 , wherein the one or more first maneuvers are determined for each of the vehicles in order of priority level.

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 62434368 · Dec 14, 2016
Provisional Application 62434355 · Dec 14, 2016
Provisional Application 62434361 · Dec 14, 2016
Provisional Application 62434365 · Dec 14, 2016
Provisional Application 62434370 · Dec 14, 2016
Provisional Application 62434359 · Dec 14, 2016
Provisional Application 62430215 · Dec 5, 2016
Provisional Application 62428843 · Dec 1, 2016
Provisional Application 62424093 · Nov 18, 2016
Provisional Application 62424078 · Nov 18, 2016
Provisional Application 62418999 · Nov 8, 2016
Provisional Application 62419023 · Nov 8, 2016
Provisional Application 62419002 · Nov 8, 2016
Provisional Application 62419009 · Nov 8, 2016
Provisional Application 62419017 · Nov 8, 2016
Provisional Application 62418988 · Nov 8, 2016
Provisional Application 62415668 · Nov 1, 2016
Provisional Application 62415673 · Nov 1, 2016
Provisional Application 62415672 · Nov 1, 2016
Provisional Application 62415678 · Nov 1, 2016
Provisional Application 62406600 · Oct 11, 2016
Provisional Application 62406611 · Oct 11, 2016
Provisional Application 62406605 · Oct 11, 2016
Provisional Application 62406595 · 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 (10)
US 12,210,995 US 12,283,988 US 12,291,166 US 12,313,414 US 12,345,536 US 12,359,927 US 12,387,600 US 12,602,996 US 12,662,083 US 12,682,131