DE102016003432A1 - System and method for coordinating a vehicle association formation - Google Patents

Abstract

System and method for coordinating a vehicle association The method comprises the determination of possible platooning attendants of a vehicle (1) on the basis of a result of an assessment of transport task features for at least one other vehicle (2) and the determination of route data for at least a distance of the vehicle ( 1) for performing a task of the vehicle (1), wherein the route data includes data about the road and the time on the route. The method may also determine a plurality of transportation plans for the vehicle (1) based on a reconciliation of route data for at least a distance of the vehicle (1) with route data of the possible platooning attendants, wherein a transportation plan includes route data and platooning instructions for the vehicle (1). contains at least one route. The method also includes at least one platooning parameter for each transportation plan that indicates a platooning performance of the transportation plan and a selected transportation plan of a plurality of transportation plans whose at least one vehicle association parameter meets a decision criterion.

Description

Technical part

The present document relates to cooperative driving or platooning technology, and more particularly to a system and method for coordinating vehicle association formation. A further subject of the present document is a computer program and a computer program product.

background

Cooperative driving or platooning is gaining in awareness, especially for heavy vehicles. Cooperative driving means driving in a convoy with small distances between the vehicles. Studies have shown that fuel efficiency can be significantly reduced by cooperative driving in heavy vehicles due to the reduced air resistance. However, organizing vehicles in associations is a comprehensive task. On the one hand, it is about finding the most suitable vehicles for grouping, and on the other hand it is about making platooning so pleasant for the drivers that it becomes an alternative for which the drivers want to decide.

In order to find opportunities for platooning, it is necessary to find routes or at least sections for vehicles including their schedules. The routes can then be matched to find platooning opportunities and the drivers of the vehicles with positive platooning opportunities can be motivated to form vehicle associations. However, the possibilities of platooning may be affected by traffic disruption or other reasons.

US 2014 / 0046585A1 refers to a real-time calculation of vehicle service lines. A route planning system is described that can recalculate a planned route based on input obtained after the formulation and / or dispatch of the initial route. However, the time to recalculate a route may be limited and the calculations may be computationally demanding.

Summary

It is therefore an object of the document to remedy at least some of the disadvantages of the hitherto known technique. Another object of the document is to provide co-operative co-ordination that is simpler and / or faster than previously known co-operative co-ordination methods. Another object of the document is to provide co-operative co-ordination at a lower cost than previous systems and methods for co-ordinating cooperative driving. One of these objects and others are at least partially accomplished by the system and method of the independent claims and by the embodiments of the dependent claims.

According to a first aspect, the document relates to a system for coordinating a vehicle association formation. The system may determine possible platooning attendants of a vehicle based on a result of evaluation of transportation task features for at least one other vehicle, and may determine route data for at least a distance of the vehicle to fulfill a task of the vehicle, the route data being data about the road and the time included on the track. The system may also determine a plurality of transportation plans for the vehicle based on a reconciliation of route data for at least a distance of the vehicle with route information of the possible platooning attendants, wherein a transportation plan includes route data and platooning instructions for the vehicle on at least one route. The system can also determine at least one platooning parameter for each transportation plan, which displays a platooning service of the transportation plan, and determine a selected transportation plan from several transportation plans, whose at least one platooning parameter fulfills a decision criterion.

Platooning with vehicles, such as heavy vehicles, is facilitated by planning and coordination by the system, which may be an off-board system superior to vehicles. Transport tasks are entered into the system to identify potential platooning opportunities to find the most efficient and fuel efficient routes. For various reasons (traffic situation, weather, etc.) changes can occur on the planned routes, which in turn require a new transportation plan. For this purpose, a system and a procedure have been developed that allow a quick retrieval of new schedules when the original selected scheduling plan changes, so that the vehicle does not miss platooning opportunities and its fuel economy does not deteriorate. The described system and method significantly limits the amount of vehicles to match transportation tasks and calculates alternative schedules in advance. This can speed up calculations to find a new transportation plan, even if the system is monitoring thousands of vehicles, so the new one Transportation plan is not directly outdated and obsolete due to the changed status of another vehicle included in the new transportation plan.

