WO2012130397A2 - Method and apparatus for carrying out travel route planning for a vehicle - Google Patents

Method and apparatus for carrying out travel route planning for a vehicle Download PDF

Info

Publication number
WO2012130397A2
WO2012130397A2 PCT/EP2012/001180 EP2012001180W WO2012130397A2 WO 2012130397 A2 WO2012130397 A2 WO 2012130397A2 EP 2012001180 W EP2012001180 W EP 2012001180W WO 2012130397 A2 WO2012130397 A2 WO 2012130397A2
Authority
WO
WIPO (PCT)
Prior art keywords
vehicle
energy
route
destination
sequence
Prior art date
Application number
PCT/EP2012/001180
Other languages
German (de)
French (fr)
Other versions
WO2012130397A3 (en
Inventor
Nicklas HOCH
Bernd Werther
Peter Anders
Original Assignee
Volkswagen Aktiengesellschaft
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority to DE10201101577.8 priority Critical
Priority to DE102011015777A priority patent/DE102011015777A1/en
Application filed by Volkswagen Aktiengesellschaft filed Critical Volkswagen Aktiengesellschaft
Priority claimed from CN201280025607.4A external-priority patent/CN103608643B/en
Publication of WO2012130397A2 publication Critical patent/WO2012130397A2/en
Publication of WO2012130397A3 publication Critical patent/WO2012130397A3/en

Links

Classifications

    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in preceding groups G01C1/00-G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in preceding groups G01C1/00-G01C19/00 specially adapted for navigation in a road network
    • G01C21/34Route searching; Route guidance
    • G01C21/3453Special cost functions, i.e. other than distance or default speed limit of road segments
    • G01C21/3469Fuel consumption; Energy use; Emission aspects
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in preceding groups G01C1/00-G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in preceding groups G01C1/00-G01C19/00 specially adapted for navigation in a road network
    • G01C21/34Route searching; Route guidance
    • G01C21/3407Route searching; Route guidance specially adapted for specific applications
    • G01C21/343Calculating itineraries, i.e. routes leading from a starting point to a series of categorical destinations using a global route restraint, round trips, touristic trips
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in preceding groups G01C1/00-G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in preceding groups G01C1/00-G01C19/00 specially adapted for navigation in a road network
    • G01C21/34Route searching; Route guidance
    • G01C21/36Input/output arrangements for on-board computers
    • G01C21/3667Display of a road map
    • G01C21/3676Overview of the route on the road map
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in preceding groups G01C1/00-G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in preceding groups G01C1/00-G01C19/00 specially adapted for navigation in a road network
    • G01C21/34Route searching; Route guidance
    • G01C21/36Input/output arrangements for on-board computers
    • G01C21/3679Retrieval, searching and output of POI information, e.g. hotels, restaurants, shops, filling stations, parking facilities
    • G01C21/3682Retrieval, searching and output of POI information, e.g. hotels, restaurants, shops, filling stations, parking facilities output of POI information on a road map
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in preceding groups G01C1/00-G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in preceding groups G01C1/00-G01C19/00 specially adapted for navigation in a road network
    • G01C21/34Route searching; Route guidance
    • G01C21/36Input/output arrangements for on-board computers
    • G01C21/3697Input/output arrangements for on-board computers output of additional, non-guidance related information, e.g. low fuel level, fuel efficient driving, gear change, speeding, dangerous curve ahead, slippery road, school zone, speed traps, driving behaviour feedback, advertising, virtual billboards or road signs
    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • G08G1/09Arrangements for giving variable traffic instructions
    • G08G1/0962Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
    • G08G1/0968Systems involving transmission of navigation instructions to the vehicle
    • G08G1/096805Systems involving transmission of navigation instructions to the vehicle where the transmitted instructions are used to compute a route
    • G08G1/096811Systems involving transmission of navigation instructions to the vehicle where the transmitted instructions are used to compute a route where the route is computed offboard
    • G08G1/096822Systems involving transmission of navigation instructions to the vehicle where the transmitted instructions are used to compute a route where the route is computed offboard where the segments of the route are transmitted to the vehicle at different locations and times
    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • G08G1/09Arrangements for giving variable traffic instructions
    • G08G1/0962Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
    • G08G1/0968Systems involving transmission of navigation instructions to the vehicle
    • G08G1/096833Systems involving transmission of navigation instructions to the vehicle where different aspects are considered when computing the route
    • G08G1/096844Systems involving transmission of navigation instructions to the vehicle where different aspects are considered when computing the route where the complete route is dynamically recomputed based on new data
    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • G08G1/09Arrangements for giving variable traffic instructions
    • G08G1/0962Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
    • G08G1/0968Systems involving transmission of navigation instructions to the vehicle
    • G08G1/096855Systems involving transmission of navigation instructions to the vehicle where the output is provided in a suitable form to the driver
    • G08G1/096866Systems involving transmission of navigation instructions to the vehicle where the output is provided in a suitable form to the driver where the complete route is shown to the driver

Abstract

The present invention relates to a method for carrying out travel route planning for a vehicle (1) which comprises an energy store (2) for storing the energy to drive the vehicle (1), in which method a) the destination sequence for the travel route to be planned is transmitted to a computing unit (7) which is coupled to a data memory (6) in which data relating to a route network for the vehicle (1) is stored, b) the computing unit (7) calculates a route sequence which connects the destinations of the destination sequence, characterized in that c) a forecast residual quantity of energy in the energy store (2) for traveling the route sequence is calculated, d) at least for the geographic position of the vehicle (1) at a specific destination from the destinations of the destination sequence, on the basis of the forecast residual quantity of energy in the energy store (2) of the vehicle (1) and on the basis of the stored route network and a forecast energy consumption when travelling through the route network, the points in the route network which can still be reached from a specific destination with the forecast residual quantity of energy at said specific destination are determined, and e) for at least the one destination of the destination sequence, a graphical map display is produced in which the geographic position of said destination and the points in the route network which can still be reached from said destination with the forecast residual quantity of energy of the vehicle (1) at said destination are visualized. Furthermore, the invention relates to a corresponding apparatus for carrying out said method.

Description

 description

Method and apparatus for carrying out itinerary planning for a vehicle

The present invention relates to a method and apparatus for carrying out itinerary planning for a vehicle. The vehicle comprises an energy store for storing the energy for driving the vehicle, in particular a rechargeable battery. Additionally or alternatively, a conventional drive by means of a

Fuel be provided. The vehicle is thus in particular a so-called electric vehicle or a so-called hybrid vehicle.

For the user of a vehicle, the problem often arises that he has to perform different appointments in different locations within a certain period of time. For this purpose, a travel route planning for the vehicle should be carried out. The itinerary should be planned in such a way that the user with the vehicle reaches the places where the appointments take place in good time. It should be noted that from time to time the

Energy storage must be replenished. In particular, in electric vehicles, there is a need to include the recharging of the battery as well as possible in the itinerary planning, since usually the range of an electric vehicle is much lower than the range of a conventional vehicle, which is driven by a fuel.

From DE 195 19 107 C1 is a route driving device especially for a

Electric vehicle known. The described device comprises a data input unit for inputting one or more destinations for a journey and a road network memory for

Storage of the places on the road network accessible by the vehicle and the associated location distances. Furthermore, the device comprises a computer unit for

Determining one or more possible travel routes from the vehicle location to the destination locations, including required power feed operations to one or more

Energieeinspeiseorten depending on the existing energy storage

Amount of energy, the energy supply grid and the route-specific energy consumption. Finally, the device comprises a display unit for displaying the travel routes determined by the computer unit.

CONFIRMATION COPY DE 10 2004 022 265 A1 describes a method for working out a route from a starting point to a destination point in a navigation system. In which

The method is considered in the preparation of the route, a factor that affects the energy consumption to cover the route.

DE 100 59 746 A1 discloses a method for computer-assisted travel route planning and route guidance, which takes into account dynamic changes in the traffic situation and changes in deadlines.

From EP 1 300 817 B1 a navigation data provision system is known. In this system, route data is sent, which is selected in accordance with user preference data. The route data is received by a navigation terminal and used for routing the vehicle.

In EP 1 201 849 A2 a method and a device for parking space allocation is described. In the method, a request for a parking space is made to the device for parking space allocation via a radio in a vehicle. This request contains information about the current position of the vehicle. The device determines from this the next free parking possibility and transmits this as destination information to the vehicle. Subsequently, the expected arrival time is calculated and at a predetermined Vörlaufzeit before the expected arrival time is checked whether the determined parking is still available. If the parking is free, it is possible to reserve this for the vehicle. If the parking is no longer free, the device determines a new parking facility and transmits appropriate information to the vehicle.

From DE 103 02 504 AI a method for determining the range of a

Electric vehicle known. In which. Method are vehicle, route and / or environmental information about the vehicle and a planned or a current driving route to be detected and processed by a vehicle computer. From this information, the remaining range of the electric vehicle is calculated and displayed.

From DE 10 2005 055 243 A1 a method for determining an energetically favorable route for a vehicle is known. In the method, the starting point and

Endpoint of the route entered. Furthermore, vehicle-related information, in particular loading information provided. The provided vehicle-related information is stored with stored route data in the form of vehicle-related

Information and energy consumption compared. Then, a route with minimized power consumption is selected based on the stored route data depending on the provided vehicle-related information as well as the start and end points. Finally, the data for the selected route is output.

DE 2009 053 982 A1 discloses a system for calculating a consumption-optimized route of a motor vehicle. The system has a position receiver, a

Traffic information receiver and a computing unit by means of which a route to a destination can be calculated. The arithmetic unit can be a consumption-optimized route under

