This relates generally to negotiation of an intersection traversal by an automated vehicle.
Modern vehicles, especially automobiles, increasingly provide automated driving and driving assistance systems such as blind spot monitors, automatic parking, and automatic navigation. However, automated driving systems can have difficulty traversing intersections, especially when other automated vehicles are involved.
Examples of the disclosure are directed to a peer-to-peer negotiation system for intersections including all-way stop signs. Where multiple automated vehicles come together at an intersection, the vehicles can use an intelligent negotiation system to determine when each vehicle should have priority in entering the intersection. In this way, a safer, more orderly traversal of the intersection can be accomplished without relying on an external arbitration device for each intersection.
In the following description of examples, reference is made to the accompanying drawings which form a part hereof, and in which it is shown by way of illustration specific examples that can be practiced. It is to be understood that other examples can be used and structural changes can be made without departing from the scope of the disclosed examples.
Modern vehicles, especially automobiles, increasingly provide automated driving and driving assistance systems such as blind spot monitors, automatic parking, and automatic navigation. However, automated driving systems can have difficulty traversing intersections, especially when other automated vehicles are involved.
Examples of the disclosure are directed to a peer-to-peer negotiation system for intersections including all-way stop signs. Where multiple automated vehicles come together at an intersection, the vehicles can use an intelligent negotiation system to determine when each vehicle should enter the intersection. Each vehicle can communicate its time of arrival to the other vehicles, and the vehicle with the earliest time of arrival can be the first to enter the intersection. Further, each vehicle can communicate to the other vehicles once it has entered the intersection and once it has exited the intersection. Once the other vehicles receive a message indicating that the vehicle has exited the intersection, the negotiation process can begin again, and the remaining vehicle with the earliest time of arrival can enter the intersection. In this way, a safer, more efficient traversal of the intersection can be accomplished without relying on an external arbitration device for each intersection.
In response to the verification that the first vehicle 100 has arrived at an entry of the intersection, the first vehicle 100 can come to a complete stop and send a message indicating its time of arrival to any other vehicles also present at the intersection (e.g., second vehicle 102 and third vehicle 104). Further, the first vehicle 100 can request times of arrival of the other vehicles in the intersection by sending requests to the second vehicle 102 and the third vehicle 104. In response to the requests, the second vehicle 102 and the third vehicle 104 can send their respective times of arrival to the first vehicle 100. In some examples, the information can be sent as a broadcast message to any vehicles in the area. In other examples, the information can be targeted to particular vehicles and/or can include encryption or other security protocols to secure the information and ensure only the targeted vehicles can read the information. In some examples, the information can include other information besides time of arrival, such as an identifier of the intersection, an identifier of the vehicle sending the information, a location of the vehicle sending the information, and/or a destination.
Once the first vehicle 100 receives times of arrival from all other vehicles at the intersection, the first vehicle can determine whether to enter the intersection. For example, if the time of arrival of the first vehicle is earlier than both the time of arrival of the second vehicle 102 and the third vehicle 104, then the first vehicle can enter the intersection. However, if the first vehicle's time of arrival is not the earliest, then it can wait for at least one other vehicle to enter and exit the intersection. Each of the three vehicles at the intersection can perform this same method to determine whether it should enter the intersection. If two or more vehicles arrive at the same time at the intersection, then a priority of entry can be determined by applicable traffic rules (e.g., the vehicles to the right has right of way).
A first vehicle (e.g., first vehicle 100 or any of the other vehicles in
In response to detecting an intersection, components (e.g., one or more processors or other controllers) of the first vehicle 100 can cause (202) the first vehicle to automatically decrease speed, eventually slowing to a stop at an entry point of the intersection. Then, the first vehicle 100 can send (204) a first message indicating a first time of arrival of the first vehicle 100 at the intersection (e.g., to other vehicles that have stopped at the intersection). In some examples, any messages or other information sent between the first vehicle 100 and other vehicles at the intersection may be sent using a wireless communication protocol (e.g., dedicated short range communications (DSRC), cellular, etc.). In some examples, the messages may be direct vehicle-to-vehicle communications, and in other examples, the messages may be sent over a communication network, such as a cellular network, a WiFi network, Bluetooth connection, or the Internet, among other possibilities.
The first vehicle 100 can receive (206) information including a second time of arrival of a second vehicle at the intersection. For example, the first vehicle may, upon arriving at the intersection, send a request for times of arrival, and the information including the second time of arrival of the second vehicle can be sent by the second vehicle in response to receiving the request for times of arrival. In some examples, vehicles may periodically broadcast time of arrival information to other vehicles at the same intersection without needing to first receive a request for such information. In some examples, a vehicle may send its time of arrival information as a response to receiving time of arrival information from another vehicle at the intersection without needing to receive a specific request for such information.
The first vehicle can then compare (208) the first time to the second time to determine which time of arrival is earlier.
In accordance with the first time being earlier than the second time, components (e.g., one or more processors or other controllers) of the first vehicle can cause (210) the first vehicle to automatically enter the intersection. Then, the first vehicle can send (212) a second message indicating entrance of the first vehicle into the intersection. The first vehicle can automatically traverse the intersection, and, after the first vehicle has exited the intersection, it can send a message to other vehicles at the intersection indicating the first vehicle has exited the intersection. In some examples, if there are multiple vehicles and multiple times of arrival to consider, the first vehicle may enter the intersection before any of the other vehicles only if the first time is earlier than any of the other times of arrival.
In accordance with the first time not being earlier than the second time, the first vehicle can forgo (214) entrance into the intersection until the second vehicle has exited the intersection. Further, the first vehicle may not enter the intersection until all other vehicles with earlier times of arrival have entered and then exited the intersection (e.g., as indicated by messages/information received from those vehicles).
For example, after receiving additional information indicating the second vehicle has exited the intersection, if a third vehicle has an earlier time of arrival than the first vehicle, the first vehicle can continue to forgo entering the intersection until the third vehicle has entered and exited the intersection. If, however, the third vehicle has a later time of arrival and there are no other vehicles at the intersection with a time of arrival earlier than the first vehicle, then the first vehicle can enter the intersection as soon as the second vehicle has exited.
In some embodiments, the first vehicle may detect another vehicle proximate to the intersection without receiving information indicating a time of arrival of that other vehicle. For example, the other vehicle may be detected by the first vehicle using a camera, LIDAR, or other system, and if the other vehicle is not automated or does not use the same negotiating method, then it may not broadcast its time of arrival. In such a case, the first vehicle may forgo entrance into the intersection until the other vehicle has exited the intersection. Because the other vehicle may not broadcast its entrance and exit of the intersection, it may be necessary for the first vehicle to use a camera, LIDAR, etc. to detect the entrance and exit of the other vehicle to be sure that the other vehicle has left the intersection before the first vehicle enters. Alternatively, in other examples, vehicles can broadcast a “I am in the intersection” signal while the vehicle is traversing through the intersection, and other vehicles will await the termination of such a signal before entering the intersection.
In some examples, the vehicle control system 500 can be connected to (e.g., via controller 520) one or more actuator systems 530 in the vehicle. The one or more actuator systems 530 can include, but are not limited to, a motor 531 or engine 532, battery system 533, transmission gearing 534, suspension setup 535, brakes 536, steering system 537 and door system 538. Based on the determined locations of one or more objects relative to the interaction spaces of doors 538, the vehicle control system 500 can control one or more of these actuator systems 530 to stop before entering an intersection and/or to traverse an intersection, by adjusting the steering angle and engaging the drivetrain (e.g., motor) to move the vehicle at a controlled speed. The camera system 506 can continue to capture images and send them to the vehicle control system 500 for analysis, as detailed in the examples above. The vehicle control system 500 can, in turn, continuously or periodically send commands to the one or more actuator systems 530 to control movement of the vehicle.
Thus, the examples of the disclosure provide various ways to safely and efficiently negotiate intersection traversal between multiple automated vehicles without the need for an external arbitration device.
Although examples of this disclosure have been fully described with reference to the accompanying drawings, it is to be noted that various changes and modifications will become apparent to those skilled in the art. Such changes and modifications are to be understood as being included within the scope of examples of this disclosure as defined by the appended claims.
This application claims the benefit of U.S. Provisional Patent Application No. 62/280,534, filed on Jan. 19, 2016, the entire disclosure of which is incorporated herein by reference in its entirety for all intended purposes.
Number | Date | Country | |
---|---|---|---|
62280534 | Jan 2016 | US |