The description includes a less complex and faster system than previous systems for vehicle body formation. Vehicles co-ordinated by an appropriate system often have at least one alternative transportation plan ready for immediate implementation, resulting in lower fuel consumption by reducing the risk of losing platooning opportunities.

In one embodiment, the system may present the selected transportation plan to the driver of the vehicle.

In one embodiment, the system may store at least one of the scheduling plans with associated scheduling parameters on a storage device that were not determined to be selected alternative schedules for the vehicle.

In one embodiment, the system may determine a newly selected transportation plan from the alternative transportation plans if the current selected transportation plan can not be met with regard to the route. In one embodiment, the system may present the alternative schedules to the driver of the vehicle.

According to one embodiment, the system may reconcile route data of the selected transportation plan with route data of the transportation plans for other vehicles of the possible platooning attendants to find new transportation plans for the other vehicles and / or to update existing transportation plans for the other vehicles.

According to one embodiment, the transport task feature is one of the following: geographical scope of the task, time for the task, main direction of the vehicle during the task, platooning information.

According to one embodiment, the platooning parameter is one of the following: estimated reliability of the transportation plan, estimated fuel economy, estimated fuel loss, estimated time loss, position condition.

In a second aspect, the document relates to a method of coordinating a vehicle association formation. The method includes determining possible platooning attendants of a vehicle based on a result of assessing transportation task features for at least one other vehicle and determining route data for at least a distance of the vehicle to perform a task of the vehicle, the route data being data about the road and the time included on the track. The method may also determine a plurality of transportation plans for the vehicle based on a reconciliation of route data for at least a distance of the vehicle with route information of the possible platooning attendants, wherein a transportation plan includes route data and platooning instructions for the vehicle on at least one route. The method also includes at least one platooning parameter for each transportation plan that indicates a platooning performance of the transportation plan and a selected transportation plan of a plurality of transportation plans whose at least one vehicle association parameter meets a decision criterion.

In one embodiment, the method includes presenting the selected transportation plan to the driver of the vehicle.

In one embodiment, the method includes storing at least one of the schedules with associated platooning parameters that were not determined as selected alternative schedules for the vehicle.

According to one embodiment, the method comprises determining a newly selected transportation plan from the alternative transportation plans if the current selected transportation plan can not be met with regard to the route.

In one embodiment, the method includes presenting alternative schedules for the driver of the vehicle.

According to one embodiment, the method comprises reconciling route data of the selected transportation plan with route data of the transportation plans for other vehicles of the possible platooning companion to find new transportation plans for the other vehicles and / or to update existing transportation plans for the other vehicles.

In a third aspect, the description relates to a computer program P that includes computer program code that causes a system or a computer connected to the system to perform the method steps of the present patent specification.

According to a fourth aspect, the description relates to a computer program product containing a computer program code which is stored on a computer-readable medium to perform the method steps according to the present description, when this computer program code is executed by a system or by a computer connected to the system.

Drawing Summary

1 shows a system for coordinating a vehicle federation formation according to an embodiment of the description and a road network with a plurality of vehicles.

2 FIG. 12 shows a flow chart of a method of coordinating the vehicle association information according to an embodiment of the description.

3 shows an example of the coordination of the vehicle association formation.

Detailed description

1 shows part of a road network 4 with several interconnected roads. Several vehicles 1 . 2 drive on the street. The vehicles 1 . 2 may include heavy vehicles such as trucks, city buses and coaches as well as lighter vehicles such as passenger cars. The description is mainly focused on heavy vehicles, but can also be applied to lighter vehicles.