Calculate the use of the vehicle-specific and / or driver-specific consumption-relevant data.

The present invention is based on the technical problem of providing a method and a device of the type mentioned above, with which as a function of

Appointment data can be carried out an optimal itinerary planning.

According to the invention, this problem is solved by a method and a device having the features of the independent claims. Advantageous embodiments and

Further developments emerge from the dependent claims.

The vehicle for which the travel route planning is to be carried out comprises an energy store for storing the energy for driving the vehicle, for example a rechargeable battery and / or a fuel tank. The invention relates

in particular on the daytime travel planning in the field of mobility with electrically powered vehicles or vehicles, for which the spatial density

 Power supply facilities is low, as z. B. is currently the case with gas-powered vehicles or vehicles with a fuel cell drive. In particular, the time required to fill up the energy storage of the vehicle is taken into account.

According to a first aspect of the invention, in the method according to the invention, a destination sequence for the travel route to be planned is transmitted to a computing unit. The

Arithmetic unit is coupled with a data store, in which data on a road network and data on geographical positions of stands, the parking lots or Include power supplies stored for the vehicle. The arithmetic unit calculates a route sequence. In this case, a predicted amount of residual energy is calculated in the energy store for driving on the crude sequence. Furthermore, locations assigned to the destinations in the vicinity of the respective destination are determined for the destinations of the destination sequence. For each destination of the destination sequence, an assigned location is determined, wherein in the determination the distance of the location from the assigned destination, the

geographical position of the next destination or the geographical positions of the

Stations of the next destination and / or the predicted amount of residual energy in the

Energy storage is considered for driving on the route sequence. The route sequence is then composed of routes between locations of successive destinations of the destination sequence. Finally, in the method, the calculated route sequence can be output or transmitted.

Under a target sequence is in the context of the invention, a sequence of geographical

Positions understood successively through the itinerary to be planned. Correspondingly, a route sequence is understood as a sequence of routes which connects destinations or sites assigned to the destinations.

In the inventive method according to the first. Aspect of the invention is thus extended in determining the stands that are assigned to a destination, the target in a target area. This destination space contains the destination as well as the assigned parking spaces. For example, the size of this target space may depend on the maximum distance that a

Stand may be removed from the target. Once the destination area has been determined, the locations are determined whose geographical positions lie within the destination area. In the selection of the stand not only the distance of the stand is taken into account by the associated target in the inventive method, but also the next target and possibly the previous destination of the route sequence and the predicted amount of residual energy in the energy storage. In the method according to the invention according to the first aspect, the travel route planning thus advantageously takes into account various possible parking spaces for the vehicle upon reaching a destination of the destination sequence

carried out. In this way, the route between the destinations of the target sequence can be optimized. Furthermore, filling of the energy store can be taken into account, since a selected stand can also comprise a power supply device. Optimized travel route planning can therefore be carried out for the given target sequence. According to one embodiment of the method according to the invention, the arithmetic unit automatically decides depending on the predicted residual energy amount in the.

Energy storage for driving on the route sequence, whether a parking space or a power supply device is selected as a stand. By selecting the parking space, it is therefore advantageously possible to ensure that the vehicle has sufficient energy reserves for driving the vehicle and, if appropriate, for internal consumers of the vehicle, at any time when driving on the route sequence. This is particularly important if the vehicle is an electric vehicle with a relatively short range.

According to one embodiment of the method according to the invention, the arithmetic unit also decides automatically depending on the energy costs to fill the energy storage of the vehicle, which stands are selected.

According to a development of the method according to the invention, appointment data, which comprise geographical positions of at least part of the destinations of the travel route to be planned and associated time data, are transmitted to the arithmetic unit. In this case, the calculation unit takes into account the predicted amount of residual energy in the energy store for driving on the route sequence, the time data for the destination, which is assigned to the stand, and the duration for increasing the energy reserves in the energy store by means of the energy supply device when determining the parking spaces.

The arithmetic unit can thus determine from the appointment data the location information about the destination sequence as well as the times at which the vehicle must reach the destinations. Furthermore, the arithmetic unit can determine from the appointment data the length of stay of the vehicle at a destination. In particular, the travel route can be planned in such a way that a stand is selected which comprises a power supply device, wherein the energy store is filled up at the destination during the vehicle's duration of stay. In order to optimize the travel route, however, it can be taken into account in the method that it is not absolutely necessary for the energy store to be maximally filled up at a power supply device. When the end of an appointment is reached, it may be necessary to top up the appointment

Energy storage are aborted before the energy storage is maximally filled.

As a result, unnecessary waiting times for the user are advantageously avoided, which are caused by the filling of the energy storage. The life of the vehicle during an appointment of the user can be optimally used to fill the energy storage without resulting in additional waiting times for the user. According to a development of the method according to the invention, the arithmetic unit for the stands also determines the distance from the associated destination or the duration that a user requires for the route from the parking space to the assigned destination. In this case, the arithmetic unit can also take into account the determined duration or the distance as well as the appointment data when determining the stands. It can also be considered in particular whether the user is walking from the stand to the destination or otherwise reaches the destination. Furthermore, a user-dependent walking speed can be taken into account. In the method, by means of the arithmetic unit in particular the route sequence is optimized with regard to the energy consumption when driving on the route sequence and / or with respect to the time for driving on the route sequence. It also ensures that the objectives of the

Target sequence can be achieved according to the appointment data, taking into account not only the time to reach the stand, which is assigned to a goal, but also the subsequent duration to reach the goal.

According to a development of the method according to the invention, the arithmetic unit further determines the availability probability of the stands. When determining the locations, the availability probability is taken into account. If it is relatively unlikely that a stand at the required time resulting from the

Route sequence results in free, another stand can be chosen. In this case, the availability probability of the stand can be set in relation to the deterioration of the route sequence by the other stand. In this way, it is advantageously possible to further optimize the itinerary planning. The

Availability probability of the stands is determined in particular based on the arrival time of the vehicle at the stand and the length of stay at the stand. Furthermore, the arithmetic unit can, for example, resort to historical data which statistically indicate at what times the individual post offices were occupied in the past or were vacant. In addition, bookings already made by third parties for the stands may be taken into account in the probability of availability.

Furthermore, when calculating the route sequence, the driving behavior of a particular user can be predicted. For example, it can be determined from historical data for a particular driver how fast or slow he drives. From this, profiles for specific drivers can be derived. According to one embodiment of the method according to the invention, the arithmetic unit calculates the predicted amount of residual energy in the energy store on the basis of the predicted energy consumption when driving on the route sequence. It is on the one hand the

predicted energy consumption for driving the vehicle and the other

predicted energy consumption of the vehicle's internal consumers. This predicted energy consumption is then taken into account in the predicted amount of residual energy in the energy storage during the passage of the route sequence. In this way, it is advantageously considered in an electric vehicle that the energy consumption also depends on the state of charge of the battery. Namely, if the state of charge of a battery is lower, the result of driving a route is a greater change in the

Charge state than at a higher state of charge of the battery. If the vehicle is driven by means of a fuel, it is taken into account in this case that the fuel consumption also depends on the residual amount of fuel in the vehicle due to the change in the weight of the vehicle.

In forecasting the energy consumption of the vehicle's internal consumers, weather forecasts or the season at which the route sequence should be traveled may be taken into account. If it turns out that the ambient temperature is likely to be very high during the passage of the route sequence, it can be taken into account in the prediction of the energy consumption due to internal consumers that the vehicle's air conditioning system is very likely to be switched on during the passage of the route sequence. In addition, features of the road network of the route sequence, in particular road gradients and delays or accelerations due to curves, can be taken into account. These features of the road network have an influence on the energy consumption when driving on the route sequence.

According to a development of the method according to the invention, the arithmetic unit is transmitted user-specific secondary conditions. The arithmetic unit takes these user-specific secondary conditions into account when determining the locations. When

Constraints, the user can specify preferences. For example, the user can specify which priority should be used to ensure that a certain

Remaining energy in the energy storage is always stored. This constraint can give the user a sense of having enough energy in the energy storage of the vehicle in case of any unforeseen changes in the appointments to respond to these changes. In addition, the user can specify the priority for meeting deadlines on time. Alternatively, he may have a certain acceptable Specify delay time. In this case, it can also be taken into account in the itinerary planning that although the appointments in the route sequence can not be exactly met, the optimal route sequence is much better than the next best route sequence, so that slight delays within the framework of the user's specifications are tolerated.

Furthermore, the user can specify priorities with regard to the stands. For example, as a constraint, it can set the maximum distance of a stand from the target. He may also indicate a preference for a particular type of parking space, such as a disabled parking space.

After a route cross is calculated by the method according to the invention, the calculated route sequence is output, for example by means of a display in FIG

Connection with a geographical map. Furthermore, the sites belonging to the route sequence can be automatically reserved by transferring corresponding data to a corresponding facility for reserving stands. Furthermore, the calculated route sequence can be transmitted to a device of the vehicle.

According to a further development of the method according to the invention, the amount of residual energy in the energy store of the vehicle is detected while driving the calculated route sequence and compared with the predicted amount of residual energy of the vehicle for a corresponding route position. If the deviation of the detected remaining energy amount from the predicted amount of residual energy exceeds a limit value, the route sequence is recalculated on the basis of the detected residual energy amount. The method according to the invention thus not only serves to carry out travel route planning before starting the journey. Rather, it can also be checked during the journey whether the forecasts made in the calculation of the route sequence were correct. In particular, the forecasts for the energy consumption of the vehicle when driving on the route, i. the predicted amount of residual energy at the individual route positions is compared with the actual amount of residual energy. For deviations that exceed a certain limit, which can also be 0, the route sequence is recalculated. This calculation can be done in advance

