The present disclosure relates to autonomous vehicle navigation systems.
Lane-level congestion estimation is needed for many customer-facing applications including navigation, road anomaly detection, and accident reporting. Present systems assess road network congestion but lack lane traffic distribution information to identify lane congestion in high fidelity.
Thus, while current systems and methods for autonomous vehicle navigation achieve their intended purpose, there is a need for a new and improved system and method to identify lane-level road congestion.
According to several aspects, a method for collecting vehicle data from a fleet of vehicles; identifying a lane level distribution of multiple vehicles operating on a road having multiple lanes including a host vehicle; comparing the lane level distribution against a non-congested lane of the road; and identifying if a lane level congestion is occurring in at least one of the multiple lanes.
In another aspect of the present disclosure, the method includes: identifying at least one vehicle defining a lead actor vehicle ahead of the host vehicle moving slower than the host vehicle defining a slowdown of vehicle traffic; and increasing a deceleration profile for the host vehicle based on a planned deceleration of the lead actor vehicle.
In another aspect of the present disclosure, the method includes: operating sensors of the host vehicle to detect the lead actor vehicle; and initiating a deceleration of the host vehicle upon initial detection of the lead actor vehicle.
In another aspect of the present disclosure, the method includes: modifying a follow distance between the host vehicle and the lead actor vehicle; and continuing to follow the lead actor vehicle at the follow distance until after the host vehicle reaches the slowdown of vehicle traffic ahead of the host vehicle.
In another aspect of the present disclosure, the method includes: performing a lane level load balancing to mitigate against the non-congested lane identified by the host vehicle becoming congested; and creating multiple lane route options for multiple vehicles on the road including the host vehicle.
In another aspect of the present disclosure, the method includes: applying an equal lane route strategy to create the multiple lane route options, wherein top choices of the multiple lane route options are identified through an algorithm; applying utility-function metrics wherein an equal weight is assigned to individual ones of the multiple lane route options; randomizing the multiple lane route options and assigning a probability to individual ones of the multiple lane route options; and assigning one of the multiple vehicles to one of the multiple lane route options.
In another aspect of the present disclosure, the method includes: applying a proportional lane route strategy to create the multiple lane route options wherein the multiple lane route options are identified through an algorithm (which may include one of a Dijkstra algorithm or a Bellman-Ford algorithm); using utility-function metrics including identifying for individual ones of the multiple lane route options a designed capacity and a current usage traffic volume; assigning a different weight to different ones of the multiple lane route options based on an available traffic volume; and randomizing assignment of a probability to an individual one of the multiple vehicles and one of the multiple lane route options.
In another aspect of the present disclosure, the method includes: identifying a slowing vehicle defining a lead actor vehicle ahead of the host vehicle; and decelerating the host vehicle while maintaining a following distance to the lead actor vehicle.
In another aspect of the present disclosure, the method includes performing a trade-off analysis between a shortest travel time having multiple vehicle lane changes to accomplish to minimize an impact of one or more road congestion locations ahead of the host vehicle, and a customer comfort maximized by minimizing a quantity of the vehicle lane changes and by a trade-off through a utility function combing the travel time or the estimated time of arrival and the customer comfort together.
In another aspect of the present disclosure, the method includes applying a process to identify a system steady-state estimation.
According to several aspects, a method to incorporate road congestion for enhanced vehicle navigation, comprises: conducting an analysis of a current distribution of multiple vehicles in front of or proximate to a host vehicle traveling on a road having multiple vehicle lanes; assessing a vehicle clustering of at least one of the multiple vehicle lanes forward of the host vehicle; comparing results of the analysis and the vehicle clustering to a non-congested vehicle lane profile to distinguish a lane level distribution of the multiple vehicles in front of or proximate to the host vehicle; generating a prediction of at least one congested lane ahead of the host vehicle using the lane level distribution; and carrying out a trade-off analysis providing an estimated travel time (TT) of the host vehicle to a predetermined destination including predicting a total quantity of lane change maneuvers required by the host vehicle to minimize interaction with the at least one congested lane until reaching the predetermined destination.
In another aspect of the present disclosure, the method includes predicting the at least one congested lane using a process including a Markov Chain process.
In another aspect of the present disclosure, the method includes determining a system steady state estimation.
In another aspect of the present disclosure, the method includes incorporating first and second lane selection functions including: selecting a travel lane of the host vehicle in a first lane selection function based on both saved or input habits of a user of the host vehicle and a comfort level of the user of the host vehicle; and developing a lane selection in a second lane selection function based on planning data developed to prepare to exit the host vehicle at an upcoming road exit.
In another aspect of the present disclosure, the method includes: identifying a target lane for the host vehicle to transfer into ahead of reaching an exit from the road; and selecting one of adapting a vehicle speed of the host vehicle and moving the host vehicle to the target lane sooner in time to take the exit.
In another aspect of the present disclosure, the method includes providing visual indications of road segment congestion to a user of the host vehicle using multiple segments individually having a distinct color and a line width together indicating a non-congested condition, an increased congestion condition and a congested condition, the host vehicle automatically adjusting a driving path in view of the visual indications of road segment congestion.
In another aspect of the present disclosure, the method includes: directing a first or component A to issue a lane level congestion notification to a user or an operator of the host vehicle; providing a second or component B to perform lane level congestion-aware navigation; incorporating a third or component C to perform lane level load balancing; and including a fourth or component D directed to maintaining a lane level dynamic following distance.
According to several aspects, a method to incorporate lane level road congestion to enhance vehicle navigation comprises: providing individualized lane guidance to road users based on detected traffic distribution of lanes on a road to maximize traffic flow through a congested area; presenting lane profile data to the road users for consideration or to be used by autonomous vehicles as part of a vehicle behavior planning; presenting a road map depicting a predetermined portion of the road for vehicle travel having multiple lanes; depicting one or more congestion symbols on the road map if the congested area is identified in the predetermined portion of the road; and presenting a recommended vehicle travel path into one of the multiple lanes representing a recommended travel lane to minimize travel disruption in the congested area.
In another aspect of the present disclosure, the method includes: projecting at least one travel delay symbol and at least one estimated time of arrival (TT) symbol on the road map if the congested area is identified in the predetermined portion of the road; and identifying multiple lane changes to maximize vehicle travel through the congested area.
In another aspect of the present disclosure, the method includes: identifying a selected one of a first lane, a second lane and a third lane as the recommended travel lane on the predetermined portion of the road; and visually presenting directional indicators, for example arrows directed toward the recommended travel lane on individual ones of the first lane, the second lane and the third lane not identified as the recommended travel lane.
Further areas of applicability will become apparent from the description provided herein. It should be understood that the description and specific examples are intended for purposes of illustration only and are not intended to limit the scope of the present disclosure.
The drawings described herein are for illustration purposes only and are not intended to limit the scope of the present disclosure in any way.
The following description is merely exemplary in nature and is not intended to limit the present disclosure, application, or uses.
Referring to
During a first of the three performance evaluations, an analysis is conducted of a current lane level distribution of multiple vehicles in front of or proximate to the host vehicle 14, together with a vehicle clustering assessment of at least one vehicle lane forward of the host vehicle 14. Results of the first performance evaluation are compared to a non-congested vehicle lane profile to distinguish lane level distribution of the vehicles in front of or proximate to the host vehicle 14.
During a second of the three performance evaluations a lane level congestion prediction is performed which may be made using a process such as a Markov Chain process. It is noted other processes may also be used within the scope of the present disclosure. The lane level congestion prediction is performed to determine a system steady state estimation.
During a third of the three performance evaluations of the assessment portion 18, a trade-off analysis is conducted providing the estimated travel time (TT) or an estimated time of arrival (ETA) of the host vehicle 14 to a predetermined destination which includes predicting total lane change count maneuvers made by the host vehicle 14 until the predetermined destination is reached. The total lane change maneuvers are applied to ensure a predetermined vehicle user comfort is maintained during host vehicle travel which is described in greater detail herein.
Control of the system to incorporate lane level road congestion to enhance vehicle navigation 10 may be performed using an individual device such as a processor, a software component, an on-board computer or a remote located computer, hereinafter collectively referred to as the computer 22. The computer 22 may be deployed in the host vehicle 14 with perception capabilities or may be remotely located. The computer 22 is a non-generalized, electronic control device having a preprogrammed digital controller or processor, memory or non-transitory computer readable medium used to store data such as control logic, software applications, instructions, computer code, data, lookup tables, etc., and a transceiver or input/output ports. The computer readable medium includes any type of medium capable of being accessed by a computer, such as read only memory (ROM), random access memory (RAM), a hard disk drive, a compact disc (CD), a digital video disc (DVD), or any other type of memory. The non-transitory computer readable medium excludes wired, wireless, optical, or other communication links that transport transitory electrical or other signals. The non-transitory computer readable medium includes media where data can be permanently stored and media where data can be stored and later overwritten, such as a rewritable optical disc or an erasable memory device. Computer code includes any type of program code, including source code, object code, and executable code.
Results of the above three performance evaluations are forwarded to a map 24. The map 24 may include crowd sensed dynamic data 26 and a crowd sensed static map 28. Data collected or generated by the first system section 12 may be stored in and retrieved from a cloud computing network 30.
Following generation and collection of data by the first system section 12, additional analyses are performed by a second system section 32 which is located in the host vehicle 14. The first system section 12 communicates data with the second system section 32. For example, data from the crowd sensed static map 28 is communicated to a vehicle lane static onboard map 34. An output of a perception module 36 collecting data using sensors of the host vehicle 14 for example, and the crowd sensed dynamic data 26 together with requested data of the static onboard map 34 are together forwarded to an evaluation and selection module 38. The evaluation and selection module 38 also receives requested data from the map 24.
The evaluation and selection module 38 performs several functions. A first function of the evaluation and selection module 38 defines a route evaluation 40 wherein a route choice based on detected traffic is updated. A second function of the evaluation and selection module 38 defines first and second lane selection functions including a first lane selection function 42 wherein a travel lane of the host vehicle 14 is selected based on both saved or input habits of the user or passengers of the host vehicle 14 and a comfort level of the operator of the host vehicle 14 is selected. In a second lane selection function 44 a lane selection is developed based on planning data developed to prepare to exit the host vehicle 14 at an upcoming road exit. A third function of the evaluation and selection module 38 defines behavior adaptations including a headway adaptation 46, a lateral lane change adaptation 48, a speed profile adaptation 50 and a hazard mitigation 52. Data collected or analyzed by the second system section 32 is forwarded as vehicle control instructions to a vehicle control module 54.
Also provided in the second system section 32 is a vehicle navigation system 56 in communication with map 24. The vehicle navigation system 56 provides a notification unit 58 to provide system notifications to the operator of the host vehicle 14, a route selection unit which allows the operator to identify preferred routes, a load balancing unit 62 described in in reference to
A road and route intelligence unit of the vehicle navigation system 56 provides up-to-date road and route data to the user or operator of the host vehicle 14. This data includes data identified relative to enabled roads 66 defining roads which are available for vehicle travel, driver interventions 68 which identify to the operator of the host vehicle 14 when and if for example a driver takeover of operation of the automated vehicle defining the host vehicle 14 may be required, traffic dynamics 70 to provide up-to-date changes occurring on the road including for example accident reports, and road conditions 72 which provide up-to-date changes to road conditions which may occur for example due to weather conditions and the like.
Referring to
The individual segments of the collection of lanes may be further designated, such as the first or A segment 84 of the first lane 76 may be assigned a designation 94 defined as X(A,1), the first or A segment 84 the second lane 78 may be assigned a designation 96 defined as X(A,2), the first or A segment 84 the third lane 80 may be assigned a designation 98 defined as X(A,3), and the first or A segment 84 the fourth lane 82 may be assigned a designation 100 defined as X(A,4).
Visual indications of road segment congestion may be provided to the operator of the host vehicle 14. For example, the first or a segment 84 of the first lane 76 may be presented as a lane segment 102 having a first color or line width indicating a non-congested condition, the second or B segment 86 of the first lane 76 may be presented as a lane segment 104 having a second color or line width indicating an increased congestion condition, the third or C segment 88 of the first lane 76 may be presented as a lane segment 106 having the second color or line width indicating the increased congestion condition, the fourth or D segment 90 of the first lane 76 may be presented as a lane segment 108 having a third color or line width indicating a congested condition and the fifth or E segment 92 of the first lane 76 may be presented as a lane segment 110 having the third color or line width indicating the congested condition. The host vehicle 14 may automatically adjust a driving path or the operator of the host vehicle 14 may manually adjust the vehicle driving path in view of the visual indications provided by the road segment diagram 74.
According to several aspects, the system to incorporate lane level road congestion to enhance vehicle navigation 10 may be divisible into multiple components. For example, the system may be divisible into a component A directed to lane level congestion notification to the user or operator, a component B directed to lane level congestion-aware navigation, a component C directed to lane level load balancing and a component D directed to lane level dynamic following distance. Individual ones of the components are discussed below.
Referring to
Referring to
Referring to
Referring to
Equations 1 or 2 below provide exemplary equations which may be used for calculations required to implement component B. For example, on a lane #i in a road segment j, rather than using a travel time ti,j a utility function U i,j may be applied to characterize the travel time value and is used as a metric for navigation routing. Here, Ui,j is the utility function to characterize the metric in the road segment j and lane l, by jointly considering ETA time ti,j and comfort indicator Li,j through the mathematical formulation in Equation 1 or Equation 2.
For equations 1 and 2 above, the use of a segmented ETA (tij) or TT as the metric for routing decisions is replaced by the use of (1) a Lane/Segment+(2) the utility function Uij as the metric, which are plugged into a shortest-path algorithm, for example the Dijkstra algorithm or the Bellmen-Ford algorithm to compute the route/lane selection strategy. Here, the travel time estimates of route segments are aggregated to an estimated time or arrival for the journey. It is noted algorithms identified herein, including the Dijkstra algorithm and the Bellmen-Ford algorithm are provided as examples only. Multiple other algorithms may also be used within the scope of the present disclosure.
Referring to
Component B defining lane level congestion-aware navigation permits the host vehicle 14 to comprehend the backup or congestion ahead of host vehicle 14 while still traveling on the first road 146. Using this data, the host vehicle 14 may adapt a vehicle speed and/or change to the target lane 152 sooner in time to take the exit 148.
Component C of the system to incorporate lane level road congestion to enhance vehicle navigation 10 defining lane level load balancing is provided to mitigate against a non-congested lane identified by the host vehicle 14 and recommended for a lane change becoming suddenly congested. The load balanced guidance provided by component C is also applied to ensure system recommended lane change advice does not adversely affect lane traffic flow. For example, after directing all vehicle traffic to a non-congested lane route, the previously non-congested lane route may become suddenly congested as other vehicle operators see an opportunity to move into the previously non-congested lane route. Two lane route assignment strategies are provided.
A load balancing method of the present disclosure requires the top K choices of lane route options be based on the shortest-path algorithm outlined above in reference to component B. Disjointed lane routes are preferred over non-disjointed lane routes. The vehicle traffic assignment is randomized across legitimate K options of the lane route. The vehicle route assignment is allocated based on available remaining capacity of each lane route.
Two lane route strategies using the present load balancing method may be applied. In a first or equal strategy, the top K choices of lane route options are identified through an algorithm such as the Dijkstra algorithm or the Bellman-Ford algorithm, using utility-function metrics which are outlined above with respect to component B. Equal weight is assigned to each lane route option. The assignment of an individual vehicle to a particular lane route option is randomized and a probability is assigned wherein the probability Pi.=1/K.
In a second or proportional lane route strategy, the top K choices of lane route options are identified through an algorithm such as the Dijkstra algorithm or the Bellman-Ford algorithm, using utility-function metrics. For each lane route option i (i∈k), a designed capacity Ci and its current usage traffic volume Ui are identified. A different weight is assigned to different lane route options based on an available or remaining traffic volume. The assignment of each vehicle to a particular lane route option i is randomized with probability, using equation 3 below:
Component D1 of the system to incorporate lane level road congestion to enhance vehicle navigation 10 defining lane level dynamic following distance is provided when a slow-down is identified ahead of the host vehicle 14. When a slow-down is identified the host vehicle 14 dynamically modifies a following distance between the host vehicle 14 and a lead vehicle such as the second vehicle 16 located ahead of the host vehicle 14 in order to prepare for an upcoming deceleration of the second vehicle 16. The increase in following distance allows the host vehicle 14 to plan a longer deceleration profile to be initiated when host vehicle sensors detect the second vehicle 16 is beginning to decelerate.
Referring to
If a response to the vehicle query 170 is NO 164 a profile deceleration command 186 is issued which increases a deceleration profile of the host vehicle 14 based on an anticipated or planned deceleration of a speed of traffic reported ahead of the host vehicle 14. Following the profile deceleration command 186 a sensor query 188 is made to identify if sensors of the host vehicle 14 detect other actors or vehicles ahead of the host vehicle 14. If a response to the sensor query 188 is NO 190 a continue command 192 is issued which commands the host vehicle 14 to continue diving with a higher deceleration profile until the host vehicle 14 is past the detected slowdown. If a response to the sensor query 188 is YES 196, an initiate deceleration command 198 is issued which initiates deceleration of the host vehicle 14 upon a first real detection of a slower moving actor or vehicle ahead of the host vehicle 14. At a time after the initiate deceleration command 198 is issued a continuation command 200 is issued which commands the host vehicle 14 to continue following the slower moving actor at a calculated new distance until the host vehicle 14 is past the detected slowdown and the program ends at a third end step 202.
If a response to the update query 176 is NO 204 a continue following command 206 is issued which commands the host vehicle 14 to continue following the slowing actor vehicle at a new calculated distance until the host vehicle 14 is past the slowdown, and the program ends at a fourth end step 208.
Referring to
Initially, a program start 212 is conducted and a differential speed query 214 is made to check if a differential speed to adjacent traffic threshold is met. Following the differential speed query 214 an adjacent actor query 216 is made to identify if actor vehicles are adjacent to the host vehicle 14. If a response to the adjacent actor query 216 is NO 218, the program ends at a first program end step 220. If a response to the adjacent actor query 216 is YES 222, a speed determination 224 is conducted to identify if an adjacent actor vehicle is moving the host vehicle speed or a host vehicle set speed. If a response to the speed determination 224 is NO 226, the program ends at a second end step 228. If a response to the speed determination 224 is YES 230 a host vehicle lane query 232 is conducted to identify if the host vehicle 14 is in an open lane. If a response to the host vehicle lane query 232 is NO 234 a modify speed profile command 236 is generated and the program ends at a third end step 238. If a response to the host vehicle lane query 232 is YES 240 a speed reduction command 242 is generated to temporarily reduce a speed of the host vehicle 14 to a predetermined differential of an adjacent actor speed. Following the speed reduction command 242 a reaction command 244 is generated which allows the host vehicle 14 to react to any cut or reduction in a quantity of adjacent actor vehicles and the program ends at a fourth end step 246.
Referring to
With further reference to
The vehicle 252 further includes a telematics module 278 which may communicate via a global navigation satellite system (GNSS) and using vehicle-to-network (V2N) communication protocols with the navigation module 270. The telematics module 278 is responsible in part to perform data collection tasks. For example, the telematics module 278 may receive GPS data, crash event data, hard braking data and stability data, all collectively defining vehicle data 280 from a crowd sourced vehicle fleet 282. An output of the navigation module 270 may also define guided navigation routing information 284 and free navigation alerts 286.
According to several aspects, the method of the present disclosure provides use of a large volume of vehicle data and advanced algorithms to achieve lane-level congestion identification. The method of the present disclosure applies the lane-level congestion plus comfort measures to assist vehicle decision making, including making AV navigation decisions. The method of the present disclosure performing a trade-off analysis between a shortest travel time which may include multiple vehicle lane changes to accomplish to minimize an impact of one or more road congestion locations ahead of the host vehicle, and customer comfort which is improved by reducing or minimizing a quantity of vehicle lane changes. The method of the present disclosure also provides an enhancement to human machine interfaces (HMIs). According to several aspects, a lane route option is provided to different vehicles based on load balancing among different available options. According to several aspects, headway dynamics and speed advisory information are provided based on lane-level traffic dynamics and traffic dynamics of adjacent lanes.
The system to incorporate lane level road congestion to enhance vehicle navigation 10 of the present disclosure also provides a method to perform lane level distribution, clustering and analysis against a non-congested lane profile. The method to perform lane level congestion prediction may apply a Markov Chain process to identify a vehicle arrival and provide a system steady state estimation. The method also includes performance of a trade-off analysis between an estimated time of arrival of the host vehicle and determination of lane change count maneuvers made during travel, used to minimize lane changes which ensure operator or user comfort.
A system to incorporate lane level road congestion to enhance vehicle navigation 10 of the present disclosure offers several advantages. These include provision of lane-level congestion and comfort measures to assist navigation decision making. These include selection of a travel lane that best matches a customer preference and avoids traffic congestion. Also included is an input to a behavior planning module to ensure successful AV navigation to a vehicle exit ramp.