To plan and coordinate a platooning of several vehicles became a system 3 to coordinate a platooning formation. The system 3 can be the most efficient routes of the road network 4 calculate with high platooning volume. According to the in 1 In the embodiment shown, the system comprises 3 a device 5 with a data processing unit 6 and a storage unit 7 , The data processing unit 6 can consist of one or more central processing units (CPU). The storage unit 7 can consist of one or more storage units. A memory unit may include volatile and / or nonvolatile memory, such as flash memory or random access memory (RAM). The storage unit 7 also includes a computer program P with computer program code or instructions that causes / causes the device 5 or one to the device 5 connected computer performs the method steps described below. The system 3 can be a parent off-board data system 3 be. The device 5 can be part of a remote computer, a roadside unit 8th or even a vehicle 1 . 2 be. When the device 5 in a vehicle 1 . 2 is included, it can be part of an ESG (electronic control unit) of the vehicle 1 . 2 be. The device 5 can also be distributed to different units, so that parts of the computer program P are executed on several CPUs in the different units.

The vehicles 1 . 2 the roadside unit 8th and the device 5 can communicate in a wireless manner, which is represented in the figure as curved arrows. A vehicle 1 . 2 is equipped with a wireless communication unit (not shown) for the purpose of wireless communication. The roadside unit 8th and the device 5 each may be equipped with a wireless communication unit for the purpose of wireless communication (not shown). A wireless communication unit may be, for example, a transceiver.

The vehicles 1 . 2 can communicate directly with each other. One type of corresponding wireless communication is referred to as vehicle-to-vehicle communication (V2V). The vehicles 1 . 2 and the device 5 can work directly with each other or through an external computer 8th , Server, roadside unit or the like. One type of corresponding wireless communication is referred to as Vehicle Infrastructure Communication (V2I). The wireless communication may also be performed via mobile communication servers, via an application in a communication unit or via a server.

Data about different vehicles 1 . 2 , z. Their position, transport task features such as route, destination, etc. may be communicated via wireless communication. Corresponding data are usually identified with identification data of the vehicle to which the data refer. One type of identification data may be the number or license plate of the vehicle 1 . 2 be.

The position of each vehicle 1 . 2 can with a tracking unit (not shown) in the vehicle 1 . 2 be determined. The locating unit can determine the position of the vehicle 1 . 2 and can receive signals from a global positioning system, such as a GNSS (Global Navigation Satellite System), e.g. As a GPS (Global Positioning System), GLONASS, Galileo or Compass received. Alternatively, the locating unit may receive signals, for example from one or more distance detectors in the vehicle 1 . 2 , which can measure relative distances to, for example, a roadside unit, nearby vehicles or the like having a known position. Based on the relative distance or distances, the Tracking unit the position of your own vehicle 1 . 2 determine. A detector may also detect a signature, for example in a roadside unit, the signature representing a particular position. The locating unit can then determine its own position on the determination of the signature. Alternatively, the location unit may determine the signal strength of one or more signals from a base station or roadside unit of known position, thereby determining the position of the vehicle 1 . 2 determine by triangulation. Of course, some of the above technologies can be combined to ensure a correct positioning of the vehicle 1 . 2 to ensure. The locating unit may provide a position signal with the position of the vehicle 1 . 2 produce. The position signal can be another vehicle 1 . 2 , a roadside unit 8th or the device 5 be communicated wirelessly.

The device 5 can provide information about transport task characteristics for the vehicles 1 . 2 have, z. B. can be retrieved by the forwarding contractors. Otherwise, the vehicles can 1 . 2 even their respective transport task features via wireless communication of the device 5 to transfer. The transport task features may include: geographic range of the task, time for the task, main direction of the vehicle during the task, platooning information.

The system 3 is suitable for coordinating a vehicle association formation. As described above, the system includes 3 a data processing unit 6 and a storage unit 7 , The storage unit 7 includes a computer program code to a device 5 or one with the device 5 to cause the connected computer to perform any of the method steps for coordinating a vehicle association formation, which will be described below with reference to the flowchart in FIG 2 to be discribed. The method can thus be combined with the hardware and software of the system described above 3 be implemented.