carried out calculation. The limit may e.g. at a

Deviation of 5% or 10%.

Furthermore, it can be checked whether due to the deviation of the actual

Residual energy amount of the predicted amount of residual energy a specific target of Target sequence can not be achieved because the energy to drive the vehicle is no longer sufficient for this. In such a case, the route sequence can in particular be changed such that the intermediate position of the geographical position of a

Power supply device is inserted in the route sequence. This advantageously ensures that the goals of the target sequence can be achieved in any case, even if they are achieved at a later date, so that certain dates may not be met in time.

Furthermore, also with regard to other assumptions made in the pre-calculation of the route sequence, deviations from the actual values when driving on the route sequence may occur. For example, it can be checked whether certain positions of the route sequence are reached in good time in accordance with the prognosis. In this case, it is also possible to take into account data that has been generated from another vehicle that is currently participating in the traffic situation (so-called XFCD-extended floating car data). Furthermore, data of a vehicle-to-vehicle or vehicle-to-X communication can also be taken into account. Also in this case, the route sequence can be recalculated in case of any deviations. In addition, current traffic data can be taken into account. If this traffic data deviates from the assumptions in the prediction of the route sequence, and if certain destinations can not be reached in time or energy, or if they can not be reached in time, an adapted route sequence can be calculated.

Furthermore, the availability probabilities for stands can also be updated during the journey by a data transmission by radio. The

The arithmetic unit may in particular take into account current data for occupancy of the stands, including the probable duration of the occupancy, and possibly the

Customize the route sequence to select other locations than those used in the pre-calculated route sequence.

Finally, the route can also be rescheduled continuously and not dependent on certain events during the journey.

According to the first aspect of the invention, there is further provided a travel route planning apparatus for a vehicle. The vehicle comprises an energy store for storing the energy for driving the vehicle. The device comprises an arithmetic unit and a data memory coupled to the arithmetic unit, in which data is added to a road network and Data on geographical positions of stands, the parking lots or

Include power supply facilities are stored for the vehicle. Furthermore, the device comprises an interface coupled to the arithmetic unit, via which a destination sequence for the travel route to be planned can be transmitted to the arithmetic unit. Optionally, an output unit coupled to the arithmetic unit can furthermore be provided, by means of which a route sequence calculated by the arithmetic unit can be output, in particular displayed, by output. Alternatively or additionally, an interface for transmitting the data to the. calculated route sequence may be provided. In the apparatus according to the invention, a route sequence can be calculated by means of the arithmetic unit, wherein the predicted amount of residual energy in the energy store for driving on the

Route sequence is calculated. For the goals of the target sequence, each of the targets assigned to the targets is determined in the vicinity of the respective target. For every goal of

Target sequence is determined an assigned stand, wherein the determination of the distance of the stand. from the assigned destination, the geographical position of the next destination or the geographical positions of the stands of the next destination and / or the predicted amount of residual energy in the energy store for driving on the route sequence are taken into account. The route sequence is then composed of routes between locations of successive destinations of the destination sequence.

The device according to the invention is particularly suitable for carrying out the method according to the invention described above. It therefore also has the same advantages as the method according to the invention.

According to a development of the device according to the invention, it comprises a

Vehicle-external module and an in-vehicle module, wherein the vehicle-external module comprises the computing unit. The vehicle-external and the vehicle-internal module are at least temporarily coupled to one another via an interface, so that at least the route sequence can be transferred from the vehicle-external module to the vehicle-internal module. The in-vehicle module comprises a further computing unit, another

Output unit, a memory for storing a transmitted from the vehicle external module route sequence and a sensor for detecting the amount of residual energy in the energy storage of the vehicle. By means of the further arithmetic unit, the detected amount of residual energy in the energy storage of the vehicle is comparable with the predicted amount of residual energy of the vehicle for a corresponding route position of the route sequence stored in the memory while driving the calculated route sequence. If the deviation of the detected residual energy amount from the predicted amount of residual energy exceeds a threshold, the route sequence is based on the detected

Remaining energy can be recalculated and output via the output unit.

Advantageously, it is thus possible while driving the calculated in advance

Adapt route sequence when the actual amount of residual energy in the energy storage of the vehicle from the predicted amount of residual energy of the vehicle deviates. Furthermore, even in the event of deviations of other parameters which were used in the precalculation of the route sequence, adjustments of the route sequence can be made by the further arithmetic unit in the vehicle, as has been explained above with reference to the method according to the invention.

The itinerary planning, d. H. In particular, the calculation, planning and optimization of the itinerary, can be done by a vehicle external, an in-vehicle or divided into an off-vehicle and an in-vehicle device.

According to a second aspect of the invention, there is provided a method of performing travel route planning for a vehicle, wherein the event data includes

geographical positions of destinations of the itinerary to be planned and associated time data, are transmitted to a computing unit which is coupled to a data memory in which data is stored to a road network for the vehicle and data to the geographical positions of power supply facilities. The arithmetic unit checks in the process, whether a route sequence is computable, which the geographical

Associate positions of the objectives associated with the appointment data so as to achieve the goals for the associated time data of the appointment data, the predicted

Remaining amount of energy in the energy storage of Fährzeugs for driving on the

Route sequence is determined and taken into account. If no such route sequence can be calculated by means of the arithmetic unit, the arithmetic unit determines adapted appointment data for which such a route sequence can be calculated. The adjusted appointment data is then output.

Thus, in the method according to the invention according to the second aspect, it is not only considered whether the energy reserves of the vehicle are sufficient to reach the targets of the target sequence. It is also checked whether in terms of timing the appointments can be met with a calculated route sequence. If this is not the case, in the method according to the invention according to the second aspect, a change in the appointment data is determined for which there is a route sequence which does not conflict with the appointment data in terms of time. At the same time, however, also the predicted amount of residual energy in the vehicle's energy storage, to ensure that the targets can be achieved in terms of energy. When predicting the amount of residual energy, it is also taken into account that the energy stored in the energy store of the vehicle

Amount of energy at the geographical positions of the power supply facilities can be increased, and in this case does not need to be completely replenished in each energy supply device, the energy storage of the vehicle.

When calculating whether a route sequence is calculable, which does not conflict with the appointment data, the arithmetic unit can in particular different possible

Try alternatives and check that geographic, temporal and energetic constraints are met.

When checking whether the goals can be achieved at the corresponding start times of the appointments, a duration for reaching the destination when driving on the route sequence is calculated. Various factors can be incorporated in this calculation of the route duration. The route durations may depend, for example, on the time of day, the day of the week, any public holidays and / or the expected traffic volume. Furthermore, stored historical data can be used in order to calculate the route duration for driving during a specific time of day more accurately.

According to a development of the method according to the invention, new time data are assigned to the geographic positions of destinations in the adapted appointment data. Each destination of the appointment data is thus still approached by the route sequence, but at other times. As a result, it is advantageously possible to provide travel route planning in which the user can perceive the intended appointments, but has to postpone them. To which times the appointments are to be postponed, the user can easily find out through the itinerary planning. After the appointments have been postponed, there is a route sequence that ensures that the goals can be achieved in terms of time and energy.

If it is not possible to find a route sequence which connects the destinations to one another by a route sequence even with changed time data, it can also be proposed in the method according to the invention that one or more destinations be deleted or shifted or the order of the destinations changed becomes. This also makes it easier for the user to adjust his appointments, since it calculates which destination

for example, must be deleted or moved to get a route sequence, which connects the remaining goals without temporal or energetic conflict. This change of the time data can also be done interactively with the user.

In the method according to the invention, the arithmetic unit optimizes the time that can be used by the user of the vehicle, in particular when calculating the route sequence. This useful time can be increased, for example, by increasing the amount of energy in the energy store of the vehicle during a service life of the vehicle during an appointment of the user. If required from an energetic point of view, the ripple sequence arithmetic unit selects the position of an energy spreader near a target, particularly at a stand of the target, so that the vehicle's energy storage can be charged during the life of the vehicle during an appointment.

According to the second aspect of the invention, there is further proposed a travel route planning apparatus for a vehicle including an energy storage for storing the power for driving the vehicle, which includes a computing unit and one having the

Arithmetic unit coupled data storage, in which data are stored to a road network and data on geographical positions of power supply facilities for the vehicle. Furthermore, an interface coupled to the arithmetic unit is provided, via which appointment data, which include geographical positions of destinations of the travel route to be planned and associated time data, can be transmitted to the arithmetic unit. Furthermore, the device comprises an output unit coupled to the arithmetic unit, by means of which a route sequence calculated by the arithmetic unit and / or adapted date data can be output. The device according to the invention according to the second aspect. The invention is characterized in that it can be checked by means of the arithmetic unit, whether a route sequence can be calculated, which determines the geographical positions of the

Appointment data associated goals that the goals are achieved to the associated time data of the appointment data, wherein the predicted amount of residual energy in the

Energy storage of the vehicle for driving on the route sequence determined and

is taken into account. If no such route sequence is calculable, are with the

Computational unit adapted appointment data can be determined for which such a route sequence can be calculated.

The device according to the invention according to the second aspect of the invention is in particular for carrying out the method according to the second aspect of the invention suitable. It thus also has the same advantages as the method according to the second aspect of the invention.

According to a development of the device according to the invention this includes a

Vehicle-external module and an in-vehicle module, wherein the vehicle-external module comprises the computing unit. The vehicle-external and the vehicle-internal module are at least temporarily coupled to one another via an interface, so that at least one route sequence can be transmitted from the vehicle-external module to the vehicle-internal module. The in-vehicle module comprises a further computing unit, a further output unit, a memory for storing a module external of the vehicle

