Method for planning a cooperative driving maneuver, corresponding control unit and vehicle equipped with the control unit, and computer program product
By determining the timeout value and branch points in collaborative driving operation, the efficiency of the negotiation stage is optimized, the inefficiency problem caused by the exceeding the negotiation time limit is solved, and the efficiency and accuracy of collaborative driving operation is improved.
Patent Information
- Application Number
- CN202110123473.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Priority Date
- 2020-01-30
- Filing Date
- 2021-01-29
- Publication Date
- 2024-11-22
- Estimated Expiration
- 2041-01-29
AI Technical Summary
The existing collaborative driving operation may result in inefficient and extended manipulation processes due to time limits during the negotiation stage, and the V2V traffic increases, affecting system efficiency.
By determining the timeout value of collaborative driving manipulation, sending a collaborative driving manipulation request message, and changing the expected trajectory before the timeout value, checking whether the vehicle will reach the branch point before the end of the negotiation phase, and if so, terminate the collaborative driving manipulation plan, and No request message is issued. The negotiation time is determined by calculating the number of vehicles and network transmission time, ensuring the accuracy of the negotiation phase.
Inefficient collaborative driving manipulation is avoided, the efficiency of the negotiation stage is improved, unnecessary V2V communication is reduced, and the effectiveness and time safety of collaborative driving manipulation is ensured.
Smart Images