The method comprises the determination of possible platooning attendants of a vehicle 1 based on a result of a judgment of transportation task features for at least one other vehicle 2 (A1). This step may typically occur when registering a new transportation task for a vehicle 1 respectively. He aims to use other vehicles 2 to discard, obviously to platooning with the vehicle 1 are not suitable. At this time, the vehicle has 1 the transport task has not started yet. The transport task features may include: geographic range of the task, time for the task, main direction of the vehicle 2 during the task, platooning information, etc. The geographical scope of the task may include, for example, a country or region of a country. The time for the task may include the date of the task and / or the time of day of the task. The main direction of the other vehicle 2 during the task, any direction, z. B. north, south, west or east. The compass can be divided into quarters, so that the north includes degrees from 31 ° to 45 °, the east from 45 ° to 135 °, the south from 135 ° to 225 ° and the west from 225 ° to 315 °. The platooning information may contain the information that the other vehicle 2 already part of a planned vehicle association and the vehicle association is full. The other vehicle 2 can then immediately as a vehicle companion companion of the vehicle 1 being rejected.

The method also includes determining route data for at least a distance of the vehicle 1 to fulfill a task of the vehicle 1 wherein the route data includes road and time data on the route (A2). One or more optimal routes for the vehicle 1 are determined on the basis of transport task features that already exist, such as the start position, the destination, the time for delivery, and map data. This can be in the vehicle 1 Detected itself and the device 5 transmitted or through the device 5 be determined. The optimal route, for example the shortest and / or fastest, should be aligned with already established routes from other schedules to other vehicles 2 belong. If more possible routes for the vehicle 1 should be stored, these routes should be saved to avoid the recalculation of the routes if a new reconciliation process is needed in the future when schedules are changed due to adverse effects.

Once this information has been determined, more transport task characteristics for the vehicle can be found 1 extracted and / or formed from the route data and with the transport task features of the other vehicle 2 be compared. In addition, other transport task characteristics may be known before the optimal route / n has been determined.

For example, other vehicles 2 with a geographical coverage of the task, which is outside the scope of the geographical coverage of the task of the vehicle 1 is to be discarded. For example, tasks in different countries or different regions of a country can be fulfilled. It also allows transportation tasks of the other vehicle 2 . the time outside the timeframe for the transport task of the vehicle 1 plus minus an appropriate margin for possible changes in the transportation plan are discarded. Also transport tasks of another vehicle 2 that has chosen a main direction or direction during the route that is not plus or minus an appropriate margin with the main direction or the direction of the vehicle 1 in its transport task, can be discarded.

Also other vehicles 2 with transport tasks with platooning information, for example where ready-made schedules with platooning are present and where the parameters for the planned vehicle associations show that platooning with the vehicle 1 is not suitable, can be discarded. For example, if a planned vehicle association already has a maximum amount of approved vehicles or if the engine power of the vehicle 1 is not sufficient to achieve effective control of the platooning.

For transport tasks of other vehicles 2 , which were discarded as described above, no track alignment must be done. Remaining transport tasks of the other vehicles 2 which have not been discarded and which should be less of the original size should be fully analyzed, which may require matching all their links. The remaining other vehicles 2 with transport tasks that have not been discarded are suggested as possible platooning companions.

The method includes determining multiple schedules for the vehicle 1 based on the reconciliation of route data for the at least one route of the vehicle 1 with route data of the possible platooning companions (A3). A transportation plan for the vehicle 1 contains route data and platooning instructions for the vehicle 1 on at least one route. Here will / will be the optimal route / s for the vehicle 1 aligned with already established routes of other schedules that to possible platooning attendants, therefore to the other vehicles 2 belong that were not discarded. Many different routes can be found on which the vehicle 1 with other vehicles 2 in the bandage or not.