transmitted route sequence and a sensor for detecting the residual energy in the energy storage of the vehicle. By means of the further arithmetic unit, the detected amount of residual energy in the energy storage of the vehicle is with the vehicle during the driving of the calculated route sequence. predicted residual energy amount of the vehicle for a corresponding route position of the stored in the memory route sequence comparable. If the deviation of the detected residual energy amount from the predicted amount of residual energy exceeds a limit value, it can be checked by means of the further arithmetic unit whether the destinations of the route sequence to the associated time data of the appointment data are still reached, wherein the predicted amount of residual energy in the energy store of the vehicle for driving on the route sequence is determined. If the check shows that the goals of the route sequence can not be achieved with respect to the associated time data, the further arithmetic unit calculates a customized one for output via the further output unit

Route sequence or specific custom event data.

The aforementioned features of the method according to the invention and the device according to the invention according to the first aspect of the invention can be combined individually or together with the method and the device according to the second aspect of the invention. Conversely, the individual features of the method and apparatus of the second aspect of the invention may be combined individually or together with the method and apparatus according to the first aspect of the invention.

According to a third aspect of the invention, a method for performing a

Itinerary planning for a vehicle is provided in which a destination sequence for the travel route to be planned is transmitted to a computing unit that is coupled to a data store in which data about a road network for the vehicle is stored. The

Arithmetic unit then calculates a route sequence which the targets of the target sequence combines. Furthermore, a predicted amount of residual energy is calculated in the energy store for driving on the route sequence. Furthermore, at least for the

geographic position of Fährzeugs at a certain destination of the targets of the target sequence based on the predicted amount of residual energy of the vehicle energy storage and based on the stored road network and a predicted energy consumption when driving the road network, the points of the road network determined by the one

specific destination with the predicted amount of residual energy remaining at that particular destination. For at least the particular target of the target sequence, a graphical map representation is generated in which the geographical position of that target and the points of the road network are visualized, starting from that target with the predicted one

Remaining energy of the vehicle at this destination are still available.

The inventive method according to the third aspect is thus a

Visualization of the remaining range generated to a pre-calculated route sequence. In particular, for each destination of the destination sequence on a geographical map, an area - is marked, which can be reached from this destination with the remaining amount of energy in the energy store of the vehicle. This visualization already informs the user during the planning of the route sequence, i. before departure, for each destination gives an impression of what areas he can still reach with the respective energy reserves of the vehicle. In particular, this representation prevents insecurity of a user when using electric vehicles. In addition, the user can use this

Visualization easy and intuitive still influence the route planning.

The visualization takes place, for example, in that an area is delimited on the graphic map display, wherein the delimited area contains the achievable points of the road network. Furthermore, the visualization can be done by a closed contour. According to a development of the method according to the invention, further data for the geographical positions of energy supply devices for the vehicle are stored in the data memory. In the graphic map display, the geographical positions of energy supply devices are visualized, which can still be reached from the determined destination with the predicted amount of residual energy of the vehicle.

Advantageously, the user can easily and intuitively recognize in this way whether

Power supply devices when driving the route sequence can be achieved from a specific destination, so that the energy storage of the vehicle can be replenished at any time. According to a development of the method according to the invention, the route sequence contains the geographical position of an intermediate destination or a stand

Power supply device. For this intermediate goal becomes a graphic

Map representation is generated, in which the geographical position of this intermediate target and the points of the road network are visualized, which are still available before filling the energy storage at the power supply device, and also the points of

Road network are visualized, which after filling the energy storage in the

Power supply device can be reached. In this way, the user can be taught how the remaining range before filling the energy storage and after the

Filling the energy storage is.

According to one embodiment of the method according to the invention, a reference position is detected. When calculating the route sequence, it is ensured that the reference position always lies within the remaining range of the vehicle. The reference position can

for example, the residence or the workplace of the user. In the calculation of the route sequence, it is thus advantageously ensured that the user can get back to this reference position at any time during the passage of the route sequence. In this case, the reference position is within the remaining range of the vehicle, even if the vehicle to achieve the reference position as an intermediate goal

Power supply device for the vehicle must start. Even in this case, it is ensured that the reference position can be reached from an energy point of view.

According to a further development of the method according to the invention, the amount of residual energy in the vehicle's energy store is detected while the calculated route sequence is running and at least when a destination of the destination sequence is reached, a customized graphical map representation is created in which the geographical position of this destination and the points of the route network are visualized. which from this goal with the captured

Amount of residual energy in the energy storage of the vehicle can be achieved. In this way, the amount of residual energy that was used in the preliminary calculation of the route sequence is checked on the basis of the actual amount of residual energy detected in the vehicle. In case of any deviations, an adapted map display with the

Visualization of the remaining range of the user displayed so that it can easily and intuitively recognize whether the other targets of the target sequence are still within the remaining range. If this is not the case, the user or the arithmetic unit can make automatic adjustments to the route sequence, as has already been explained with reference to the other aspects of the invention. According to the third aspect of the invention, there is further provided a travel route planning apparatus for a vehicle including an energy storage for storing the power for driving the vehicle. The device has a computing unit and a data memory coupled to the computing unit, in which data about a road network for the vehicle is stored. Furthermore, the device has one with the arithmetic unit

coupled interface via which a destination sequence for the travel route to be planned can be transmitted to the arithmetic unit. Furthermore, an output unit is coupled to the arithmetic unit. In the device according to the invention according to the third aspect of the invention, a predicted amount of residual energy in the energy store for driving on the route sequence can be calculated by means of the arithmetic unit. At least for the geographical position of the vehicle at a particular destination of the targets of the target sequence are based on the

predicted residual energy amount of the thermal energy storage of the vehicle and based on the stored road network and a predicted energy consumption when driving the road network, the points of the road network can be determined, which are still reachable from the one specific target with the predicted amount of residual energy at this particular destination. For at least the specific destination of the target sequence, a graphic map representation can be generated and output by means of the output unit; in which the geographical position of this target and the points of the road network are visualized, which are still reachable from this target with the predicted amount of residual energy of the vehicle at this destination.

This device according to the third aspect of the invention is particularly adapted to carry out the method according to the third aspect of the invention. The device thus also has the same advantages as the method according to the third aspect of the invention.

According to a development of the device according to the invention, this one

Vehicle external module and an in-vehicle module. Module, wherein the vehicle-external module comprises the arithmetic unit. The vehicle-external and the vehicle-internal module are at least temporarily coupled to one another via an interface, so that at least the route sequence can be transferred from the vehicle-external module to the vehicle-internal module. The in-vehicle module comprises a further computing unit, another

Output unit, a memory for storing a transmitted from the in-vehicle to the vehicle external module route sequence and a sensor for detecting the amount of residual energy in the energy storage of the vehicle. By means of the further computer unit, the detected amount of residual energy is in during the passage of the calculated routine sequence. Energy storage of the vehicle with the predicted amount of residual energy of the vehicle for a similar route sequence of the stored in the memory route sequence comparable. If the deviation of the detected amount of residual energy from the predicted amount of residual energy exceeds a limit value, an adapted graphic value is generated

Map display is generated, in which the geographical position of a target and the points of the road network are visualized, from this target with the detected

Amount of residual energy in the energy storage of the vehicle can be achieved. In this way, one advantageously achieves an adaptation, the visualization of the remaining range of the vehicle when reaching a destination as a function of the actual

Remaining energy in the vehicle.

The features of the method and the device according to the third aspect of the invention may be used individually or in combination also in connection with the methods and the

Devices of the first two aspects of the invention can be used. Conversely, the features of the methods of the devices of the first two aspects of the invention can also be used individually or in combination with the methods and the device according to the third aspect of the invention.

The invention will now be explained with reference to an embodiment with reference to the drawings.

Figure 1 shows schematically an embodiment of the invention

 Device for carrying out a travel route planning for a vehicle,

Figure 2 shows a representation for the purpose of illustrating the goals and the

 Targets assigned to destinations,

Figure 3 shows an embodiment of the inventive method for

 Carrying out a route planning for a vehicle,

FIG. 4 shows a graph with a curve showing the

 Remaining energy amount when driving on the route sequence shows, and Figures 5 to 12 show graphical map representations with additional information to the

Route sequence. 1 shows schematically the basic structure of an embodiment of the device according to the invention. The device comprises an in-vehicle module and a vehicle-external module that can exchange data with each other at least temporarily.

The vehicle-external module may comprise a computer 3, which is connected via an interface 21 to an input unit 4. The input unit 4 may be a keyboard or a mobile device, via which data can be read into the computer 3. The computer 3 further comprises a computing unit 7, which is coupled to a data memory 6 and a display device 5 and the interface 21. By means of the computer 3 can be a travel route planning for a vehicle 1 perform, as will be explained later with reference to an embodiment of the method according to the invention.

The in-vehicle module is accommodated in a vehicle 1. The vehicle 1 comprises an energy store 2. The energy store 2 may be formed by a rechargeable battery. This battery supplies the energy for driving the vehicle 1 and optionally for further internal consumption of the vehicle 1. However, the energy store 2 can also be a fuel tank which receives fuel for driving the vehicle 1. In addition, it is possible that the vehicle 1 is a hybrid vehicle that can be driven by both the power of a battery and fuel.

With the energy storage 2, a sensor 15 for detecting the amount of residual energy in the energy storage 2 is provided. This sensor detects the state of charge of a rechargeable battery or the level of fuel in a fuel tank.