Figure CN113264058B_ABST
Abstract
Description
Technical Field
[0001] The present disclosure relates to the field of cooperative driving maneuvers supported by means of vehicle-to-vehicle communications. The present disclosure further relates to a corresponding control unit and a vehicle equipped with such a control unit, and a corresponding computer program. Background Art
[0002] Autonomous driving (sometimes referred to as self-driving, automated driving or piloted driving) is the movement of vehicles, mobile robots and unmanned transport systems with a large degree of autonomy. There are different degrees of autonomous driving. In this case, autonomous driving can be said to occur at certain levels even if the driver is still present in the vehicle, who may simply take over the supervision of the automated driving operation. In Europe, various transport ministries (in Germany, the Federal Institute for Road Systems (Bundesanstalt für Straβenwesen) is involved) have worked together and defined the following stages of autonomy. A slightly different classification is available from the Society of Automotive Engineers.
[0003] Level 0: "Driver only", the driver drives, steers, gives gas, brakes, etc.
[0004] Level 1: Certain assistance systems help with vehicle operation (including cruise control – Automatic Cruise Control ACC).
[0005] Level 2: Partial automation, where automatic parking, following functions, general longitudinal guidance, acceleration, deceleration, etc. are taken over by assistance systems (including collision avoidance).
[0006] Level 3: High automation. The driver does not have to monitor the system continuously. The vehicle independently performs functions such as triggering of turn signals, lane changes and tracking. The driver can turn to other things, but the system is required to take over leadership within the warning period if requested. On highways, this form of autonomy is technically feasible. Legislators are working to allow Level 3 vehicles. The legal framework has already been created.
[0007] Level 4: Full automation. The system permanently assumes control of the vehicle. If the system is no longer able to handle the task, the driver may be asked to take the lead.
[0008] Level 5: No driver required. No human intervention is required other than setting the target and activating the system.
[0009] It is envisaged that future cooperative driving applications will significantly improve the efficiency and comfort of automated driving. The increased cooperative aspect between vehicles places specific demands on the communication system and the way messages are exchanged among the cooperating vehicles. The field of use to which the invention relates starts from level 2 and involves important aspects of cooperative driving maneuvers. Such applications, more particularly cooperative collision avoidance, place very stringent demands on the overall time to build a cooperative decision and require simple, reliable and effective solutions.
[0010] Automated vehicles broadcast their future paths as trajectories. A path is an ordered collection of points in space. A trajectory is a path with a time plan, usually for a fixed period of time (e.g. 10 seconds). As a result, the distance covered by the planned trajectory will depend on the speed, which is determined by the time plan. The coordination of maneuvers among a group of vehicles is performed by negotiation. These negotiations are supported by the exchange of Maneuver Coordination Messages (MCMs). The MCMs will consist of a planned trajectory and a desired trajectory. The idea behind the desired trajectory is that the other vehicles can accept the desired trajectory from a partner and adapt their planned trajectory. Depending on the number of communication partners and their trajectories, the complexity of the negotiation phase varies. The higher the number of communication partners, the longer the negotiation may take.
[0011] In these systems, accurate position determination of the vehicle from stage to stage, as well as accurate observation of the vehicle's surroundings are important. In particular, position determination techniques are known that take into account absolute position data and odometry position data when determining an estimated position of a motor vehicle.
[0012] In this case, the absolute position data indicates the measured position of the motor vehicle at a certain time with an absolute value, for example in a UTM or WGS84 reference coordinate system. Optionally, the absolute position data may also be provided with an orientation, for example the current direction of movement of the motor vehicle. The combination of position and orientation is often referred to as pose. Position is usually expressed in two dimensions in a Cartesian coordinate system.
[0013] For cooperative driving or autonomous driving, the exchange of certain information between vehicles is very important. Such information included in the message can be position information, surrounding environment information, trajectory information, warning information, control information, etc.
[0014] US 2019 / 0207800A1 relates to the field of network communication technology, and in particular to a vehicle-to-roadside and vehicle-to-vehicle communication test method based on the IEEE 802.11p protocol for vehicle Internet. The proposal involves: sending a throughput test request data packet from a host vehicle communication unit to a target vehicle communication unit; and starting a timer using the throughput test request data packet as a period after receiving the throughput test request data packet.
[0015] According to KR 2017120420 A1, a vehicle-to-vehicle tester for a transmission and reception test system including a test method is known.
[0016] An overview of the different stages of maneuver coordination for automated vehicles is given in Bernd Lehmann, It can be found in the article "A generic approach towards maneuver coordination for automated vehicles" by Günther and Lars Wolf (2018 21st International Conference on Intelligent Transportation Systems (ITSC). IEEE, 2018).
[0017] The inventors have identified different problems with the approaches described above. The main challenge faced by the approach described in the article "A reference architecture for CISS / CDAS within the field of cooperative driving" is that it requires extensive message exchanges among the partners in a very short time over an error-prone communication network.
[0018] Xu Wenbo et al. describe a communication protocol in "Autonomous Maneuver Coordination Via Vehicular Communication" (2019 49TH ANNUAL IEEE / IFIP INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS WORKSHOPS (DSN-W), IEEE, June 24, 2019 (2019-06-24), pp. 70-77, XP033602308, DOI: 10.1109 / DSN-w.2019.00022), based on which cooperative driving maneuvers are confirmed during a negotiation phase between vehicles and their corresponding trajectories. The details of the communication protocol have been described above. The described consensus mechanism prevents collisions between requesting vehicles and accepting vehicles. The coordination protocol is considered to be more time-safe than in the absence of any coordination.
[0019] A collaboration message usually implies that the collaboration is negotiated within a certain time slot; therefore, the process is time-constrained. This time is not constant and depends on several parameters, such as the relative speed between the vehicles and the validity time of the desired maneuver. If the negotiation time is greater than the validity time of the desired maneuver, it makes no sense to send a request message for a collaborative maneuver. In other words, if a vehicle requests a collaborative maneuver, this is invalid even though it knows in advance that the remaining time for the negotiation is insufficient. On the other hand, if there is not enough time to perform the negotiation with respect to the validity time of the desired trajectory, the vehicle receiving the request message should not agree to the negotiation.
[0020] Therefore, a problem with such cooperative maneuvers is that the negotiation phase may expire during the negotiation and this may result in inefficient and longer duration maneuvers.Another problem is related to the increase in the amount of V2V communications for cooperative maneuver planning.
[0021] Therefore, there is a need for an improved method for the negotiation phase of a cooperative driving maneuver that avoids the above-mentioned disadvantages. This corresponds to the problem of the present invention.
[0022] This object is achieved by the subject matter of the present invention. DETAILED DESCRIPTION OF THE INVENTION Advantageous further developments and improvements of the invention are described. Summary of the invention
[0023] The solution according to the invention comprises a method for planning a cooperative driving maneuver, comprising the steps of observing the surroundings of a vehicle; determining a planned trajectory on which the vehicle is driven for a certain amount of time; and determining a desired trajectory different from the planned trajectory, the desired trajectory requiring a cooperative driving maneuver with at least one of the surrounding vehicles. The solution further comprises the steps of determining a timeout value for the cooperative driving maneuver; starting a negotiation phase with the vehicles involved in the cooperative driving maneuver by sending a cooperative driving maneuver request message; waiting for a response message from the vehicles involved; and changing to the desired trajectory if the vehicles involved have accepted the desired trajectory before the negotiation phase has expired according to the timeout value. The solution has the advantage that inefficient cooperative driving maneuvers are avoided. This may occur if the negotiation phase of the cooperative driving maneuver has been started but needs to be stopped before the negotiation phase is completed. A reason for this may be that the requesting vehicle has missed an entry point into the desired trajectory after the negotiation phase has ended.
[0024] Therefore, in an enhanced embodiment, it is advantageous if the method further comprises the step of determining a branch point corresponding to a point co-located on the planned trajectory and the desired trajectory. The branch point is further characterized in that starting from this point, the planned trajectory and the desired trajectory diverge, even if they are allowed to merge again later. The method then further comprises the step of checking whether the vehicle will reach the branch point before the negotiation phase ends according to the determined timeout value, and if so, it follows the step of terminating the planning of the cooperative driving maneuver and not issuing the cooperative driving maneuver request message.
[0025] For determining the timeout value, the method advantageously comprises the step of determining the number of vehicles involved in the cooperative driving maneuver. Advantageously then, the negotiation time for the cooperative driving maneuver is calculated by adding a typical time for deciding to accept or reject a cooperative driving maneuver to the product of a typical one-way travel time required to send a message from one vehicle to another multiplied by the number of vehicles involved in the cooperative driving maneuver. The number of vehicles involved corresponds to the number of vehicles from which a response to the cooperative driving maneuver request message is due. It is to be noted that the time for deciding to accept or reject a cooperative driving maneuver is not multiplied by the number of vehicles involved, since the decision process will be performed in parallel in the vehicles involved.
[0026] Furthermore, advantageously, a typical round trip time for an internal network transmission in a vehicle that has issued a cooperative driving maneuver request message is added to the negotiation time. This solution has the advantage that the required negotiation time from the perspective of the vehicle that has issued the cooperative driving maneuver request message is determined relatively accurately.
[0027] The accuracy of the negotiation time can be further increased if, in the vehicles that have issued the cooperative driving maneuver request message, the typical one-way travel time required to send a message from one vehicle to another is adapted to a current estimate of the quality of service of the V2V radio communication.
[0028] Advantageously, the determined negotiation time can be used in the following manner for vehicles that have issued a cooperative driving maneuver request message: First, when it is found that the requesting vehicle will reach the branch point before the total negotiation time has expired, a timeout value is set to the total negotiation time. This timeout value is entered into the payload field of the cooperative driving maneuver request message. With the timeout value entered in the cooperative driving maneuver request message, the vehicles involved are informed of the timeout value for the negotiation phase of the cooperative driving maneuver.
[0029] It is also advantageous if, in the payload field of the cooperative driving maneuver request message, the planned trajectory and the desired trajectory are also entered in order to inform the vehicles involved about the planned cooperative driving maneuver.
[0030] Likewise, advantageously, the involved vehicle performs a step of checking a timeout value in a received cooperative driving maneuver request message. When it finds that the typical time for deciding to accept or reject a cooperative driving maneuver is longer than the reported timeout value, it will stop the negotiation of the cooperative driving maneuver. To inform the requesting vehicle, the involved vehicle will transmit a message back to the requesting vehicle in which the cooperative driving maneuver is rejected.
[0031] Another embodiment of the invention relates to a control unit adapted to perform the steps of the method according to the invention.
[0032] Likewise, a vehicle equipped with such a control unit corresponds to a further embodiment of the present invention.
[0033] Furthermore, a further exemplary embodiment of the present invention is a computer program having program steps which, when a computer unit processes the program, cause it to carry out the method according to the present invention. BRIEF DESCRIPTION OF THE DRAWINGS
[0034] Exemplary embodiments of the invention are illustrated in the drawings and are explained in more detail below with reference to the drawings.
[0035] In the attached picture:
[0036] Figure 1 Principles of vehicle communications via mobile radio;
[0037] Figure 2An example of a cooperative driving scenario where one vehicle requests a cooperative driving maneuver by sending its planned trajectory and desired trajectory to surrounding vehicles in a cooperative driving maneuver request message;
[0038] Figure 3 a representation of a desired trajectory ahead of a moving vehicle;
[0039] Figure 4 A block diagram of a vehicle board electronic network having various vehicle electronic components is shown;
[0040] Figure 5 Manipulate the format of coordination request messages;
[0041] Figure 6 A flow chart of a computer program for estimating a negotiation time required to negotiate a cooperative driving maneuver among involved vehicles; and
[0042] Figure 7 Example of message exchanges between involved vehicles of a cooperative driving maneuver according to a cooperative protocol (left) and a timeline for execution (right). DETAILED DESCRIPTION
[0043] This description illustrates the principles of the present disclosure. It will thus be appreciated that those skilled in the art will be able to devise various arrangements that, although not explicitly described or shown herein, embody the principles of the present disclosure.
[0044] All examples and conditional language recited herein are intended for educational purposes to help readers understand the principles of the present disclosure and the concepts contributed by the inventors to advance the art, and are to be construed as not being limited to such specifically recited examples and conditions.
[0045] In addition, all statements in this article recording the principles, aspects and embodiments of the present disclosure and specific examples thereof are intended to cover both structural and functional equivalents thereof. Additionally, it is intended that such equivalents include both currently known equivalents and equivalents developed in the future, i.e. any element developed that performs the same function, regardless of structure.
[0046] Thus, for example, it will be appreciated by those skilled in the art that the diagrams presented herein represent conceptual views of illustrative circuitry embodying the principles of the disclosure.
[0047] The functions of the various elements shown in the figures may be provided using dedicated hardware, as well as hardware capable of executing software in association with appropriate software. When provided by a processor, these functions may be provided by a single dedicated processor, by a single shared processor, or by multiple separate processors (some of which may be shared). In addition, the explicit use of the term "processor" or "controller" should not be interpreted as exclusively referring to hardware capable of executing software, but may implicitly include, but are not limited to: digital signal processor (DSP) hardware, read-only memory (ROM), random access memory (RAM), and non-volatile storage for storing software.
[0048] Other hardware, conventional and / or custom, may also be included. Similarly, any switches shown in the figures are conceptual only. Their functions may be performed by the operation of program logic, by dedicated logic, by the interaction of program control and dedicated logic, or even manually, with the particular technique being selectable by the implementer as more specifically understood from the context.
[0049] In the claims herein, any element recited as a means for performing a specified function is intended to encompass any manner of performing that function, including, for example: a) a combination of circuit elements that perform that function; or b) in any form of software, thus including firmware, microcode, etc., combined with appropriate circuitry for executing the software to perform that function. The disclosure as defined by such claims resides in the fact that the functionality provided by the various recited components are combined and brought together in the manner claimed. It is therefore considered that any components that can provide those functions are equivalent to those shown herein.
[0050] Figure 1 The principle of vehicle communication using mobile radio is shown. The vehicle is marked with reference numeral 10. The term "vehicle" is to be understood as a collective term for motor vehicles with an internal combustion engine or an electric motor, whether for bicycles with or without an electric motor or other vehicles powered by muscle, or for vehicles with one, two, four or more wheels. Whether for motorcycles, passenger cars, trucks, buses, agricultural vehicles or construction machinery. This list is not exhaustive and includes other vehicle categories.
[0051] Since automated driving is on the rise, a lot more data needs to be exchanged among road participants and also between road participants and the network. The communication systems for V2V and V2X communications need to be adapted accordingly. The 3GPP standard setting organization has and is releasing the functionality of the new generation 5G cellular mobile communication system, including vehicle-to-anything (V2X) functionality. A wide range of vehicle use cases has been designed, ranging from infotainment to collaborative driving. When it comes to time-critical applications related to safety, such as collaborative driving, the requirements are for information exchange at low latency, high data rates and high reliability. In LTE, according to Long Term Evolution, V2X communications are called LTE-V, and in the case of the 5G initiative, this variant is called PC5. Another method for implementing V2X communications is based on the WLAN standard IEEE802.11p.
[0052] exist Figure 1 In the embodiment of the present invention, the vehicles are equipped with a communication module 160, which serves as a transmission and reception unit for communication in a mobile radio network. Due to the integrated communication module 160, the vehicle 10 corresponds to a mobile radio network subscriber station here. All messages from the vehicle (uplink) and to the vehicle (downlink) are either routed via a base station 210 serving a mobile radio cell, or directly routed between the vehicles 10 in the case of direct vehicle communication (side link). If the vehicle 10 is within the mobile radio cell, they are registered or logged in at the base station 210. If they leave the mobile cell, they are handed over to a neighboring cell (handover) and are deregistered or logged out at the base station 210 accordingly. The base station 210 also provides access to the Internet, so that the Internet data in the mobile radio cell is provided to the vehicle 10 or all other mobile radio subscribers. For this purpose, the base station 210 is connected to the EPC 200 (Evolved Packet Core) via the so-called S1 interface. The back-end server 320 is also accessible via the Internet 300 or another wide area network WAN. It may be located in a traffic control center, for example, to which it may report some of the position data or trajectory information of individual vehicles 10 .
[0053] Finally, infrastructure network components are also shown. This can be exemplified by a roadside unit RSU 310. For ease of implementation, it is assumed that all components have been assigned Internet addresses (usually in the form of IPv6 addresses) so that packets transmitting messages between components can be routed accordingly. When V2X communication is implemented based on WLAN p, the vehicle can also exchange information with the roadside unit 310.
[0054] Figure 2 An example of a cooperative driving scenario is shown. Figure 2Five vehicles are shown. Vehicle 10A is driving in the left lane of a road having two lanes in each direction. In front of vehicle 10A, a broken-down vehicle 10D is located. Therefore, vehicle 10A needs to change to the second lane in order to pass broken-down vehicle 10D. Vehicle 10C is driving slightly behind vehicle 10A in the second lane, and vehicle 10B is driving in front of vehicle 10C in the second lane. Vehicle 10A seeks to perform a cooperative driving maneuver with vehicle 10C and sends a cooperation request message to the surrounding vehicles. This message is called a maneuver coordination message MCM. Such an MCM message is broadcast via a broadcast channel of a mobile radio system. Other vehicles consider the timeout of the cooperation request. The timeout value in the MCM message is the time until the requesting vehicle 10A needs to receive a reply.
[0055] Figure 3 A vehicle 10A is shown and illustrates how its own possible movement in the future can be described. The predicted ego movement is described by an expected vehicle trajectory DT over the next few seconds. A typical time period for a trajectory is 10 seconds. Figure 2 A cooperative driving maneuver is shown in which the requesting vehicle 10A has an available planned trajectory labeled PT. The planned trajectory PT describes the planned movement from a first driving lane to a second driving lane of the road. Of course, since the vehicle 10A has identified that the vehicle 10D is blocking the road in the first lane, the vehicle 10A determines another trajectory that allows the vehicle 10A to avoid the blocking situation. This alternative trajectory is named the desired trajectory and is labeled with the reference DT. Figure 3 The trajectory DT is shown, which is a trajectory from a point (x e ,y e ) is composed of a plurality of consecutive positions. The desired trajectory DT describes a path on which the vehicle 10A can change to the second lane on which the vehicles 10B and 10C are already driving, see Figure 2 Since the vehicle 10C is very close to the vehicle 10A, it is not possible to change to the second lane immediately, and therefore the vehicle 10A needs to request a cooperative driving maneuver. To this end, the vehicle 10A broadcasts its desired trajectory DT to the surrounding vehicles in an MCM message.
[0056] Figure 4A block diagram of the onboard electronic system of a vehicle 10A is schematically shown. Vehicles 10B to 10D can also be equipped with the same kind of onboard electronic system. It is assumed that the vehicle 10A is equipped with autonomous driving capabilities. Vehicles 10B to 10D can also be equipped with autonomous driving capabilities. Part of the onboard electronic system is an infotainment system, which includes: a head-up display 20, a touch-sensitive display unit 30, a computing device 40, an input unit 50 and a memory 60. The display unit 30 includes both a display area for displaying variable graphic information and an operator interface (touch-sensitive layer) arranged above the display area for inputting commands by a user. The memory device 60 is connected to the computing device 40 via a further data line 80. In the memory 60, a pictogram catalog and / or a symbol catalog is stored together with the pictograms and / or symbols for possible overlay of additional information.
[0057] Other parts of the infotainment system, such as the camera 150, the radio 140, the navigation device 130, the phone 120 and the instrument cluster 110, are connected to the computing device 40 via the data bus 100. However, modern vehicles 10 may also have additional components, such as additional surrounding scanning sensors, such as a lidar (light detection and ranging) sensor 152 or a radar (radio detection and ranging) sensor 154, and more video cameras 150, for example as front cameras, rear cameras or side cameras. Such sensors are increasingly used in vehicles for surrounding observation. Radar and lidar sensors 152, 154 can be used to scan a range of up to 150 meters or 250 meters, and cameras 150, 151 cover a range from 30 to 120 meters. In addition, an inertial measurement unit 170 is also connected to the communication bus 100. It can be used as part of the vehicle's odometer in order to improve the accuracy of the vehicle's positioning system.
[0058] As data bus 100, a high-speed variant of the CAN bus according to ISO standard 11898-2 can be considered. Alternatively, for example, the use of an Ethernet-based bus system (such as IEEE 802.03cg) is another example. Bus systems in which data is transmitted via optical fiber are also available. Examples are MOST bus (medium-oriented system transmission) or D2B bus (home digital bus). For inbound and outbound wireless communications, vehicles 10A-10D are equipped with a communication module 160. It can be used for mobile communications, such as mobile communications according to the 5G standard and / or communications based on WLAN p communication systems.
[0059] Reference numeral 181 denotes an engine control unit. Reference numeral 182 corresponds to an ESC control unit corresponding to an electronic stability control, and reference numeral 183 denotes a transmission control unit. The networking of such control units, all of which are assigned to the category of a transmission system, typically takes place using a CAN bus system (controller area network) 104. Since various sensors are installed in a motor vehicle and these sensors are no longer connected only to individual control units, such sensor data are also distributed to individual control devices via the bus system 104.
[0060] Additional control devices, such as an automatic driving control unit ADC 180, etc., may be provided in the vehicles 10A to 10D. The Ethernet bus may be a choice for the communication bus 106 due to its higher data transmission bandwidth. In the IEEE802.1Q specification, an Ethernet bus adapted to the special needs of automotive communication is standardized. In addition, a lot of information for the observation of the surrounding environment can be received from other road participants via V2V communication. In particular, for those road participants who are not within the line of sight LOS of the observing vehicle, it is very advantageous to receive information about their position and movement via V2V communication.
[0061] Reference numeral 190 denotes an on-board diagnostic interface.
[0062] For the purpose of transmitting vehicle-related sensor data such as the desired trajectory to another vehicle 10 or a backend server 320 via a communication interface 160, a gateway 142 is provided. It is connected to different bus systems 100, 102, 104 and 106. The gateway 142 is adapted to convert the data it receives via one bus into the transmission format of another bus so that it can be distributed in the packets specified there. In order to forward this data to the outside, i.e. to another vehicle 10 or to the control central computer 320, the onboard unit 160 is equipped with a communication interface in order to receive these data packets and then convert them into the transmission format of the corresponding mobile radio standard used. If data is to be exchanged between different bus systems, the gateway 142 takes all necessary format conversions, if necessary.
[0063] When the vehicle 10A is planning a cooperative maneuver, the ADC unit 180 calculates the desired trajectory DT. It also transmits the desired trajectory DT to the communication module 160 via the gateway 142 and requests the transmission of an MCM message with the desired trajectory DT. The format of the MCM message is as follows: Figure 5 Described in.
[0064] In the header field M1 of the MCM message, the PDU header of the MCM message is included, and the PDU header has entries for the protocol version, message identifier and station identifier of the MCM message being issued. In the first payload field M2, the starting point SP is included, and the starting point SP has position information, for example, in the WGS84 coordinate system, lane position and time information when the message has been formed. In the second payload field M3, the planned trajectory PT is entered. The third payload field M4 contains the expected trajectory DT. As described above, the planned trajectory and the expected trajectory can span a time period of 5 to 10 seconds of future vehicle movement. Optionally, after the payload field, another field with an error code may be used to protect the message from errors (not shown).
[0065] The MCM message will be broadcast to the surrounding vehicles. In the WLAN p communication system, the broadcast channel can be used for this purpose. The surrounding vehicles 10B-10D need to check whether the desired trajectory DT from the vehicle 10A is acceptable to them when receiving the MCM message from the vehicle 10A. Thereafter, they will notify the vehicle 10A whether they will accept the desired trajectory DT or they will reject the desired trajectory DT. Therefore, with the transmission of the MCM message with the request for the cooperative driving maneuver from the vehicle 10A, the negotiation phase begins, which ends with the acceptance of the desired trajectory DT or the rejection of the desired trajectory DT.
[0066] According to an embodiment of the invention, there is a process for estimating a timeout value for the negotiation phase of a cooperative maneuver, which limits the negotiation phase to a certain amount. The estimation of the timeout value is preferably performed in the ADC unit 180 of the vehicle 10A. Figure 6 How the timeout estimation will be performed is illustrated in the flowchart of . The process starts in step NTE1. In step NTE2, the algorithm determines the number of vehicles involved in the requested cooperative driving maneuver. This can be performed by checking the positions of the surrounding vehicles and their corresponding speeds. It is noted that the positions, speeds and planned trajectories are exchanged between neighboring vehicles in the common awareness message CAM. By checking the positions and speeds of the surrounding vehicles, it will be found that Figure 2 Vehicles 10B and 10C are involved in the cooperative driving maneuver illustrated in FIG. In step NTE3, vehicle 10A determines a branch point BP between the planned trajectory PT and the desired trajectory DT. The branch point is a position on the two trajectories at which the desired trajectory DT begins to diverge from the planned trajectory. When this branch point BP is determined, the time point when vehicle 10A reaches the branch point BP is also determined in step NTE3.
[0067] In the next step NTE4, the time required for the negotiation of the cooperative driving maneuver is also estimated. In one embodiment, the negotiation time can be estimated in the following manner: First, in step NTE2, the typical internal processing time for deciding to accept or reject the desired trajectory DT is taken out from the memory. Since the vehicles 10B and 10C receive the MCM message in broadcast form almost at the same time, they perform the check for accepting or rejecting the desired trajectory in parallel, so that if two vehicles are involved, the time will not be doubled. However, it is also necessary to consider that each vehicle involved needs to transmit its reply to the request MCM message back. Since different resource blocks are assigned to different vehicles, this can be done in parallel, and therefore in this embodiment, the known one-way travel time for sending a reply does not need to be multiplied by the number of vehicles involved. However, the waiting time of the network depends on the current transmission conditions at the location of the corresponding vehicle. Taking this into account, the vehicle 10A estimates the waiting time of the network based on the current quality of service that the network can provide.
[0068] A typical example of the time used to decide whether to accept or reject the desired trajectory is 500 milliseconds. It should be noted that since the two vehicles 10B and 10C involved receive the MCM message at the same time, they will start to decide in parallel whether to accept or reject the desired trajectory. A typical example of a one-way travel time on the WLAN p link is about 100 milliseconds. Additionally, for vehicle 10A, the vehicle internal network processing latency is to be considered. Since the internal message transmission in vehicle 10A takes longer due to the need for reformatting in the gateway 142, this latency should not be ignored. A typical value for two-way transmission of internal messages is about 200 milliseconds. In total, the negotiation time NT will be calculated by summing these values.
[0069] NT = 500 milliseconds + 2*100 milliseconds + 200 milliseconds = 900 milliseconds.
[0070] In the following step NTE5, it is checked whether the estimated negotiation time NT is shorter than the branch point time determined in step NTE4. If so, the vehicle 10A transmits an MCM message. If not, this means that there is not enough negotiation time NT available to make a decision about the cooperative driving maneuver, and the vehicle 10A does not issue a request MCM message. Figure 2 In the driving situation illustrated in FIG. 1 , this means that vehicle 10A starts braking and waits behind vehicle 10B until the traffic situation allows a change to the second lane. If so, in step NTE6, the timeout value TO is set equal to the calculated negotiation time NT. Then, in step NTE7, an MCM message with the set timeout value TO is issued.
[0071] Once the MCM message has been sent, the two vehicles 10B and 10C need to decide whether to accept or reject the cooperative driving maneuver. Therefore, they will consider the timeout value TO in the field M5 of the maneuver coordination message MCM. The timeout value has the following meaning: that is, the time until the vehicle 10A that makes the request needs to receive a reply. The vehicles 10B and 10C also perform the following steps: check whether they can deliver the reply to the MCM message within the set time limit defined by the timeout value. What they know is that they need 500 milliseconds to make a decision about the request. They also know about the one-way travel time of 100 milliseconds and the internal message distribution time of 100 milliseconds in the vehicle 10A. In this way, they will find that a total of 500 milliseconds + 100 milliseconds + 100 milliseconds are needed, and the resulting value of 700 milliseconds is compared with the announced timeout value. If they find that there is enough time to reply to the request, they will transmit the acceptance message back to the vehicle 10A that makes the request. If they find that there is not enough time to reply to the request, they will transmit the rejection message back to the vehicle 10A that makes the request. In this way, redundant V2V communications can be avoided.
[0072] Figure 7 The different message exchanges for a cooperative driving maneuver are shown on the left. In phase 1, vehicles 10A, 10B and 10C exchange common awareness messages CAM. This also includes exchanging their currently planned trajectories PT. In phase 2, vehicle 10A detects that there is a need for a cooperative driving maneuver and sends an MCM message in broadcast form to vehicles 10B and 10C. In phase 3, vehicles 10B and 10C send their response messages to the MCM message back to vehicle 10A. In phase 4, when the two vehicles 10B and 10C have accepted the cooperative driving maneuver, the cooperative driving maneuver begins with the aid of a broadcast message from vehicle 10A.
[0073] exist Figure 7 , different timelines of the cooperative driving maneuver are illustrated. The duration of the desired trajectory and the planned trajectory is 10 seconds. The negotiation time has been calculated to be equal to 900 milliseconds. The branch point time has been calculated to be equal to 4 seconds. Finally, the timeout value TO has been set to be equal to 4 seconds.
[0074] It is to be understood that the proposed method and apparatus can be implemented in various forms of hardware, software, firmware, special processors or combinations thereof. The special processor may include an application specific integrated circuit (ASIC), a reduced instruction set computer (RISC) and / or a field programmable gate array (FPGA). Preferably, the proposed method and apparatus are implemented as a combination of hardware and software. In addition, the software is preferably implemented as an application program tangibly embodied on a program storage device. The application program can be uploaded to and executed by a machine including any suitable architecture. Preferably, the machine is implemented on a computer platform having hardware such as one or more central processing units (CPUs), random access memories (RAMs) and (one or more) input / output (I / O) interfaces. The computer platform also includes an operating system and microinstruction codes. The various processes and functions described herein may be a part of a microinstruction code or a part of an application program (or a combination thereof) executed via an operating system. In addition, various other peripheral devices may be connected to the computer platform, such as additional data storage devices and printing devices.
[0075] It should be understood that the elements shown in the figure can be realized with various forms of hardware, software or their combination. Preferably, these elements are realized with a combination of hardware and software on one or more general-purpose devices through appropriate programming, and the general-purpose device may include a processor, a memory and an input / output interface. In this article, the phrase "coupling" is defined as meaning to be directly connected or indirectly connected through one or more intermediate components. This intermediate component may include both hardware-based components and software-based components.
[0076] It is further understood that because some of the constituent system components and method steps depicted in the drawings are preferably implemented in software, the actual connections between the system components (or process steps) may vary depending on the manner in which the proposed methods and apparatus are programmed. Given the teachings herein, one of ordinary skill in the relevant art will be able to contemplate these and similar implementations or configurations of the proposed methods and apparatus.
[0077] The present disclosure is not limited to the exemplary embodiments described herein. There are many different adaptations and developments that are also considered to fall within the scope of the present disclosure.
[0078] Reference numerals list
[0079] 10 Vehicles
[0080] 10A First Vehicle
[0081] 10B Second vehicle
[0082] 10C Third vehicle
[0083] 10D Fourth Vehicle
[0084] 20 Heads-up display
[0085] 30 Display Units
[0086] 40 computing units
[0087] 50 Operation panel
[0088] 60 Memory
[0089] 70 First data bus
[0090] 80 Second data bus
[0091] 90 Third data bus
[0092] 100 High-speed CAN bus
[0093] 102 Communication bus
[0094] 104 CAN bus
[0095] 106 Ethernet bus
[0096] 110 Instrument cluster
[0097] 120 Phone
[0098] 130 Navigation System
[0099] 140 Radio
[0100] 142 Gateway
[0101] 150 Camera
[0102] 152 LiDAR Sensor
[0103] 154 Radar Sensor
[0104] 170 Inertial Measurement Unit
[0105] 171 Sensor 1
[0106] 172 Sensor 2
[0107] 173 Sensor 3
[0108] 171 Driver assistance control unit
[0109] 172 Radar equipment
[0110] 180 Autonomous Driving Computing Unit
[0111] 181 Engine Control Unit
[0112] 182 ESC control unit
[0113] 183 Transmission Control Unit
[0114] 200 Evolved Packet Core
[0115] 210 Base Station
[0116] 300 Internet
[0117] 310 Roadside Unit
[0118] 320 Backend Server
[0119] M1 message header field
[0120] M2 First message payload field
[0121] M3 Second message payload field
[0122] M4 Third message payload field
[0123] M5 Fourth message payload field
[0124] TJ Track
[0125] PT Program Trajectory
[0126] DT Expected Trajectory
[0127] BP branch point
[0128] NTE1–NTE8 Different steps of the computer program
Claims
1. A method for planning a cooperative driving maneuver, comprising the following steps: observing the surroundings of the vehicle (10A), determining a planned trajectory (PT) on which the vehicle (10A) is to be driven for a certain amount of time, determining a desired trajectory (DT) different from the planned trajectory (PT), the desired trajectory (DT) requiring a cooperative driving maneuver with at least one of the surrounding vehicles (10B, 10C), initiating a negotiation phase with the surrounding vehicles (10B, 10C) involved in the cooperative driving maneuver by sending a maneuver coordination message (MCM), waiting for a response message from the involved surrounding vehicles (10B, 10C), It is characterized by the following steps: determining a timeout value (TO) for limiting a negotiation phase of the cooperative driving maneuver, and If the involved surrounding vehicles (10B, 10C) have accepted the desired trajectory (DT) before the timeout value (TO) has expired during the negotiation phase, then change to the desired trajectory (DT), The timeout value (TO) is input into a payload field of a maneuver coordination message (MCM) to inform the involved surrounding vehicles (10B, 10C) about the timeout value of the negotiation phase of the cooperative driving maneuver.
2. The method according to claim 1, further comprising the steps of: Determining a branch point (BP) corresponding to a point located on a planned trajectory (PT) and a desired trajectory (DT), at which the planned trajectory (PT) and the desired trajectory (DT) separate; and checking whether the vehicle (10A) will reach the branch point (BP) before the negotiation phase ends according to a determined timeout value (TO), and if so, terminating the planning of the cooperative driving maneuver and not issuing the maneuver coordination message (MCM).
3. The method according to claim 1 or 2, wherein: For the step of determining the timeout value (TO), a step of determining the number of vehicles involved in the cooperative driving maneuver is performed, and a typical one-way travel time required to send a message from one vehicle to another multiplied by the number of vehicles involved in the cooperative driving maneuver is added to the typical time for deciding to accept or reject the cooperative driving maneuver, thereby calculating a negotiation time (NT) for the cooperative driving maneuver.
4. The method according to claim 3, wherein a typical round trip time of an internal network transmission in the vehicle (10A) that has issued the maneuver coordination message (MCM) is added to the negotiation time (NT) in order to determine a total negotiation time.
5. A method according to claim 3, wherein in the vehicle (10A) that has issued the manoeuvre coordination message (MCM), the typical one-way travel time required to send a message from one vehicle to another is adapted to a current estimate of the quality of service of a vehicle-to-vehicle radio communication system.
6. The method according to claim 3, wherein, in the vehicle (10A) that has issued a cooperative driving maneuver request message, when it is found that the vehicle (10A) will reach a branch point (BP) before the end of the negotiation time (NT), the timeout value (TO) is set to the negotiation time (NT).
7. A method according to claim 1 or 2, wherein the planned trajectory (PT) and the desired trajectory (DT) are input into a payload field of a maneuver coordination message (MCM) to inform the involved surrounding vehicles (10B, 10C) about the planned cooperative driving maneuver.
8. A method according to claim 1 or 2, wherein one of the involved surrounding vehicles (10B, 10C) performs the following steps: checking the timeout value (TO) in the received maneuver coordination message (MCM), and when it finds that the typical time for deciding to accept or reject the cooperative driving maneuver is longer than the timeout value (TO), the involved surrounding vehicles (10B, 10C) will stop the negotiation on the cooperative driving maneuver and transmit a message in which the cooperative driving maneuver is rejected back to the vehicle (10A).
9. A computing unit (180), characterized in that: The computing unit (180) is adapted to perform the method according to one of the preceding claims 1 to 8.
10. A vehicle, characterized in that: The vehicle is equipped with a computing unit (180) according to claim 9.
11. A computer program product, characterized in that The computer program product comprises program steps which, when processed by a computing unit (180), cause it to carry out the method according to one of claims 1 to 8.