The method also includes at least one platooning parameter for each transportation plan that indicates a platooning performance of the transportation plan (A4). The platooning parameters may include estimated reliability of the transportation plan, estimated fuel economy, estimated fuel loss, estimated time loss, position condition, etc.

An estimate of the reliability of the transportation plan may be based on previous experiences of the other vehicle 2 Platooning or the time or length of the route to the formation of the vehicle association, etc. take place. If earlier experiences of the other vehicle 2 With platooning, for example, poor drivability, etc., the estimated reliability of the scheduling can be low. If the time or distance before the formation of the vehicle association is long, the estimated reliability of the transportation plan may be low, since there is a higher risk that the transportation plan will be affected. "Lang" can mean more than half the time or distance here. The reliability of the transport plan can be calculated by a data-driven mathematical model that can be obtained through machine learning. Data for creating the model can be found during the operation of the system 3 to be collected.

An estimated fuel saving can be the estimated fuel savings that the vehicle has 1 will reach if the vehicle 1 according to transportation plan drives, compared to that the vehicle 1 according to its fuel-saving route and / or optimal route without platooning drives. The estimated fuel economy may be read on a given table or estimated by using an equation for fuel economy based on the position in the vehicle body, the time span or distance of maintaining the vehicle body versus the total time or distance of the task, the speed of the vehicles in the dressing, and so on become.

An estimated fuel loss may be the possible fuel loss of the vehicle 1 be if the plan fails after the vehicle 1 has begun to drive according to this schedule and some or all of the platooning options on the route are no longer alternatives

An estimated loss of time can be the loss of time of the vehicle 1 be when the vehicle 1 according to transportation plan drives, compared to that the vehicle 1 according to its optimal route without platooning drives.

A position condition can be a condition that the transportation plan is possible if the vehicle 2 already passed a position designated by the position condition. The system 3 can therefore ignore schedules and remove schedules that are no longer eligible (for example, stopped or no longer possible, for example because the intended platooning attendant has already passed the designated meeting place).

The method also includes determining a selected transportation plan from a plurality of transportation plans, the at least one platooning parameter of which fulfills a decision criterion. The decision criterion can be the most reliable transportation plan, the most fuel-efficient transportation plan, the most time-efficient transportation plan, or the vehicle 1 or the other vehicle 2 have not yet passed the position designated by the position condition.

The selected transportation plan may be for the driver of the vehicle 1 to get presented. The system 3 Consequently, data of the selected transportation plan can be sent to the vehicle 1 transmit via wireless communication. The selected transportation plan may be presented to the driver via a suitable Human Machine Interface (HMI) that allows the driver to interact with the interface. For example, the selected transport plan may be displayed via a display (not shown) or a speaker (not shown). The driver can use a touchscreen, a keyboard, a switch, a microphone or other interface of the system 3 to interact. The driver can accept the illustrated transportation plan through interaction with the HMI, with the vehicle 1 can be driven automatically according to the selected transport plan. Alternatively, the driver may drive the vehicle 1 drive manually according to the transportation plan. As a further alternative, the selected transportation plan is not presented to the driver, but the selected transportation plan becomes the vehicle 1 transmitted and the vehicle 1 will start to drive automatically according to the selected route. According to another alternative, the selected transportation plan is presented to the driver, but the driver does not have to accept the selected transportation plan: the vehicle 1 will still start to drive according to the selected transportation plan.

The at least one of the schedules with associated platooning parameters that was not determined to be the selected one may serve as an alternative scheduling plan for the vehicle 1 be saved for later retrieval. The alternative transport routes may be in the storage unit 7 the device 5 or in another storage unit of the system 3 get saved. The alternative transport plans with the different possible routes for the vehicle 1 Above all, they can be classified according to their fuel economy and their safety. The alternative transport plans may be in the storage unit 7 stored in a specific data structure.