Furthermore, the vehicle 1 comprises a further arithmetic unit 12, which is coupled to the sensor 15, a further display device 13 and a further data memory 14 in terms of data technology.

The computer 3 and the vehicle 1 are further equipped with radio interfaces 8 and 11, which are connected to the computing unit 7 and the computing unit 12, respectively. Via a switching station 1, a data transmission 18, 20 between the computer 3 and the vehicle 1 can be produced in this way between the interfaces 8 and 1 1. Thus, data can be transmitted, in particular, from the computer 3 to the arithmetic unit 12 of the vehicle 1. The radio connection may be, for example, a Act mobile connection. However, it would also be possible for it to be a wireless network connection (WLAN) or other short-range radio link that allows data exchange when the vehicle 1 is in the vicinity of the computer 3. If the network is a mobile radio connection, it is also possible for the computer 3 or the computing unit 12 of the vehicle 1 to exchange data with an external server 16, which also has a radio interface 17. By means of the server 16, a data transmission 19 is possible, which contain relevant information for the route planning, as will be explained later with reference to the embodiment of the inventive method.

FIG. 2 schematically shows an example of a route to be planned. Via an electronic appointment calendar, the arithmetic unit 7 was sent via the interface 21 a schedule for a day of the user. The user wants to approach the destinations Z1, Z2 and Z3 on this day. These destinations Z1, Z2 and Z3 are assigned different geographical positions. In addition, the appointment data contain time data indicating when the user wants to reach the destinations Z1 s Z2 and Z3 and when he wants to leave them again. The route to be planned should therefore connect the target sequence Z1, Z2 and Z3 to each other so that the user can perceive the appointments at these destinations Z1, Z2, Z3 at the assigned times. It should also be ensured that the energy reserves in the energy storage 2 of the vehicle 1 are sufficient to start the targets Z1, Z2 and Z3. However, it is possible that the energy storage 2 is filled in energy supply facilities during the run of the route sequence.

Furthermore, it is taken into account that the user with his vehicle 1 can not approach the destinations Z1, Z2 and Z3 directly, but requires a parking space for the vehicle 1. The data memory 6 therefore contains a list of stands whose geographical positions and the information as to whether the stand is a parking space or the stand comprises a power supply device, by means of which the energy storage 2 of the vehicle 1 can be filled.

In the destinations Z1, Z2 and Z3 shown in FIG. 2, the parking spaces 1_P1, 1_P2, 1_P3 are assigned to the destination Z1. The parking spaces 2_P1, 2_P2, 2_P3 and 2_P4 and the energy supply device 2_L5 are assigned to the destination Z2. The third destination Z3 is assigned the parking spaces 3_P1, 3_P2, 3_P3 and the energy supply device 3_L4. By means of the arithmetic unit 7, a route sequence can be determined which the stands connects to each other, which are associated with the goals Z1, Z2 and Z3, as shown by the arrows 9.

An example of such a method for carrying out travel route planning is explained below with reference to FIG. 3:

First, the computer unit 7 of the computer 3 are transmitted via the interface 21 in step S1 user-specific constraints. These constraints may specify preferences of the user. These preferences may, for example, relate to the stands for the destinations. The user can specify a maximum distance of a stand from a destination. Furthermore, he may indicate a particular preference for a type of parking space, for example for a disabled parking space. Furthermore, the user can specify with which priority it should be ensured that a certain amount of residual energy is always stored in the energy store 2 of the vehicle 2 during the planned route sequence. Furthermore, the user can indicate how important it is for him to arrive at the destination in time for the start times of the appointments. If necessary, he can specify a certain tolerance for delays here. For example, the user may specify that a destination with

5 minutes delay may be achieved, if it is prevented in this way that a power supply device between two targets must be controlled, instead of performing the refilling of the energy storage 2 during an appointment on a stand at a destination.

Subsequently, in step S2, the appointment data of the user, for example, transmitted from an electronic calendar on a mobile terminal of the user by means of the interface 21 to the computing unit 7. The appointment data contains information about the geographical positions of destinations to. planning itinerary and associated time data. The time data indicates when an appointment begins at a particular destination and when it ends. From this data, the length of stay at a specific destination can be determined.

In step S3, the arithmetic unit 7 decomposes the appointment data into a destination sequence with successive destinations. Subsequently, a route sequence is calculated with routes connecting the destinations of the destination sequence. In this case, the arithmetic unit 7 accesses a road network, which can drive the vehicle 1, back, which in the data memory

6 is stored. In step S4, various routes are determined for this purpose, which connect successive destinations of the destination sequence with one another. For each route is then in step S5, an estimate of the traffic when driving on the route. In this case, the arithmetic unit 7 can resort to historical traffic data which is stored in the data memory 6. In addition, the computing unit 7 can be transmitted traffic data from the external server 16 via the radio links 19 and 18. Furthermore, it is also possible to take into account traffic data which has been generated from another vehicle which is currently participating in the traffic situation (so-called XFCD-extended floating car data). Furthermore, traffic data that has been transmitted by a vehicle-to-vehicle or vehicle-to-X communication can also be taken into account. In this way, the arithmetic unit 7 can estimate the traffic volume when driving on a route.

Furthermore, the computing unit 7 can estimate the speed of the vehicle 1 when driving on a route in step S6. In this estimation, the arithmetic unit can take into account the type of road used, which is stored together with the road network in the data memory 6. Furthermore, the arithmetic unit 7 can take into account user-specific data on the driver's driving behavior, which is to run the route sequence. Such driver-specific data can also be stored in the data memory 6. For example, they can be obtained from past rides of this driver.

In step S7, from the lengths of the various routes connecting the destinations, the estimation of the traffic when driving on the route and the driver-specific data, a rough estimate is made of how much time the driver takes to drive the individual routes. Then alternative route sequences are determined which require as little time to reach the destinations.

Now, in step S8 of the computing unit 7, the remaining amount of energy in the energy storage 2 for the driving of the route sequences predicted. In this case, the energy consumption of the vehicle 1 and features of the road network when driving on the route sequences are taken into account. For example, it can be considered how the slope of a road of the road network is, since the slope affects the energy consumption of the vehicle 1. Furthermore, delays or accelerations due to curves can be taken into account, since they also affect the energy consumption of the vehicle 1. Further, in an iterative process, the predicted amount of remaining energy taken into account in the energy storage. Namely, the state of charge of a rechargeable battery or the amount of fuel in a tank of the vehicle 1 affect the power consumption of the vehicle. If the state of charge of a battery is lower, the result is a Route namely a greater change in the state of charge than at a higher state of charge of the battery. Furthermore, internal consumers of the vehicle 1 are taken into account in the predicted energy consumption. For example, the probability can be determined that the air conditioner is turned on while driving the route. Furthermore, a user behavior of the driver of the vehicle 1 can be taken into account. The data from which the energy consumption and thus the amount of residual energy in the energy storage 2 are predicted for driving on the route sequences are stored in the data memory 6. They can be read out by the arithmetic unit 7 and taken into account accordingly in the prognosis.

In step S9, the arithmetic unit 7 selects preferred route sequences. It is particularly taken into account whether the respective amount of residual energy at the geographical positions of the route sequences is sufficient to achieve the goals of the target sequence. If not all goals can be achieved with the initial amount of energy in the energy store 2 of the vehicle 1, it is necessary for the energy store 2 to be filled up when driving on the route sequence. In the data memory 6, the geographical positions of energy supply facilities are stored for this purpose. The arithmetic unit 7 preferably selects those route sequences in which the energy store 2 of the vehicle 1 can be filled, while the vehicle 1 is located during an appointment of the user at a stand which is assigned to a destination of the target sequence.

For the selection of the stand location, a destination space is formed in step S10 for the destinations of the destination sequence. The size of the target space depends on the maximum distance a stand may have from the target. This maximum distance may have been entered by the user in step S1. In the data memory 6, the geographical positions of all stands of the road network are stored. It is now possible to determine the locations that lie within the target area that belongs to a specific destination. Furthermore, it is stored in the data memory 6 whether the parking space is a parking space or whether the parking space comprises a power supply device (see FIG. 2).

In step S11, an allocated stand is determined for each destination of the destination sequence. The following factors are taken into account:

From the forecast for the amount of residual energy in the energy storage 2 of the vehicle 1, it is determined whether it is necessary that the stand comprises a power supply device. If this is the case, only stands will be included in the following selection Energy supply facilities considered. If this is not the case, only parking spaces will be considered.

Furthermore, the distance of the parking space from the assigned destination is taken into account and, if appropriate, the duration which the user requires to travel from the parking space to the destination. It can also be taken into account whether the user is walking from the stand to the destination or otherwise gets from the stand to the destination. From the distance and the way the target is reached from the stand, it is possible to deduce a duration that a user needs to travel from the stand to the assigned destination. User-dependent walking speeds that are stored in the data memory 6 can also be taken into account.

Furthermore, the geographical position of the next destination or the geographical position of the stands of the next destination or of a selected location of the next destination is taken into account. Alternatively or additionally, the geographic location of the previous destination or the geographic location of the previous destination's or a previous site's location of the previous destination may be taken into account. This consideration may not always make the most favorable one next to a destination. If extended by this stand, the route to reach the destination and the next destination, another stand may be cheaper from a temporal point of view, although he is further away from the associated destination.

The stands assigned to the destinations are now selected by the arithmetic unit 7 so that neither temporal nor energetic conflicts arise. This means that the energy reserves in the energy storage device of the vehicle 1 when driving on the route sequence are sufficient to reach the parking spaces allocated to the destinations, taking into account that the energy storage device 2 can be partially or completely filled up at stands with energy supply facilities. It also ensures that the targets are timely, i. in accordance with the appointment data reached by the user, taking into account not only the time to travel the routes between the stands, but also the duration a user takes to get from the stand to the associated destination.

