One aspect of the present invention relates to a system that uses the Vehicle to Vehicle (V2V) and/or the Vehicle to infrastructure communication for safety and mobility applications. The invention provides methods and systems to make the V2X realized and effectively used in any intelligent transportation system toward automated vehicle system.
Dedicated Short Range Communication (DSRC) is the main enabling technology for connected vehicle applications that will reduce vehicle crashes through fully connected transportation system with integrated wireless devices and road infrastructure. In such connected system, data among vehicles and with road infrastructure will be exchanged with acceptable time delay. DSRC is the enabler for the V2X communication and provides 360 degrees field of view with long range detection/communication capability up to 1000 meter. Data such as vehicle position, dynamics and signals can be exchanged among vehicles and road side equipments which make the deployment of safety applications such as crash avoidance systems (warning and control) possible. V2X technology will complement and get fused with the current production crash avoidance technologies that use radar and vision sensing. V2V will give drivers information needed for safer driving (driver makes safe decisions) on the road that radar and vision systems cannot provide. This V2X capability, therefore, offers enhancements to the current production crash avoidance systems, and also enables addressing more complex crash scenarios, such as those occurring at intersections. This kind of integration between the current production crash avoidance systems, V2X technology, and other transportation infrastructure paves the way for realizing automated vehicles system.
The safety, health, and cost of accidents (on both humans and properties) are major concerns for all citizens, local and Federal governments, cities, insurance companies (both for vehicles and humans), health organizations, and the Congress (especially due to the budget cuts, in every level). People inherently make a lot of mistakes during driving (and cause accidents), due to the lack of sleep, various distractions, talking to others in the vehicle, fast driving, long driving, heavy traffic, rain, snow, fog, ice, or too much drinking. If we can make the driving more automated by implementing different scale of safety applications and even controlling the motion of the vehicle for longer period of driving, that saves many lives and potentially billions of dollars each year, in US and other countries. We introduce here an automated vehicle infrastructure and control systems and methods. That is the category of which the current invention is under, where V2X communication technology is vital component of such system, with all the embodiments presented here and in the divisional cases, in this family.
Some of connected vehicle applications require data from infrastructure road side equipment (RSE). Examples of such applications are road intersection safety application which mostly requires map and traffic signal phase data to perform the appropriate threat assessment. RSE's DSRC communication range can effectively reach 800 m, as an example. RSE's physical locations selection is driven by the desired traffic safety/mobility functionality for the specific road segments of interest. As a result, it is possible that the communication range of the different RSEs will overlap. On the safety application side, say, e.g., inside the on-board unit (OBU) integrated in the vehicle, it is highly possible that the OBU is receiving data from more than one RSE. Therefore, for the safety application to perform correctly, it is essential to use the RSE data that is associated to the anticipated vehicle travel trajectory. For this intended operation to happen, the algorithm is required to select the RSE of interest for the desired active safety application. We address all of these here in our invention, as described in details below.
Some of the prior art, listed here (some US patents), discusses some of the issues for the control of the cars, but none of them has any solution similar to ours, as described in details below:
a. U.S. Pat. No. 8,618,922, Method and system for ensuring operation of limited-ability autonomous driving vehicles
b. U.S. Pat. No. 8,527,199, Automatic collection of quality control statistics for maps used in autonomous driving
c. U.S. Pat. No. 8,521,352, Controlling a vehicle having inadequate map data
d. U.S. Pat. No. 8,457,827, Modifying behavior of autonomous vehicle based on predicted behavior of other vehicles
e. U.S. Pat. No. 8,412,449, Control and systems for autonomously driven vehicles
f. U.S. Pat. No. 8,280,623, Control and systems for autonomously driven vehicles
g. U.S. Pat. No. 8,126,642, Control and systems for autonomously driven vehicles
h. U.S. Pat. No. 7,979,173, Autonomous vehicle travel control systems and methods
i. U.S. Pat. No. 7,979,172, Autonomous vehicle travel control systems and methods
j. U.S. Pat. No. 6,751,535, Travel controlling apparatus of unmanned vehicle
k. U.S. Pat. No. 5,229,941, Autonomous vehicle automatically running on route and its method
DSRC, such as WiFi, is used here, in one embodiment. In one embodiment, DSRC V2X (vehicle to infrastructure plus vehicle) System can cover a communication circle up to 800 m, and in some cases 1000 meter, and as a result, in congested traffic areas, the on-board unit is communicating with high number of units and may end up saturating its processing capability very quickly.
This invention covers different dimensions of the above problem, in different embodiments:
1—It provides methods of RSE of interest selection based solely on the derived relative geometric data between the host vehicle and the RSE's, in addition to some of the host vehicle data, such as heading.
2—It provides methods of RSE of interest selection when detailed map data is communicated or when some generic map data is available.
3—It provides methods of RSE of interest selection when other vehicles data is available.
4—It provides method to lock on a specific RSE, release the lock on the specific RSE, and transit the lock to a different RSE.
5—Incorporate the security validation factor in the RSE selection.
There are different Factors affecting the RSE of interest selection decision:
Using our method and system, due to many reasons, as shown below, including efficiency, reliability, and safety, our invention here is superior to the prior art.
In one embodiment, the following steps describe the high level algorithm of the RSE selection: (see e.g.
1. RSE-Filtering. Different type of filtering based on Range and Cross-Range of the
RSE.
2. Check for duplicates in the RSE list, and modify the RSE-list accordingly.
3. Determine Locations of interest based on HV and RV(s) Location and Dynamics.
4. Order all RSEs based on their locations and vehicle location and Dynamics.
5. In case of MAP message availability, modify the RSE's Order according to the relevance of the RSE based on MAP message.
6. Based on the Above RSE order, and current RSE (listening), decide whether to continue using existing RSE or switch to a different RSE.
The following describes the details of each step, as one embodiment:
In one embodiment, the RSE(s) of least relevance will be eliminated in this Step. The Filtration is based on the Cross-Range of the RSE.
1—Whenever the Host-Vehicle system is configured, use only security-validated RSE(s). Check for Security Validation of the RSE-Certificates. In case any of the RSE fails to pass them, ignore/negate the RSE from further processing.
2—For each of the RSE, calculate RSE values, such as Separation distance, Cross-range, down-range, cross-track, Relative-Heading. (see e.g.
Range: L=√(ΔNorth2+ΔEast2)
Or
L=SQRT (ΔNorth2+ΔEast2) (for square-root)
Relative-Heading: φ=arctan (ΔEast, ΔNorth)
Down-Range: Ld=L*cos φ
Cross-Range: Lc=L*sin φ
ΔEast=EastRsE−Eastvehicle
ΔNorth=NorthRSE−Northvehicle
3—Remove all the RSE(s) which have Cross-Range greater than dCR, e.g. 100 m (or meters); and proceed for further steps with rest of the RSE(s). The value of dCR in one embodiment is a fraction or a multiple of the range of communication device or a specific communication technology range specification.
4—In case there are more than 2 RSE(s) at this stage, Filter/Remove the RSE(s) which have a range (between host vehicle and each RSE) of greater than dR1, e.g. 500 m. (In case there are less than 2 RSEs at this stage, revert the filter.) The value of dR1 in one embodiment is in the order of (or a multiple of) the range of communication device or a specific communication technology range specification.
In one embodiment (see e.g.
1—Process all the RSE's and check if the Message(s) sent by them are the same for any 2 or more of the RSE(s).
2—Of the RSE(s) which have been detected to contain same message(s), store these RSEs into a duplicate list for further processing.
3—Of the RSE(s) in each of the Duplicate List (see e.g.
In one embodiment, this step would be processed when we have information related to the Remote-Vehicles (RV). We can use this information to determine points of interest. These points of interest would be used in latter steps to determine presence of RSE(s) near to them, and increase the priority of these RSE(s) relative to other RSE(s). (see e.g.
1—Process/Convert all RV(s) location within a region of interest and Heading angle, and convert them to values relative to Host Vehicle's (HV) Location and Heading angle.
2—For all the cases where RV is heading in a different direction with respect to HV, solve HV and RV paths equations to generate Intersecting point of these paths.
3—Of all these Intersection points, converge the sets of points which fall within e.g. d6 or 50 m radius of each other. The value of d6 in one embodiment is a fraction of the range of communication device or a specific communication technology range specification.
4—Of these intersection points, determine the location of them with respect to the host vehicle (e.g., whether it is Ahead or Behind of the Host-Vehicle).
5—In case multiple points are present, we can choose to ignore the locations which happen to be already traversed by the Remote-Vehicle.
6—Ignore all the locations which happen to fall behind the Host-Vehicle.
7—Of all the points which Fall ahead of Host Vehicle, pick the one which is closest to the Host-Vehicle (in terms of Down-Range).
In one embodiment, the Idea is to order all the RSE based on relevance of the RSE for the Vehicle using one or more of the following parameters:
We have the following steps:
1—Determine whether there are any RSE(s) located near to Point-Of-Interest (determined in Step-3, based on Remote-Vehicle(s) location). If true, use these RSE attributes to filter other RSE(s):
2—Pick all the RSE(s) which have a down-range of less than e.g. d7 or 50 m. The value of d7 in one embodiment is a fraction of the range of communication device or a specific communication technology range specification.
3—For the Rest of the RSE(s), having down-range >50 m, or d7, as an example, and Cross-Range of e.g. <30 m, or d5, as an example, order the RSE(s) based on the following criteria:
4—For all the Rest of the RSE(s), order them iteratively using Step 2 (e.g. using a loop), by increasing Cross-Range in steps of e.g. 30 m, or d5. (see, e.g.,
In one embodiment, whenever the Vehicle has a MAP-Message, we would be utilizing the MAP message to determine the Relevance of each of the RSE, and ordering it based on relevance of the RSE. The relevance factor or score, Rscore, e.g., can be between 0 to 100, or a fraction of 1, with maximum as 100 and 1, respectively.
We have the following steps: (see e.g.
1—First of all, Validate the MAP-message, to check the MAP can be used for this step or not.
2—Discard all the RSE(s) which cannot be plotted using the selected MAP message.
3—Determine whether there are any RSE(s) located near Point-of-Interest (POI) (determined in Step-3, based on Remote-Vehicle(s) location). If true, use these RSE attributes to filter other RSE(s):
4—Execute a simple Lane-Matching algorithm on the MAP message to determine the Lane-number on which the Vehicle is traversing. In one embodiment, the lane number is assigned from left to right, in a highway.
5—Determine the Lane-Properties of the Lane, and the Connecting Lanes for the current-Lanes based on the MAP-Message.
6—Based on Lane-Properties, determine if the Vehicle can head towards that RSE-Location, or not. If the Vehicle cannot proceed to an RSE-Location, Negate/Ignore that RSE from further processing.
7—Determine the RSE-Distance based on the MAP-message, from Vehicle-location to RSE-Location, traversing via the given MAP. (see e.g.
8—Pick the RSE(s) which have a separation distance (L4) of less than e.g. 100 m, or d4. (or d4>L4)
9—For rest of the RSE(s), determine the number of Hops or steps each of the RSE requires to reach the RSE-Location from the current location of the Vehicle.
10—Order RSE(s) based on Hop-Numbers and Separation distances.
In one embodiment, after ordering all the RSE(s), decide to either continue using existing RSE, or to switch to new RSE from the RSE-Relevance list. The decision is based on the Current RSE-location, RSE-Relevance list results, and Vehicle Location and its Dynamics.
1—Determine if the current RSE is still relevant, or we need to switch to a new RSE.
In one embodiment, we do not have for the RSE of interest to download a security certificate. In one embodiment, for downloading the security certificate, the criteria must be to select the RSE that has the highest probability to stay the longest in OBU/RSE communication, i.e., probability of having the maximum communication time to insure that the OBU has enough communication time with the RSE to finish downloading the security certificate. This can be done by an intelligent cost function that takes into consideration the relative location of the RSE with respect to the vehicle, the vehicle dynamics, such as speed, the strength of the of the communication signal, the behavior (over time) of these data, and the other similar parameters.
For security purposes, in one embodiment, the communications between or to/from the RSE or vehicles or central computer or OBU or host vehicle or service provider or government agency are done with the encryption and/or certificates. In one embodiment, the private/public key infrastructure (PKI) is used, for authentication or verification. In one embodiment, a secret hash function produces a hash value, accompanying the message, which verifies the authenticity of the message, which both sides have a copy of, beforehand, which is stored in a safe module.
In one embodiment, if a communication unit or module or device has no certificate for authentication, the data from that unit is ignored. Or, no communication to that unit is performed. In one embodiment, the certificate has a digital signature or key from a known authority or trusted organization. In one embodiment, the certificate has different levels of security and reliability, e.g., for faster processing, depending on the situation. For example, for non-critical decisions (or local decisions, not affecting other vehicles), one can lower the thresholds for the level of security, for simpler authentication, and thus, faster processing time, or less delays (at the expense of the security, if/when the decision or data is non-critical for the outcome, or the outcome is non-critical).
In one embodiment, the certificate level of reliability gives different weights for the data obtained from that unit. In one embodiment, the certificate level of reliability gives different priorities for storing or processing data from various units. In one embodiment, the certificate level of reliability gives different order for ignoring the messages or data from different units.
In one embodiment, the certificate from emergency management agency or fire department or government agency has a priority on all other data and messages from other units of communication. These get the highest priority for processing, and they cannot be discarded. For example, for flood news, accident pile up at the interstate highway, or tornado at some region, affecting the traffic, coming from the local or Federal government agencies, get the highest message or data processing priorities, before any other data, for emergency and safety reasons. The emergency code (e.g. code red for the highest level of emergency) is also encoded and carried e.g. in or with the message, or within its header or packaged data. Like any other message or data, in one example, the message should first be authenticated, before any action on the message takes place.
In one embodiment, there is a redundancy on the part of the units, e.g., to make sure if one or more units are disabled or attacked by hackers or have technical problems to properly function, then the others can collectively do the job, and bring enough information and data to make a right decision at the end. So, in one embodiment, there is an overlap in the coverage area, intentionally, in the circle or sphere of coverage, for the neighboring units, at a higher cost for overall infrastructure, but safer and more reliable for the outcome, at times of emergency and disaster, when not all units are functional. In one embodiment, there is a redundancy for verification of data, to make sure, e.g., one unit is not hacked, by checking it against others, as a predictive or extrapolating or self-checking mechanism, to find or pinpoint the unreliable unit, e.g., when the unit is consistently giving out wrong data, or inconsistent information, compared with all other units around it.
Here is one embodiment of the invention: A method for selecting road side equipment for controlling vehicles in a highway or street, said method comprising: a central computer receiving a total value which indicates number of road side equipment pieces that a host vehicle is able to receive data from; said central computer determining a type of data a first road side equipment piece transmits or supports; said central computer receiving a location of said first road side equipment piece from an input device; a certification device or module examining security validation of a certificate for said first road side equipment piece; said central computer receiving a location of said host vehicle; said central computer receiving dynamics information about said host vehicle; said central computer receiving a location of a second vehicle near said host vehicle from a location determination device or module; said central computer analyzing said total value which indicates number of road side equipment pieces that said host vehicle is able to receive data from, said type of data said first road side equipment piece transmits or supports, said location of said first road side equipment piece, said security validation of said certificate for said first road side equipment piece, said location of said host vehicle, said dynamics information about said host vehicle, and said location of said second vehicle near said host vehicle; and said central computer selecting said first road side equipment piece based on said analyzing step.
Here are more embodiments of the invention:
Here are more embodiments of the invention, for the system with various components:
RSE Filtering: (see
RSE filtering is performed using derived relative geometric data between the host vehicle and the RSE's, in addition to the host vehicle data, such as heading.
RSE's are filtered using cross range value first, and then the range value measured from host vehicle.
Detect and Filter Duplicate RSE's: (see
Detect RSE's which contain the same message.
After identifying duplicate RSE's, filter them iteratively based on range and cross range measured from the host vehicle.
Detection of Points of Interest (based on RV(s) and HV Intersecting Paths): (see
Select the RSE's that is close to the forward region that results from intersecting the RV's path with the host vehicle path.
Ordering RSE Based on RSE-Location and Vehicle Dynamics: (see
Fine select the RSE based on RSE location and vehicle dynamic data.
Ordering RSE Based on RSE-Location on MAP and Vehicle Dynamics: (see
The RSE are filtered based on Map data and vehicle dynamic data.
The RSE candidate of interest can be considered if vehicle position is located well inside the received map region.
Filter RSE's that are located farthest from the defined Point of interest (defined above).
Determine RSE of interest based on intended driving host vehicle path, determined by lane matching, lane properties, and lane connection.
Filter using the number hops or steps to arrive to the RSE.
Decide Which RSE to Use at the Present Instance: (see
Methods for locking, release, and switching the RSE.
Map data and relative map matched position, with respect to current RSE, and candidate RSE's, are used.
Predicted vehicle position is used.
Selection of RSE Based on Security Certificate Download: (see
Select the RSE that has the highest probability to stay the longest time in communication with On-Board Unit (OBU in the vehicle), i.e., the one with the highest probability of having the maximum continuous communication time with the vehicle, to insure that the OBU has enough communication time with the RSE to finish downloading the security certificate.
This can be done using cost function that takes into consideration the relative location of the RSE with respect to the vehicle, the vehicle dynamics (such as speed), the strength of the communication signal, and the behavior of these data over time. The cost function can be based on rewards for the better results or penalties for the worse results. The cost function can be used e.g. in a loop, e.g. as a threshold to get out of the loop, after enough accuracy or improvement is achieved, or as a metrics for how close or how accurate the answer or result is at this stage, or if there is enough incentive to continue on improving at this point (or we should stop at this point, with the current result).
Here, we describe the general/overall system for our embodiments above.
In one embodiment, we have the following technical components for the system: vehicle, roadway, communications, architecture, cybersecurity, safety reliability, human factors, and operations. In one embodiment, we have the following non-technical analysis for the system: public policy, market evolution, legal/liability, consumer acceptance, cost-benefit analysis, human factors, certification, and licensing.
In one embodiment, we have the following requirements for AV (automated vehicles) system:
In one embodiment, we have the following primary technologies for our system:
In one embodiment, we have the following building blocks for AVs:
Here are some of the modules, components, or objects used or monitored in our system: V2V (vehicle to vehicle), GPS (Global Positioning System), V2I (vehicle to infrastructure), HV (host vehicle), RV (remote vehicle, other vehicle, or 3rd party), and active and passive safety controls.
Here, we describe a method, as one embodiment: The first level of filtering is based on defining circle (geometry) of interest or any other geometrical shape (see also
In one embodiment, for example, for calculating R, we have (see also
R, as a function of host vehicle speed, FH, e.g.:
R=F
H(V)=50+2V+(V2/8)
Where V is the host vehicle speed in m/s.
In one embodiment, F is a function of velocities, distances, and coordinates, both in absolute values and relative values, for host and other vehicles. In one embodiment, F is a function of polynomial of degree G, in host vehicle speed V. In the example above, we have: G=2.
For example, for: 70 m≦R≦200 m
That is, Maximum (R) =200 m, and
Minimum (R)=70 m.
The 70 meter will still be sufficient to do all the rear applications. These numbers are just examples for some specific applications.
In one embodiment, the next step is to convert this R to delta Longitudinal and delta Latitude from the host vehicle coordinate. The objective here is to ignore all vehicles that are outside a radius. Here, we assumed circular filtering. Different types of geometric filtering can also be done: rectangle, ellipse, other irregular geometry, or any other regions or shapes. For circular filtering, given the current host vehicle (HV) coordinate (lat_HV, lon_HV), and given the desired filtering radius R, then the equivalent delta latitude (Delta lat) and delta longitudinal (Delta_lon), from (lat_HV, lon_HV) for this radius R, are calculated as follows (see also
Delta_lat=(R/Radius_of_earth)=(R/6378137),
e.g., based on Earth Equatorial radius of 6378137 m,
and where R is in meter (m).
Delta_lon=arcsin (sin(Delta_lat)/cos(lat—HV))
Therefore, in one embodiment, to apply the filtering algorithm for any node (Remote Vehicle (RV)), with the coordinate of (lat_RV, ion_RV), the following is executed (see also
If
Abs(lat—RV−lat—HV)>Delta_lat
OR
Abs(lon—RV−lon—HV)>Delta_lon
Then: Ignore it (i.e., do not process it).
Else: Process it.
Wherein all “lat” and “lon” values are expressed in radian. The default value for R is 200 m, but it is configurable. For jam reduction and reduction of processing, in one embodiment, we want to ignore all the vehicles outside of the radius R.
Now, in one embodiment, this value of R can be adaptively adjusted based on the statistical distribution of the nodes ranges (see also
In one embodiment, the second level of filtering is based on the relative velocity between the host vehicle and the remote vehicle. For example, for all remote vehicles that have a value of the velocity component in host vehicle direction that is greater than the host vehicle velocity, and they are also at relatively high range distance from the host vehicle, then they constitute no immediate threat on the host vehicle (based on the probability) (see also
In one embodiment, the third level of filtering is to adjust either the transmitted power and/or the received power threshold as a function of one of the following (as different embodiments) (see also
a. Rate of change in the number of received nodes. As the number of nodes increases sharply, the host vehicle is approaching a congested traffic area, and therefore, the transmitted power can be decreased to reduce the communication range, and/or the received power threshold can be increased to reduce the receiving communication range (see also
b. The map database can also be used very effectively: For example, if the number of connected road segments to the host vehicle road segment is high, and/or the total number of road segments is high within a defined area, then the transmitted power can be decreased, and/or the received power threshold can be increased (see also
c. Based on the calculated R. For example, communication range R decreases/increases, as the transmission power increases/decreases (see also
In one embodiment, the fourth level of filtering is just using the map database: For example, filter all the nodes (vehicles) that are on road segments that are not connected to the host vehicle road segment. An example for that is the main road and an overpass geometry. The main road and the overpass that passes over it are not connected, and thus, they do not make a V2V (vehicle to vehicle) possible traffic hazard. Map database can provide this information that these two road segments are not connected (see also
The advantages of our methods are very clear over what the current state-of-the-art is. Our methods optimally use the available processing power and available bandwidth on processing the data of the desired nodes, which are relevant or important. They also help reducing the communication congestion problem.
Please note that the attached Appendices (for the current and parent applications) are also parts of our teaching here, with some of the technologies mentioned there developed fully within our company, and some with prototypes, for which we seek patent protection in this and future/co-pending divisionals or related cases or continuations.
In this disclosure, any computing device, such as processor, microprocessor(s), computer, PC, pad, laptop, server, server farm, multi-cores, telephone, mobile device, smart glass, smart phone, computing system, tablet, or PDA can be used. The communication can be done by or using sound, laser, optical, magnetic, electromagnetic, wireless, wired, antenna, pulsed, encrypted, encoded, or combination of the above. The vehicles can be car, sedan, truck, bus, pickup truck, SUV, tractor, agricultural machinery, entertainment vehicles, motorcycle, bike, bicycle, hybrid, or the like. The roads can be one-lane county road, divided highway, boulevard, multi-lane road, one-way road, two-way road, or city street. Any variations of the above teachings are also intended to be covered by this patent application.
This application is a CIP of another co-pending US utility application, namely, Ser. No. 14/047,157, titled “System and method for map matching”, filed 7 Oct. 2013, which in turn is a CIP of two other co-pending US utility applications, namely, Ser. No. 13/907,864, titled “System and method for lane boundary estimation and host vehicle position and orientation”, filed 1 Jun. 2013, and Ser. No. 13/907,862, titled “System and method for node adaptive filtering and congestion control for safety and mobility applications toward automated vehicles system”, filed 1 Jun. 2013. It is also related to another US patent application filed on about the same day, with docket number Savari-5, with the same inventors and assignee, titled “System and method for creating, storing, and updating local dynamic MAP database with safety attribute”. The teachings of all the above applications are incorporated herein, by reference. The current application claims the priority date of the above applications.
Number | Date | Country | |
---|---|---|---|
Parent | 14047157 | Oct 2013 | US |
Child | 14163258 | US | |
Parent | 13907862 | Jun 2013 | US |
Child | 14047157 | US | |
Parent | 13907864 | Jun 2013 | US |
Child | 13907862 | US |