Transport plans for any new task of the system 3 can be worked out as the new task to the system 3 will be added. The data structure may include vehicle identifications and the associated elaborated schedules and flagging platooning parameters.

The system 3 now monitors how the vehicle 1 met the selected transportation plan. The vehicle 1 can continuously adjust its position and / or speed to the system 3 submit, so the system 3 can determine if the vehicle 1 with regard to the route, can comply with the selected transport plan. This can be plus or minus a suitable margin for the position and / or speed of the vehicle 1 be determined. Impairments, such as accidents, road works, difficult weather conditions, night or day trips, traffic jams, etc. can affect the vehicle's ability 1 affect the route of the selected transport plan. All other vehicles belonging to the system 3 are known and follow a selected transportation plan, are also monitored and share the system 3 their position or speed with. That way the system can 3 Monitor or verify the fulfillment of all selected transportation plans of all vehicles.

When it is determined that the currently selected transportation plan of the vehicle 1 can not be met in terms of the route, a newly selected transport plan can be determined from the alternative schedules. The alternative plan or plans may / may be derived from the data structure in the storage unit 7 of the system 3 be compiled. The optimal alternative transportation plan can be determined as a newly selected transportation plan according to how well the platooning parameters meet the decision criterion. This determination may be based on a machine learning computer model and may include driver / driver preferences in the calculation, which is also referred to as a recommender system. Data for creating the model is collected during system operation. This newly selected transportation plan can be used by the driver of the vehicle 1 which, as explained above, can accept the newly selected transportation plan. Alternatively, several alternative schedules and their scheduling parameters become the driver of the vehicle 1 and the driver can choose between different schedules according to his / her platooning parameters, etc. The selected alternative transportation plan then becomes the newly selected transportation plan. The vehicle 1 can then be automatically controlled according to the newly selected transportation plan or the driver can drive the vehicle 1 Manually control according to the newly selected transport plan, as explained above. At a autonomous vehicle can be the system 3 automatically select the best transportation plan for autonomous vehicles.

Since alternative schedules have already been created, the system can 3 quickly change the transportation plan while the vehicles continue to drive.

The new transportation plan may also include transportation plans for other vehicles 2 affect. If a newly selected transportation plan has been selected, the procedure can compare the route data of the selected transportation plan with the route data of the transportation plans for other vehicles 2 The possible platooning companions include to new transportation plans for the other vehicles 2 to find and / or existing transportation plans for the other vehicles 2 to update. The other vehicles 2 Here you can find other vehicles within a certain area of the vehicle 1 or selected other vehicles 2 be according to other criteria. This process should not require so many calculations because each time only two known routes should be matched.

Consequently, due to the new vehicle 1 new alternative transportation plans or updated alternative transportation plans for other vehicles 2 result. If any of the new or updated alternative transportation plans for the other vehicle 2 is determined to be more appropriate or efficient than the current selected transportation plan, the more appropriate or efficient transportation plan may be selected as a newly selected transportation plan for the other vehicle. If an alternative transportation plan of the vehicle 1 it has been determined to be more efficient than the current schedule, it can be displayed directly to the driver.

Alternative schedules are therefore preliminary and can be updated continuously. You can make changes to selected transportation plans for other vehicles 2 to be affected.

The most fuel efficient route without platooning can always be stored as a transportation plan. This schedule is always accessible as a last resort if all other alternative plans are not efficient enough or too risky.

The driver or the system 3 In an autonomous vehicle, depending on several factors, you can still choose to follow the old plan, or choose to follow the best alternative route. If an alternative plan is chosen, the system becomes 3 first remove his old current plan and against this background all alternative plans for other vehicles 2 who had a connection to the old plan, update and look for new alternative plans that are now available for other vehicles 2 have become possible in the vicinity. This process uses the stored optimal routes that were calculated when registering the new transport task, which speeds up the calculations. It may happen that other vehicles 2 Retrieve alternative plans that are better than the current plan, and these can be presented to the driver. It may also happen that the best alternative plan is not to join a vehicle with a vehicle, but instead drive the shortest route alone.