In step S12, the probability of availability of the stands in the target area to the destinations can also be determined. For this purpose, a step S11 can be the time of arrival of the vehicle at the stand to be examined and the length of stay at this stand determined and. with historical data stored in the data memory 6 are compared. Furthermore, third-party bookings already made for the stands by the external server 16 can be called up via the data connections 18 and 19. If there are already bookings for the desired time, the availability probability of the corresponding stand is very low or zero. Such locations are then not taken into account by the computing unit 7 for the route sequence in step S11.

Subsequently, in step S13, a detailed planning of the route sequence is performed. The routes between two stands, which belong to successive destinations of the target sequence, are again optimized in terms of time and energy.

Thereafter, an optimization of the routes in the daily routine is performed in step S14, wherein in particular it is ensured that the route sequence fits in time with the searched appointment data. It is ensured that the user arrives at the starting times of the appointments at the corresponding geographical positions. It also optimizes the usable time of the user. This means, in particular, that the amount of energy in the energy store 2 of the vehicle 1 is increased during a service life of the vehicle 1 during an appointment of the user. If the arithmetic unit 7 was able to calculate a route sequence which does not cause temporal and energetic conflicts with the appointment data, the calculated route sequence can be displayed via the display device 5 or output via radio interface 8 in step S18. The details of the visualization of the route sequence will be explained later.

If, however, it turns out that no route sequence can be calculated by means of the arithmetic unit 7, which does not cause any conflicts with the appointment data in terms of time, the arithmetic unit 7 checks various alternative route sequences in step S15. Initially, the energetic and geographical constraints remain unchanged, ie it should continue to pass through the target sequence corresponding to the target sequence of the route sequence. Furthermore, it is ensured by the computing unit 7 that the predicted amount of energy in the energy store 2 of the vehicle 1 is sufficient to achieve all destinations of the target sequence, taking into account that the energy store 2 can be filled in the meantime by energy supply facilities when driving on the route sequence. In this case, a route sequence is calculated, which approaches in terms of time as close as possible to the desired appointment data. In step S16 then adapted. Appointment data is output, wherein there is an associated route sequence which does not conflict with the adjusted appointment data. By means of the input unit 4, the user can accept the adapted appointment data. They are then transmitted via the interface 21 to the electronic calendar. If necessary, messages for additional participants of the appointment are automatically generated in order to inform them of the adapted appointment data.

If it is not possible to calculate a route sequence without temporal or energetic conflicts based on adjusted appointment data, then in step S17 a route sequence is calculated in which one or more destinations have been canceled. These changes, the appointment data and the adapted route sequence are output. When the user accepts the customized route sequence and the changed appointment data, the adapted route sequence is stored as the current route sequence, and the changed appointment data is transmitted to the user's electronic calendar.

Once the route sequence for itinerary planning has been determined, the calculated route sequence is displayed and output in step S18. Furthermore, the arithmetic unit 7 reserves the desired locations of the route sequence via the data connections 18 and 19 at the external server 16.

According to a further development of the exemplary embodiment of the method according to the invention, various uncertainties arising during travel route planning are determined and coupled to one another. On the one hand, an uncertainty can be determined so that the driver reaches the predicted time of arrival at a stand at a certain point in time. Furthermore, the probability can be taken into account that the driver actually leaves the parking space at the predicted departure time. The probabilities may be represented by curves having different heights, i. Probabilities, specify and the different widths, i. have different deviations from the predicted value.

Furthermore, a deviation probability from the nominal traffic flow can be taken into account. In combination with the uncertainty that the driver will reach or leave a certain parking space at the predicted time, probabilities for traffic-related arrival and departure times can be calculated. Furthermore, an uncertainty can be considered, which relates to the occupancy of a power supply device or a parking lot. If necessary, the vehicle 1 must wait a certain time until the parking space or the energy supply device becomes free. As a result, the probabilities for the arrival and departure times can be further modified.

The combinations of the probability distributions can be used by the computing units 7 and 12 to optimize the advance planning of the route sequence or the optimization of the route sequence during the journey. In doing so, the predictability and predictability of the itinerary in the network is maximized.

Hereinafter, how the output of the travel route planning calculated by the above-described method is performed will be described with reference to FIGS. 4 to 12.

FIG. 4 shows the predicted remaining energy quantity for the route sequence, as it can be displayed to the user. A coordinate system is displayed on whose horizontal axis the time is plotted and on whose vertical axis the amount of residual energy in the energy storage 2 of the vehicle is plotted from 0% to 100%. The horizontal axis also indicates abbreviations for locations reached at the respective times in the route sequence. For example, it can be seen from the illustrated curve 22 that the vehicle travels from Brunswick to Wolfsburg at 7:00 am. Wolfsburg results in a service life of the vehicle. At 12.00 clock then the energy storage 2 of the vehicle 1 is filled. At 5:00 pm and shortly before 10:00 pm, the energy store 2 is replenished. In addition, it can be seen from the curve 22 that if the energy storage 2 had not been replenished at 12.00 o'clock, the energy reserves would have been used up while traveling along a route of the route sequence. It would thus have resulted in an energetic conflict, which would have meant that the driver would have remained with the vehicle.

Furthermore, as shown in FIG. 5, after the calculation of the route sequence by means of the road network stored in the data memory 6, a graphic map representation can be generated in which the geographical positions of the sites belonging to the destinations are represented by the symbols P1 to P4. Comprises a stand orgungseinrichtung Energievers a ', a character is additionally displayed which indicates that, for example, the battery of the electric vehicle can be charged. Of Further, the geographical position of a reference position H is displayed. The reference position can be, for example, the residence of the user or his workplace.

Assuming that the user starts the route sequence at the reference position H, it is determined based on the output energy amount in the energy storage 2 of the vehicle and on the basis of the stored road network, which points of the road network from the reference position H can still be reached. This range also takes into account the predicted energy consumption when driving on the road network. In the graphic map display, a borderline 23 is now displayed, which visualizes the range of the vehicle 2 at the geographical reference position H. The boundary line 23 delimits the area with the points of the road network, which can be reached from the position of the vehicle 2 with the remaining energy of the energy storage 2.

In a further representation shown in FIG. 6, the route 24 is shown from the geographical reference position H to the position P1 assigned to the first destination. Further, the residual energy amount of the energy storage 2 of the vehicle 1 is predicted at the geographical position of the stand P1 as described above. For this amount of residual energy, the range of the vehicle 1 is again determined, i. E. the points of the road network are determined which can still be reached from the parking space P1 with the predicted amount of remaining energy. For this range of range, a boundary line 25 is again displayed on the graphic map.

In Figure 7, the route 26 from the stand P1 of the first destination to the stand P2 of the second destination is indicated in the graphic map representation. Furthermore, as in the case of the visualization according to FIG. 6, the remaining range of the vehicle 2 with the predicted amount of residual energy at the parking space P2 is determined and represented by means of the boundary line 27.

Similarly, in the illustration of FIG. 8, the route 28 from the stand P2 of the second destination to the stand P3 of the third destination is displayed on the graphic map display. Furthermore, a limit line 29 for the remaining range at the stand P3 is shown. As can be seen from FIG. 8, this residual range no longer suffices for the vehicle 2 to reach the position P4 of the fourth target. However, the route sequence has been calculated in advance so that the third destination has a stand selected which includes a power supply device. When P3 stand the energy storage 2 of the vehicle 1 can thus be filled. As shown in FIG. 9, the remaining range of the Vehicle 1 at the stand P3 indicated by the boundary line 29 before filling the energy storage 2 and based on the boundary line 30 after filling the energy storage. As can be seen from FIG. 9, the remaining range after filling up the energy store 2 is sufficient to reach the stand P4 for the next destination. In addition, the remaining range is sufficient to reach the reference position H.

Finally, FIG. 10 shows the route 31 from the stand P3 to the stand P4 of the fourth destination on the graphic map representation. Further, the remaining range of the vehicle 1 at the stand P4 is shown with reference to the boundary line 32. It can be seen in particular that the reference position H remains within this residual range. It has thus been ensured in the route sequence that the reference position H can always be reached.

Finally, FIG. 11 shows the route 33 on the graphic map representation, which leads from the stand P4 back to the reference position H. Furthermore, the remaining range at the reference position H at the end of the route sequence is represented by the boundary line 34. At the end of the route sequence thus results in a relatively small amount of residual energy. The energy storage 2 of the vehicle should therefore be refilled at the reference position H.

In Figure 12 additional information to a stand P2 are still shown. This additional information can be retrieved by the user by pressing the input unit 4 before departure or - as will be explained later - while driving.

With reference to FIG. 3, an example of the method for performing travel route planning for a vehicle has been described. After the route planning has been completed and a route sequence is present, it is used during the passage of the route sequence to offer route guidance to the user in the vehicle and to adjust the route sequence if necessary. An example of these further method steps is explained below:

Data are first transmitted to the arithmetic unit 12 in the vehicle 1 via the data links 18 and 20 to the route sequence determined by the arithmetic unit 7. The computing unit 12 is designed essentially like the computing unit 7. Furthermore, the data memory 14 in the vehicle 1 also contains the same information as the data memory 6 of the vehicle Computer 3. If necessary, the data memories 6 and 14 can also be synchronized via the data links 18, 20.