The system 3 can clean up the data structure by rejecting transportation plans that are no longer in question. This can be achieved in conjunction with the assessment of alternative plans or through the so-called automatic garbage collection.

Selected schedules can be updated if they have not been started, and before their start time. The started, selected transportation plans can be more static and less frequently updated.

It is referring to 3 an example of a coordination of a vehicle federation formation according to the description shown. The example will now be referenced 3 explained. In this example, there are three vehicles, Vehicle I, Vehicle II, and Vehicle III.

Vehicle I is given the task of driving from point A to point B. This task is the system 3 known. The method described is initiated, but routes of other vehicles can not be stretched 2 that can be matched with each other, can be found. A transportation plan with ID = 1 is executed by the system 3 created, which includes the departure of the direct route between points A and B without platooning. The optimal routes (for example, the route AEIFB) are stored in the memory unit 7 stored for a future, possible comparison.

Vehicle II is given the task of driving from point C to point D. This task is the system 3 known. The procedure is initiated and the route of the vehicle II is through the system 3 is matched with the distance of the vehicle I and a transportation plan with ID = 2 is prepared, which involves hitting the vehicle I at the point E and with this to the point F, where they are separated to form a bandage. The selected schedules are communicated wirelessly to vehicles I and II and vehicles I and II begin each with the execution of their selected transportation plans.

Vehicle III is given the task of driving from point G to point B. This task is the system 3 known. The procedure is through the system 3 but no good matches are found among the routes for the current schedules. A transportation plan with ID = 3 is created for the vehicle III, which includes the departure of the direct route between points G and B, route GIFB. If the transportation plan has been selected, an alternative transportation plan with ID = 4 is created for the vehicle I, which includes the departure of the route through the points AEIFB. This route is not recalculated since it was previously stored when the procedure for the vehicle I was performed. The alternative plan with ID = 4 receives the following platooning parameters: Reliability = 85, Fuel Saving: 30 l, Fuel Loss: 10 l, Condition: Point E has not yet passed and there is still enough time to reach Vehicle III at Point I hold true. The transportation plan remains an alternative for vehicle I, as it has a lower fuel economy than the transportation plan with ID = 1. Otherwise it could be presented directly to the driver of vehicle I.

Vehicle III begins performing its selected transportation plan as communicated by wireless communication.

Vehicle I ends up in a traffic jam when it is at point H. The status becomes the system 3 This message states that it is impossible to fulfill the transportation plan with ID = 1. At the same time, vehicle I approaches point E. Thanks to this, the alternative transportation plan with ID = 4 is already established and has a position condition that can be met. This is the / the driver of the vehicle I through the system 3 presented directly. The driver of the vehicle I has the opportunity to test the presented alternative transportation plan and does not have to waste a considerable amount of fuel, even if the vehicle I has been in a traffic jam and has not fulfilled his original plan.

The present invention is not limited to the above-described preferred embodiments. Numerous alternatives, modifications, and equivalents may be used. Thus, the above embodiments should not be taken as limiting the scope of the invention, which is defined by the appended claims.

QUOTES INCLUDE IN THE DESCRIPTION

This list of the documents listed by the applicant has been generated automatically and is included solely for the better information of the reader. The list is not part of the German patent or utility model application. The DPMA assumes no liability for any errors or omissions.

Cited patent literature

• US 2014/0046585 A1 [0004]

Claims (18)

System ( 3 ) for coordinating a vehicle federation formation, characterized in that the system ( 3 ) is configured to - possible platooning companion of a vehicle ( 1 ) based on a result of a judgment of transportation task features for at least one other vehicle ( 2 ) to investigate; - route data for at least one section of the vehicle ( 1 ) to fulfill a task of the vehicle ( 1 ), the route data including road and time data on the route; - several transportation plans for the vehicle ( 1 ) based on a reconciliation of route data for at least a distance of the vehicle ( 1 ) with route data of the said possible platooning companions, wherein a transport plan contains route data and platooning instructions for the vehicle on at least one route; - determine at least one platooning parameter for each transportation plan that indicates a platooning performance of the transportation plan; - To determine a selected transportation plan from several transportation plans, whose at least one platooning parameter fulfills a decision criterion. System ( 3 ) according to claim 1, that the selected transport plan to the driver of the vehicle ( 1 ). System ( 3 ) according to claim 1 or 2, comprising at least one of the transport plans with associated platooning parameters on a storage unit ( 7 ), which are not selected alternative transport plans for the vehicle ( 1 ) were determined. System ( 3 ) according to claim 3, which can determine a newly selected transportation plan from the alternative transportation plans, if the current selected transportation plan can not be met with regard to the route. System ( 3 ) according to claim 3 or 4, which the alternative transport plan to the / the driver of the vehicle ( 1 ). System ( 3 ) according to one of the preceding claims, the route data of the selected transportation plan with route data of the transportation plans for other vehicles ( 2 ) can match the possible platooning attendants to new schedules for the other vehicles ( 2 ) and / or existing schedules for the other vehicles ( 2 ) to update. System ( 3 ) according to one of the preceding claims, wherein the transport task features may include: geographical scope of the task, time for the task, main direction of the vehicle ( 1 ) while posting, platooning information. System ( 3 ) according to one of the preceding claims, wherein the platooning parameters may include: estimated reliability of the transportation plan, estimated fuel economy, estimated fuel loss, estimated time loss, position condition. Procedure for coordinating a vehicle association, with - Identification of possible platooning attendants of a vehicle ( 1 ) based on a result of a judgment of transportation task features for at least one other vehicle ( 2 ); Determination of route data for at least a distance of the vehicle ( 1 ) to fulfill a task of the vehicle ( 1 ), the route data including road and time data on the route; - Determination of several transportation plans for the vehicle ( 1 ) based on a comparison of route data for at least a distance of the vehicle ( 1 ) with route data of said possible platooning companion, wherein a transportation plan includes route data and platooning instructions for the vehicle on at least one route; - determining at least one platooning parameter for each transportation plan that indicates a platooning performance of the transportation plan; - Determination of a selected transportation plan from several transportation plans, whose at least one platooning parameter fulfills a decision criterion. Method according to claim 9, which comprises the presentation of the selected transport plan for the driver of the vehicle ( 1 ). A method as claimed in claim 9 or 10, including storing at least one of the schedules with associated platooning parameters that are not selected as selected alternative schedules for the vehicle ( 1 ) were determined. The method of claim 11, comprising determining a newly selected transportation plan from the alternative transportation plans if the current selected transportation plan can not be met with regard to the route. Method according to claims 11 or 12, which is the presentation of the alternative schedules for the driver of the vehicle ( 1 ). Method according to one of Claims 9 to 13, comprising the comparison of route data of the selected transportation plan with route data of the transportation plans for other vehicles ( 2 ) of the possible Platooning companion includes to find new transportation plans for the other vehicles ( 2 ) and / or existing schedules for the other vehicles ( 2 ) to update. Method according to one of claims 9 to 14, wherein the transport task features may include: geographical scope of the task, time for the task, main direction of the vehicle ( 1 ) while posting, platooning information. The method of any one of claims 9 to 15, wherein the platooning parameters may include: estimated reliability of the transportation plan, estimated fuel scheduling, estimated fuel loss, estimated time loss, position condition. Computer program P containing a computer program code which causes a system ( 3 ) or to the said system ( 3 ) connected computer performs the method steps according to one of claims 9 to 16. A computer program product comprising computer program code stored on a computer readable medium for performing the method of any one of claims 9 to 16 when said computer program code is stored by a system ( 3 ) or from one to the said system ( 3 ) computer is running.

Images