While driving, the driver of the vehicle 1 is now outputted navigation information for driving the route sequence via the display device 13. The arithmetic unit 12 thus provides a conventional vehicle navigation system in conjunction with the display device 13. For this purpose, the arithmetic unit 12 is also coupled to a receiver for satellite signal, for example a GPS receiver. This receiver can also be integrated in the arithmetic unit 12.

At the same time, the arithmetic unit 12 continuously transmits data from the sensor 15 to the residual energy amount in the energy store 2. If the deviation of the recorded remaining amount of residual energy in the energy store 2 of the vehicle 1 from the predicted amount of residual energy in the calculation by means of the computing unit 7 reaches a certain limit value, e.g. 10% of the predicted amount of residual energy, the route sequence can be recalculated on the basis of the amount of residual energy recorded. If the first amount of residual energy is less than the predicted amount of residual energy, it is checked in particular whether the. Residual energy sufficient to reach all destinations and energy supply facilities. If this is not the case, the route sequence is recalculated and output by the arithmetic unit 12 as explained with reference to FIG.

Furthermore, the current position with the predicted position increases. compared at a certain time. If there is a deviation in terms of time, in particular if a geographical position of the route sequence has not yet been reached at a certain point in time, it is checked whether the destinations of the route sequence with respect to the associated time data of the appointment data can still be reached. In this case, the predicted amount of residual energy in the energy storage of the vehicle is also taken into account for the preceding sections of the route sequence. For example, if, due to the actual energy consumption, it is necessary to schedule an unplanned stop or several unplanned stops for the replenishment of the amount of energy in the energy store 2, the additional time required for this stopover is taken into account.

Furthermore, current traffic data can be taken into account, which are transmitted to the arithmetic unit 12 via the data links 19 and 20 from an external server 16. In Depending on current traffic data Can be calculated an updated time to reach the next destination. Furthermore, the route sequence can be updated in terms of time. Also in this case, it is checked whether the goals of the route sequence to the associated time data of the appointment data can still be achieved.

If it turns out that certain appointments can not be met in terms of time, an issue is generated for the driver so that he can adjust the appointments if necessary and inform other participants on the dates.

In this case, the arithmetic unit 12 calculates a customized route sequence in which the time data of the appointment data has been adapted or certain appointments have been canceled, as already explained above.

Furthermore, the availability probabilities for the availability of the locations of the route sequence can be updated. Corresponding data can be transmitted to the arithmetic unit 12 as an example via the data connections 19, 20 from the external server 16. For example, if it turns out that a certain parking space is no longer free, the arithmetic unit 12 adjusts the route sequence to select another parking space for a particular destination in the route sequence. If it turns out that a stand with a power supply is not free at the desired time of the route sequence, the arithmetic unit 12 may select another stand with an adapted route sequence power supply. This other stand with the power supply may be at a different destination. When optimizing the route sequence, the arithmetic unit 12 maximizes the time available to the user. Any waiting times during the filling of the amount of energy of the energy storage 2 are minimized and, if possible, placed in times at which the user perceives an appointment.

For all adaptations of the route sequence during the journey, adapted graphic map representations and diagrams, as shown in FIGS. 4 to 12, are also generated and, if necessary, output via the display device 13 in the vehicle 1.

Through the travel route planning according to the invention, a holistic calculation of a driving task with a destination sequence and corresponding local, temporal and energetic restrictions can be calculated. In particular, when planning to replenish the energy reserves of the vehicle 1, a coupled consideration of all the destinations of the target sequence is achieved performed. This is particularly important when vehicle 1 is an electric vehicle with a limited range. Further, not only the driving routes for the vehicle 1 are considered, but also the routes from stopping places of the vehicle .1 to the desired destinations. The durations for these routes are included in the calculation of the route sequence and in particular in the selection of the sites for the destinations.

LIST OF REFERENCE NUMBERS

vehicle

energy storage

computer

input unit

display device

data storage

computer unit

Radio interface

arrows

switching station

switching station

computer unit

display device

data storage

sensor

external server

Radio interface

data connections

Energy curve of the route sequence

boundary line

route

boundary line

route

boundary line

route

boundary line

boundary line

route

boundary line

route

boundary line

Claims

claims
1. A method for carrying out travel route planning for a vehicle (1), which comprises an energy store (2) for storing the energy for driving the vehicle (1), in which a) a destination sequence for the travel route to be planned is sent to a computing unit (7). b) the computing unit (7) calculates a route sequence which determines the destinations of the data traffic system (6) in which data relating to a road network for the vehicle (1) are stored
 Target sequence connects, characterized in that c) a predicted amount of residual energy in the energy store (2) is calculated for driving on the route sequence, d) at least for the geographical position of the vehicle (1) at a specific destination of the targets of the target sequence based on the predicted Amount of residual energy of the energy storage device (2) of the vehicle (1) and based on the stored road network and a predicted energy consumption when driving the road network, the points of the road network are determined, which are still reachable from the one specific destination with the predicted amount of residual energy at this particular destination , and e) for at least the one target of the target sequence, a graphical map representation
 is generated, in which the geographical position of this target and the points of the road network are visualized, which are still reachable from this goal with the predicted amount of residual energy of the vehicle (1) at this destination.
2. The method according to claim 1, characterized in that in the data memory (6) data on geographical positions of power supply facilities for the vehicle (1) are stored and in the graphic map representation the
geographical positions of energy supply facilities are visualized can still be reached with the predicted amount of residual energy of the vehicle (1) from the specific destination.
3. The method according to claim 1 or 2, characterized in that the route sequence contains as an intermediate destination the geographical position of a power supply device and that for this intermediate destination, a graphical map representation is generated in which the geographical position of this intermediate destination and the points of the road network are visualized before refilling the energy store (2) at the
 Power supply device are still available, and also the points of the
 Road network are visualized, which can be reached after filling the energy storage device (2) in the power supply device.
4. The method according to any one of the preceding claims, characterized in that a reference position (H) is detected and that in the calculation of the route sequence ensures that the reference position (H) is within the remaining range of the vehicle (1).
5. The method according to claim 4, characterized in that the reference position (H) is also within the remaining range of the vehicle (1) when the vehicle (1) to reach the reference position (H) as an intermediate target, an energy supply device for the vehicle (1 ) must start.
6. The method according to any one of the preceding claims, characterized in that while driving the calculated route sequence, the amount of residual energy in the energy storage (2) of the vehicle (1) is detected and at least when reaching a destination of the target sequence, a customized graphical map representation is generated, in which the geographical position of this target and the points of the road network are visualized, which can be achieved from this target with the amount of residual energy detected in the energy store (2) of the vehicle (1).
7. The method according to any one of the preceding claims, characterized in that the amount of residual energy in the energy storage (2) of the vehicle (1) is detected while driving the calculated route sequence and with the predicted
 Remaining energy amount of the energy storage device (2) of the vehicle (1) is compared for a corresponding route position and, if the deviation of the detected residual energy amount of the predicted residual energy amount exceeds a limit, the
Route sequence is recalculated on the basis of the detected residual energy.
8. Device for route planning for a vehicle (1), which comprises an energy store (2) for storing the energy for driving the vehicle (1), with a computer unit (7), a data memory (6) coupled to the computer unit (7). in which data for a road network for the vehicle (1) are stored, an interface (21) coupled to the arithmetic unit (7) via which a destination sequence for the travel route to be planned can be transmitted to the arithmetic unit (7), and with the arithmetic unit (7) coupled to the output unit (5), characterized in that by means of the arithmetic unit (7) a predicted amount of residual energy in the energy store (2) for driving on the route sequence is calculated, at least for the geographical position of the vehicle (1) a specific destination of the target sequence targets on the basis of the predicted amount of residual energy of the energy storage device (2) of the vehicle (1) and based on the stored road network and a prognostic the points of the road network can be determined by driving the road network, which can still be reached from the one destination with the predicted amount of residual energy at this specific destination, can produce a graphic map display for at least the specific destination of the destination sequence and can be output by means of the output unit (5) is, in which the geographical position of this target and the points of the road network are visualized, which are still reachable from this goal with the predicted amount of residual energy of the vehicle (1) at this destination.
9. Apparatus according to claim 8, characterized in that; in that the device has a vehicle-external module (3) and an in-vehicle module, wherein the vehicle-external module (3) comprises the arithmetic unit (7), the vehicle-external module (3) and the vehicle-internal module via an interface (8, 11) at least temporarily with each other in terms of data technology are coupled, so at least the route sequence can be transmitted from the vehicle-external module (3) to the in-vehicle module, that the vehicle-internal module has a further computing unit (12), another one
Output unit (13), a memory (14) for storing one of
Vehicle external module (3) transmitted route sequence and a sensor (15) for detecting the amount of residual energy in the energy storage (2) of the vehicle (1), by means of the further processing unit (12) while driving the calculated route sequence, the detected residual energy in the energy store (2) of
Vehicle (1) with the predicted amount of residual energy of the energy storage (2) of the vehicle (1) for a corresponding route position of the memory sequence stored in the memory (14) is comparable and, if the deviation of the detected residual energy amount of the predicted Resteriergiemenge exceeds a limit, a an adapted graphic carterid representation is generated, in which the geographical position of a target and the points of the road network are visualized, which from this target with the recorded amount of residual energy in the
Energy storage (2) of the vehicle (1) can be achieved.
PCT/EP2012/001180 2011-04-01 2012-03-16 Method and apparatus for carrying out travel route planning for a vehicle WO2012130397A2 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
DE10201101577.8 2011-04-01
DE102011015777A DE102011015777A1 (en) 2011-04-01 2011-04-01 Method and apparatus for carrying out itinerary planning for a vehicle

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
EP12723093.6A EP2697608B1 (en) 2011-04-01 2012-03-16 Method and apparatus for carrying out travel route planning for a vehicle
CN201280025607.4A CN103608643B (en) 2011-04-01 2012-03-16 For the method and apparatus for motor vehicles programme path
US14/008,852 US9291469B2 (en) 2011-04-01 2012-03-16 Method and device for planning a travel route for a vehicle

Publications (2)

Publication Number Publication Date
WO2012130397A2 true WO2012130397A2 (en) 2012-10-04
WO2012130397A3 WO2012130397A3 (en) 2013-06-27

Family

ID=46148801

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/EP2012/001180 WO2012130397A2 (en) 2011-04-01 2012-03-16 Method and apparatus for carrying out travel route planning for a vehicle

Country Status (4)

Country Link
US (1) US9291469B2 (en)
EP (1) EP2697608B1 (en)
DE (1) DE102011015777A1 (en)
WO (1) WO2012130397A2 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2018036281A (en) * 2017-11-16 2018-03-08 三菱重工業株式会社 User terminal
US10139245B2 (en) 2014-03-06 2018-11-27 Mitsubishi Heavy Industries, Ltd. Device for providing electric-moving-body information and method for providing electric-moving-body information

Families Citing this family (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2012126100A1 (en) * 2011-03-23 2012-09-27 Lito Green Motion Inc. Motor vehicle power management system and method
US10137908B2 (en) 2011-06-13 2018-11-27 General Electric Company Vehicle traction control system and method
US10259444B2 (en) 2011-06-13 2019-04-16 Ge Global Sourcing Llc Vehicle control system and method
WO2014073028A1 (en) 2012-11-06 2014-05-15 三菱電機株式会社 Navigation device
JP5928320B2 (en) * 2012-12-07 2016-06-01 株式会社日立製作所 Navigation system for electric vehicles
US10222222B2 (en) 2013-03-15 2019-03-05 Abalta Technologies, Inc. Roundtrip range projection
US9121719B2 (en) * 2013-03-15 2015-09-01 Abalta Technologies, Inc. Vehicle range projection
EP3026395A1 (en) 2013-07-25 2016-06-01 Nissan Motor Co., Ltd Predicted remaining energy guidance system
US10488209B2 (en) * 2015-09-08 2019-11-26 Ford Global Technologies, Llc Method and apparatus for recommending power-saving vehicular utilization changes
US10190882B2 (en) * 2015-12-17 2019-01-29 Jaguar Land Rover Limited System and method to facilitate having adequate vehicle power
DE102016224786A1 (en) * 2016-12-13 2018-06-14 Bayerische Motoren Werke Aktiengesellschaft Travel time optimization for a vehicle with electric drive
US10288439B2 (en) * 2017-02-22 2019-05-14 Robert D. Pedersen Systems and methods using artificial intelligence for routing electric vehicles
DE102017210802A1 (en) * 2017-06-27 2018-12-27 Bayerische Motoren Werke Aktiengesellschaft Driver assistance system, means of locomotion, server and method for supporting a user of a means of locomotion
DE102017215792A1 (en) * 2017-09-07 2019-03-07 Bayerische Motoren Werke Aktiengesellschaft A method, apparatus, computer program and computer program product for route planning for a vehicle

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE19519107C1 (en) 1995-05-24 1996-04-04 Daimler Benz Ag Travel route guidance device for electric vehicle
DE10059746A1 (en) 2000-02-23 2001-10-11 Deutsche Telekom Ag Reiseroutenplanungs- and travel route guidance system
EP1201849A2 (en) 2000-10-26 2002-05-02 Daimler-Benz Aktiengesellschaft Method and device for allocating parking space
DE10302504A1 (en) 2003-01-23 2004-09-02 Zf Friedrichshafen Ag Electric vehicle range determination method in which parameters and information relating to the vehicle, route, environment and driving manner are input to a computer so that a range can be determined prior to or during a journey
DE102004022265A1 (en) 2004-05-06 2005-12-01 Robert Bosch Gmbh Method for working out a route in a navigation system
EP1300817B1 (en) 2001-09-20 2006-04-12 Pioneer Corporation Navigation data providing system, server and navigation terminal
DE102005055243A1 (en) 2005-11-19 2007-05-31 Daimlerchrysler Ag Road course evaluation device for e.g. commercial vehicle, has measuring unit determining vehicle sided energy consumption, and evaluation unit for evaluation of road course after detection of route end based on vehicle related information
DE102009053982A1 (en) 2009-11-19 2010-06-24 Daimler Ag Consumption-optimized route calculating system for motor vehicle, has computing unit calculating s consumption-optimized route by using vehicle individual and/or driver individual consumption-relevant data of storage unit

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE10146789A1 (en) * 2001-09-22 2003-04-24 Bosch Gmbh Robert Method for determining a route from a start to a target point using a vehicle navigation system takes into account the remaining fuel, thus ensuring a driver does not run out of fuel
JP4906164B2 (en) 2007-07-19 2012-03-28 アイシン・エィ・ダブリュ株式会社 Map display device, map display method, and computer program
US20100094496A1 (en) 2008-09-19 2010-04-15 Barak Hershkovitz System and Method for Operating an Electric Vehicle
AU2009293389A1 (en) 2008-09-19 2010-03-25 Better Place GmbH System and method for operating an electric vehicle
DE102008030563A1 (en) * 2008-06-27 2009-12-31 Bayerische Motoren Werke Aktiengesellschaft Motor vehicle e.g. hydrogen motor vehicle, has navigation system automatically determining target location so that drive to location and drive back to actual residence or to starting location are carried out based on remaining range value
JP5413042B2 (en) 2009-08-07 2014-02-12 株式会社デンソー Storage information output device and storage information output system

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE19519107C1 (en) 1995-05-24 1996-04-04 Daimler Benz Ag Travel route guidance device for electric vehicle
DE10059746A1 (en) 2000-02-23 2001-10-11 Deutsche Telekom Ag Reiseroutenplanungs- and travel route guidance system
EP1201849A2 (en) 2000-10-26 2002-05-02 Daimler-Benz Aktiengesellschaft Method and device for allocating parking space
EP1300817B1 (en) 2001-09-20 2006-04-12 Pioneer Corporation Navigation data providing system, server and navigation terminal
DE10302504A1 (en) 2003-01-23 2004-09-02 Zf Friedrichshafen Ag Electric vehicle range determination method in which parameters and information relating to the vehicle, route, environment and driving manner are input to a computer so that a range can be determined prior to or during a journey
DE102004022265A1 (en) 2004-05-06 2005-12-01 Robert Bosch Gmbh Method for working out a route in a navigation system
DE102005055243A1 (en) 2005-11-19 2007-05-31 Daimlerchrysler Ag Road course evaluation device for e.g. commercial vehicle, has measuring unit determining vehicle sided energy consumption, and evaluation unit for evaluation of road course after detection of route end based on vehicle related information
DE102009053982A1 (en) 2009-11-19 2010-06-24 Daimler Ag Consumption-optimized route calculating system for motor vehicle, has computing unit calculating s consumption-optimized route by using vehicle individual and/or driver individual consumption-relevant data of storage unit

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10139245B2 (en) 2014-03-06 2018-11-27 Mitsubishi Heavy Industries, Ltd. Device for providing electric-moving-body information and method for providing electric-moving-body information
JP2018036281A (en) * 2017-11-16 2018-03-08 三菱重工業株式会社 User terminal

Also Published As

Publication number Publication date
US9291469B2 (en) 2016-03-22
DE102011015777A1 (en) 2012-10-04
EP2697608A2 (en) 2014-02-19
US20140052373A1 (en) 2014-02-20
WO2012130397A3 (en) 2013-06-27
EP2697608B1 (en) 2018-05-23

Similar Documents

Publication Publication Date Title
US8965669B2 (en) Electric vehicle charging network services
CN103052529B (en) Battery charge controller
EP1179815B1 (en) Mobile information processing system
US8706409B2 (en) Vehicle route selection based on energy usage
JP5970070B2 (en) Electric vehicle charging support system and charging support method
CN102564426B (en) Information provider unit and server, vehicle assistance system, guider
US20110202221A1 (en) Charge controller and navigation device for plug-in vehicle
US20040254721A1 (en) Navigation system
CN102460332B (en) System and method for managing electric vehicle traffic
US20100094496A1 (en) System and Method for Operating an Electric Vehicle
TWI424381B (en) Driving assistant method and system for electric vehicle
JP5631367B2 (en) Route search device
TWI583577B (en) Battery exchange system for electric vehicles
US8825354B2 (en) System for supporting a user of an electrically driven vehicle
CN102192755B (en) Route planning device and route planning system
US20120109519A1 (en) System and method for routing bev to charging station
US6625539B1 (en) Range prediction in fleet management of electric and fuel-cell vehicles
CN102770304B (en) Electric power apparatus for controlling of supply and information provider unit
EP1975028A2 (en) Driving support method and driving support apparatus for hybrid vehicle
US8473135B2 (en) Information and telecommunications system, vehicular device, center device, and method for controlling the system
JP2016085734A (en) Transportation service reservation method, transportation service reservation apparatus, and transportation service reservation program
JP4375431B2 (en) Energy supply control system
US20110246252A1 (en) Vehicle charging allocation managing server and vehicle charging allocation managing system
JP4373941B2 (en) Fuel supply station information distribution system, fuel supply station information distribution server, and fuel supply station information display device
KR20140078623A (en) Estimation and management of loads in electric vehicle networks

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 12723093

Country of ref document: EP

Kind code of ref document: A2

WWE Wipo information: entry into national phase

Ref document number: 14008852

Country of ref document: US