WO2015144371A1

WO2015144371A1 - Method and apparatus for automatically planning and/or controlling performance of a task

Info

Publication number: WO2015144371A1
Application number: PCT/EP2015/053719
Authority: WO
Inventors: Andreas Vogel; Kateryna KRYKUNOVA
Original assignee: Robert Bosch Gmbh
Priority date: 2014-03-27
Filing date: 2015-02-23
Publication date: 2015-10-01
Also published as: EP3123418A1; DE102014205703A1; CN106164948A

Abstract

A method (100) and an apparatus (200) are used by a user to plan and/or control simple, rapid, timely and - as a result of time, travel costs, fuel and power being saved - economic and environmentally friendly performance of a task with a data record (101) that comprises a respective indication of an action to be performed by the user or of a category for such an action to be performed, of a location at which the task is to be performed, of a period of time within which the task can be performed, with an associated end time (te), and of a permitted additional travel expense (u), wherein a current position of the user is ascertained (107), for each of the at least one task a check is performed (112) to determine whether visiting the at least one location at which the task is to be performed from the current position requires additional travel expense that is no greater than the permitted additional travel expense, and if so the user is provided with a piece of information about the current possibility of performing the task (113).

Description

description

title

Method and device for automatically scheduling and / or controlling a task

A calendar database is known from the PC user program "Microsoft Outlook 2010" by means of which dates can be recorded by date and time A reminder function displays a repeatable reminder message to a user of the program at certain times when scheduled appointments are due or commencing Program a task database that can be used to create task lists and task lists, and the individual tasks can be provided with due dates.

In the following, an appointment is understood as an action that is to be carried out at a specific time at a specific location. By contrast, an action is designated as an action that can be executed at one or possibly several arbitrary points in time within a predefinable, if necessary, also from a plurality of time-separated sections, the execution of the task at a specific location or a selection of Places can be bound, but there are also at least almost location-independent tasks.

If such a task is entered as an appointment in said calendar database, it proves to be disadvantageous that the reminder message is displayed only at certain times that are not matched to an instantaneous activity of the user and are therefore usually inappropriate, i. the reminder message is usually too early or too late, or the user is too far away from the location or selection of locations to which the task is to be completed.

Disclosure of the invention The object of the invention is to provide a method for automatically scheduling and / or controlling a task which avoids the above disadvantages and makes possible a simple, fast and timely execution of the task. The invention also has the object to provide an apparatus for carrying out such a method. Only those tasks are dealt with whose completion is tied to a specific location or a selection of locations.

This object is achieved by a method for automatically scheduling and / or controlling an execution of at least one task by a user, wherein a task is assigned to each task, which in the sense described above is a stationary task to be performed. This record includes an indication of an action to be performed by the user or a category of such action to be performed. In this case, the action to be performed by the user is any activity to be performed by him, work, care or the like. Optionally, the record comprises an indication of a category of such action to be performed, if that action belongs to a category and the indication of the category adequately identifies the action to be performed. A category of actions refers to a number of actions that are similar and / or appropriate for completion at the same location and / or at the same time. A category of actions can also be described as a category of the task in question. Examples of categories of actions or tasks are private or business tasks.

The record further includes an indication of at least one location where the task is to be done. This location may indicate a single, individually fixed location, but also a number of similar or equivalent to accomplish the task equally suitable locations. This number of places forms a category of places. The above action or category of actions can then also be made in such a category of locations. In addition, the record includes an indication of a period of time within which the task can be completed, with an associated finish date by which the task must be completed. The final date is, for example, a latest delivery date, a business deadline or the like. Finally, the data at least one more indication of an authorized additional travel expense. As a travel overhead is a detour, ie a relation to a user currently intended and / or tracked route additionally zurückzulegende route and / or an additional time, ie an additional, in particular for this detour, expended time period designated. The authorized travel overhead is a travel overhead incurred by the user to complete the task, ie, a detour and / or additional time spent by the user to complete the task. Travel overhead and travel allowances include detours covered by any other means of transport and by-passes as footpaths, where the term journey includes the return of each type of route by the user. The authorized travel overhead is preferably determined differently from task to task, in particular according to an importance that is attributed to the execution of the individual tasks, so that a higher authorized additional travel expenditure can preferably be provided for the execution of tasks of high importance. All details of the data record are created when creating the task.

In execution of the method according to the invention, a current position of the user is first determined. The current position represents an instantaneous location or location of the user and is preferably described in a digital map, displayed or registered. Further, for each of the at least one task, it is checked whether a search of the at least one location where the task is to be performed requires from the current location a travel overhead that is not greater than the authorized travel overhead. If appropriate, the user receives information about a current possibility for completing the task, i. Immediate, immediate information that such an acceptable option currently exists.

The invention makes it possible to provide the user with a reminder of one or more tasks to be performed at the appropriate time, in tune with an instantaneous activity of the user, so that these tasks can be performed with minimum additional outlay and / or time, ie at most with one Travel overhead that the user is willing to accept can be done. This is not just an easy-to-use and effective way of It allows a timely completion of tasks, but it can be time and travel costs saved. This leads to increased efficiency and especially environmental friendliness through fuel and energy savings.

Advantageous embodiments of the method according to the invention are characterized in the dependent claims.

According to a preferred development of the method according to the invention, for each of the at least one task, the permitted travel overhead is determined repeatedly from an additional expenditure function which can be specified for each of the at least one task at the respectively current time. An additional expense function is a function of the authorized additional travel expense from the current time, in particular a remaining time span between the current time and the final date. The additional expense function thus serves to determine the permitted additional travel expenses depending on the current time. The current time includes a current date and time. However, if the remaining time between the current time and the end date is e.g. several days, i. If this time span is so great that a change in the authorized additional travel expenses does not occur within one day or would have no influence on the planning of the execution of the task, then the authorized travel overhead from the additional expenditure function can be simply determined depending on the date from the current time become. In particular, the overhead function is a detour function for determining an authorized detour depending on the current time, i. the authorized travel overhead is merely a user-taken detour to complete the task. The determination of the authorized travel overhead is preferably repeated periodically, the period must be so short that all current and changing the current position of the user usually only temporarily, ie In the short term, existing opportunities to complete the task can always be safely captured.

In a further preferred embodiment of the method according to the invention, at least one of the at least one task and the associated data record are automatically transmitted by a device, preferably by a vehicle, in particular preferably by a vehicle, with which the user moves, generated. As a preferred example, tasks relating to pending maintenance work on a vehicle, in particular directly generated by its control and preferably registered in a task database. As a result, the user receives information about an up-to-date possibility for carrying it out via an indication that maintenance work is pending.

It should be mentioned that document DE 198 39 193 A1 discloses a device for controlling and monitoring a vehicle with a first system with radio driver information for a position determination and / or navigation aid and with a second system for evaluating data for technical operating states of the vehicle Vehicle is known. Both systems are linked in such a way that a date supplied by a single encoder is evaluated in both systems for different purposes. This ensures that in the event of vehicle disturbances, e.g. Hydraulic / brake fluid defect,

Brake lining thickness too low, oil pressure error, engine temperature error, etc., an automatic display of workshops or a destination guide there, possibly as an intermediate goal, is made, and that in case of maintenance or supply disturbances, e.g. Tank empty, wash water empty, etc., an automatic display of gas stations or a route guidance there, possibly as an intermediate goal, takes place. Goes e.g. During the run of the fuel supply running low, appears at a certain residual stock, determined by a donor in the second system, an indication with different, resulting from the impending lack of fuel choices in terms of the first system, namely "Next on Route", which are selected can, if the driver does not want to take a detour, "select from list" which is particularly suitable if certain gas station chains are preferred, "select from map", which can select any indicated gas station. If the fuel supply is so low that there is a risk of a breakdown, "Next in Environment" can be selected. If e.g. "Next on route" is selected, the next gas station on the originally planned route is displayed as an intermediate destination.

From the document DE 100 09 723 A1 an apparatus and a method for operating a vehicle are known, in order to avoid unintentional complete consumption of the fuel reserves of the vehicle. In addition to a determination of a remaining amount of residual fuel and one with this residual fuel still zurücklegbaren route additionally determined within the still zurücklegbaren route filling stations by means of a navigation system and displayed to the user of the vehicle. If the fuel quantity falls below a limit value, the navigation device issues a warning signal to which a user of the vehicle can, for example, actuate a key of an input and output device, whereupon the navigation device deviates from the originally desired destination and determines a new travel route to the next one Gas station leads. This new route is determined by the navigation device so that the deviation from the route to the originally selected destination is as small as possible. If several gas stations lie within the radius of the distance still to be covered with the remaining fuel quantity, the gas station is selected which causes the least detour with regard to the route to the originally desired destination.

An automatic planning and / or controlling a completion of at least one task by a user, as the present invention shows, however, is not apparent from these documents, especially as described in the two aforementioned publications, to be done by the user activities to such which are to be done immediately and leave no scope for planning.

According to another embodiment of the method according to the invention, at least one of the at least one task and the associated data set are generated by the user and / or at least one further of the at least one task and the associated data set is generated by at least one third party. In this way, tasks can also be generated by other persons in a very comfortable manner and transmitted to the user for completion, thereby further increasing the flexibility of the method.

Another refinement of the method according to the invention is characterized in that movement probability data for these movements, in particular within specific, recurring time segments, are determined from a plurality of movements of the user, that positions of the movement probability data likely to be traversed for a predetermined, upcoming period Be determined by the user that, for each of the at least one task, it is checked whether a search of the at least one location where the task is to be performed requires a travel overhead from at least one of the positions likely to be traversed in the predetermined upcoming period is greater than the allowable travel overhead, and that, if appropriate, information about a way to complete the task in the upcoming period is transferred as an appointment to a user's schedule. The motion probability data describe probable, ie with certain probability recurring, motion sequences or movement routes and thus the related life rhythm of the user. The recurring time periods are preferably determined by a periodicity in the movements, ie in the activity or life rhythm of the user, for example, the movement probability data are determined on a weekly or monthly basis. The predetermined, upcoming period is then preferably also a calendar week or a month. Beyond the organization of a low-effort completion of tasks, based on the current position of the user, this development of the invention allows a pre-planning of the execution of tasks based on a learned life rhythm. The user thus receives a proposal to complete the task at a time within the upcoming period and at a location that is favorable according to its usual movements, that is, will not exceed a permitted travel overhead. This allows an early scheduling of the task, and the user can prepare early, eg weekly in advance. Preferably, he may reject or accept the proposal to complete the task. If it declines, another proposal will be made, provided that another way to complete the task in the upcoming period is identifiable. If he accepts, the execution of the task will be transferred as an appointment to the user's diary. The completion of the task can be automatically taken over as an appointment in the appointment calendar even without the intervention of the user. In particular, it can also be checked whether the execution of the task would collide with appointments already in the appointment calendar. Furthermore, the positions of the user which are likely to be traversed in the predefined, forthcoming period may preferably be determined from a combination of the movement probability data and the appointments already entered in the appointment calendar, whereby an even better adaptation of the Completion of the task is achieved according to the life rhythm of the user. In this development, the method is thus carried out in advance for the learned, probably to be traversed positions of the user instead of his current position.

From the document DE 10 201 1078 946 A1 a method and an arrangement for determining a most likely driving path of a vehicle are known in which an original probable driving path is determined in consideration of driving likelihood data derived from a road map and using additional ones Data is subsequently corrected. A first module creates the original probable driving path and provides a 2D horizon on its basis. A second module provides drivability data derived from past personal and / or impersonal driving to correct the original probable driving path. A use for the planning of the execution of tasks is not mentioned.

A further preferred embodiment of the method according to the invention is characterized in that from a plurality of executions of tasks with the same and / or similar actions and / or with the same category of actions by the user the at least one place where these tasks are done, indicative Location probability data are determined, and that when creating another task with this same and / or similar action and / or with this same category of actions a proposal for this at least one place where the further task is to be done, formed from the location probability data and is inserted automatically in a record to be created for the further task. Analogous to the determination and evaluation of the probability of movement data, here one learns one or more individually fixed locations which are required for completing a specific, recurring task or a category of tasks by the user from a number of similar or equally suitable locations for completing the task ie from a category of locations, preferably chosen and visited. This further facilitates the handling of the planning of the execution of the task, since only the task or category of the task must be specified and by the method of the preferred places are automatically inserted in the record of the task and submitted as suggestions to the user.

The above object is further achieved by an apparatus for automatically scheduling and / or controlling a completion of at least one task by a user. The device comprises at least one device for determining a current position of the user, in particular with a satellite navigation device, and a current time; at least one input means for generating at least one task to be performed along with a data set associated with this task and / or for inputting information about a task, in particular by the user and / or by at least one third party, more particularly automatically by a device, preferably by a vehicle, in particular preferably by a vehicle, with which the user moves, wherein the at least one input means is in particular formed with a human-machine interface and / or a wired and / or wireless data transmission device; at least one signal processing device and at least one output device for outputting at least one information about a current possibility for completing the task to the user. In this case, the at least one signal processing device is provided with at least one task storage unit for storing the at least one task together with the data set associated with this task, at least one route planning device and / or navigation device for determining at least one route of at least one movement of the user, at least one comparison unit for checking for each of the at least a task, whether a search of at least one place where the task is to be carried out requires, from the current position, a travel overhead that is not greater than an admitted travel overhead, and preferably at least one learning unit for determining movement probability data for a plurality of movements of the user, in particular within certain, recurring time periods, and for determining likely to be traversed positions of the user for a predetermined, forthcoming period from the Bewegungswah probability data and / or for determining location likelihood data from a plurality of tasks with identical and / or similar actions and / or with the same category of actions by the user, which location likelihood data determine the at least one location where these tasks are performed. are formed, designated as well as for storing the motion probability data and / or the location probability data. Such a device can be integrated particularly advantageously in navigation devices or route planning devices of a known type. This allows a particularly compact design and easy handling.

The above-mentioned object is also achieved by a computer program product comprising program parts for carrying out a method of the aforementioned type, by a machine-readable, in particular computer-readable, data structure generated by such a method and / or by at least one such computer program product and by a machine-readable, in particular computer-readable , Data carrier on which at least one such computer program product is recorded and / or stored and / or on which at least one such data structure is kept ready for retrieval.

Embodiments of the invention are illustrated in the drawings and will be described in more detail below. Show it:

FIG. 1 shows a rough-flow diagram of an example of a method according to the invention,

Figure 2 is a rough schematic block diagram of an example of a device according to the invention and

FIG. 3 is a rough schematic diagram of three examples of time profiles of an authorized travel overhead determined by an additional expenditure function for use in the method according to FIG. 1 according to the invention.

In the flowchart of FIG. 1, the reference numeral 100 denotes an example of a method according to the invention with which the execution of at least one task by a user is automatically planned or controlled. An example of such a task is: "Buy bread by the evening." This task is created by the user or possibly by a third party, who entrusts the user with the completion of this task, eg a family member. As a prerequisite for the implementation of the method 100, a data record 101 is created with the following information when generating the task. A first indication be denotes the action to be taken by the user, namely, "buy bread". A second indication denotes at least one place where the task is to be done, ie the bread is to be bought. This is, for example, the location of a particular bakery, it is home to a selection of bakeries or bakery products from leading grocery stores, or it enters a category of places, here the "bakery" category, which includes all bakery-related businesses of all kinds Individual representatives of this category are then suitable for performing the task, but preferably the respective closest representative of this category is proposed.A third indication denotes a period within which the task can be completed, with an associated deadline, up to which the task The period is defined here by the opening times of the bakeries or grocery stores, the final date determines the shop closing time, for example, the place is "bakery B.", as the period from 05:00 to 12:00 and 14:00 Clock until 18:00 clock and registered as the final date 18:00 clock A fourth indication an authorized additional travel expenses for the purchase of bread, here prefers a detour taken by the user, ie compared to a current, ie here in the course of the day anyway intended or pursued route accepted, additionally zurückzulegende route. Optionally, the authorized additional travel expenses also signify a tolerated, additional expenditure of time, ie an additional period of time, in particular for this detour. The permitted travel overhead is optionally fixed, eg as fixed detour "6 km" or fixed period "10 min." Instead of these fixed values, in a preferred modification, an additional expenditure function which can be individually specified for the task is determined, by means of which the permitted travel additional expenditure is determined as a function of a current time, which in this case particularly includes the time of day.

Examples of authorized additional travel expenses are shown in the diagrams of FIG. 3, in which the current time t is plotted on the abscissa and a detour u taken on the ordinate is plotted. In contrast to a time-constant assumed detour of, for example, 6 km, diagram a) of FIG. 3 shows a linear with the current time t from zero to the time ta at which the task is generated, up to a maximum value umax of eg 6 km to the final date te at 18:00 clock rising, accepted detour u. The closer the final date arrives, the greater the detour u, that of the user willing to accept bread for purchase. Initially, the bread should be purchased incidentally and without detour. In the evening, just before closing time, the user is ready to make a detour of - almost - 6 km extra to the bakery B. for the purchase of bread. Preferably, the maximum value umax of the accepted detour u is determined from the distance that is needed to - for example, from the apartment - to go to the bakery B. extra. As a variation, diagram b) of Figure 3 shows a detracked detour u, which, starting with a small value at time ta at which the task is generated, becomes constant during the course of the day, ie as time t continues until shortly before the end date remains and only then quickly rises to the maximum value umax. As a further variation, diagram c) of FIG. 3 shows a detracked detour u, which already starts with a value which almost reaches the maximum value umax at the point in time ta at which the task is generated, and which progresses during the course of the day Time t, until the final date te only gradually increases up to the maximum value umax. The assumed detours u according to diagrams b) and c) result from additional work functions that take into account the user's individual habits: A user according to diagram b) likes to do the task as late as possible while a user prefers to complete the task early according to diagram c).

In a variation of the examples described above, the task may have already been created prior to time ta. The time ta then denotes the beginning of the period within which the task can be completed. As an example, the task of buying bread is already created the night before, but the task can only be completed the next morning from 05:00.

An example of a task created by a device is a "tire change." This task is automatically generated by the vehicle or its control, for example, on October 1. Since a specific workshop W is fixed as a place to complete the task, this is based on the action to be taken automatically detected and immediately entered into the record to be created 101. For this purpose, this comprehensive category "vehicle maintenance" can be specified instead of the specific task and automatically assign the workshop W as a location for all tasks of this category. The period to complete the task is determined by the opening hours of the workshop, the final date is the end of business on 31. October, since the tire change in to be completed this month. An additional expense function for determining the authorized travel overhead is also provided as described above.

The data record 101, thus defined, comprising action, location, time period and permitted travel overhead, is preferably stored in a task database 102. In an analogous manner, action records, time points and locations are also stored 104 in appointments database 103, ie an appointment calendar From the beginning of a journey, ie a movement of the user, eg from the start of the journey 105 with a motor vehicle, cyclically repeated - indicated by an arrow 106 - the current time t and a current position of the user determined 107. At each position thus determined is for all locations specified for the completion of each task stored in the task database calculates a travel overhead, particularly a detour, 108 which causes the location to be located from the current location, including the locations of the task database 109. Then, for each of these places travel overhead and to 1) 1. It is checked 1 12, whether the additional travel expenses for a search of this location from the current position out larger is considered the allowable travel overhead, ie whether the detour is acceptable. If appropriate, the user receives information 1 13 on a current possibility to complete the task. With this information, the travel overhead can be displayed. Will the user to do the task, eg bread, now done directly, preferably a route guidance to the associated location can be made. If the task is completed on a request 1 14, it is marked as completed or deleted in the task database. 1 15. If a category of locations for completing the task is specified, the described procedure always results in the representative of that category closest to the current position proposed. If the test 1 12 results in an additional travel expense that is unacceptable for completing the task, the user currently does not want to carry it out to query 1 14 or if it is completed 1 15, then a query 16 follows as to whether the user's journey has ended or all tasks are done from the task database. In particular, if the task was generated by a device, the query will 1 16 answered by the device. If the user's trip is completed or all tasks are done from the task database, the procedure is ended 1 17, otherwise the overhead for the next task in the task database is calculated 108.

From a plurality of movements or journeys of the user, further, movement probability data are determined 18 and stored 1 19, preferably in a specially provided database. The movement probability data provide information about the probability with which the user visits certain positions or passes through them in succession. Thus, starting from the determination of the current position 107 during a current journey of the user, a most probable route, ie a learned travel behavior, can be determined for an imminent continuation of this journey 120 and for this most probable route the travel overhead with the permitted journey 1 10, that is already obtained in a preview information about a current opportunity to complete a task even before recommending this completion of the current position of the user. In addition to the movement probability data and the current position, appointments from the appointment database which supply information about upcoming trips and their destinations, ie about locations to be visited by the user, are advantageously used for this preview. On the other hand, motion probability data are preferably determined within certain, recurring time segments, eg daily, weekly or monthly, and stored. The likelihood data then provide information about the probability with which the user visits certain positions within such a time interval or passes. From these movement likelihood data for a predetermined, upcoming period, eg, one week in advance, positions likely to be traversed during this period are determined as the user's travel learned for that period of time 120. This travel behavior then becomes planning instead of the user's current location sequence the task is performed and the user at least made a suggestion when and where he can do the job, if he also follows the same travel behavior in the upcoming period. This proposal and thus the task is transferred to the appointment database as an appointment 121. Integration of learned travel behavior in the comparison 1 10 between travel overhead and authorized travel overhead is symbolized by an arrow 122.

Likewise, from a plurality of tasks having similar actions, or the same category of actions by the user, eg, "buy bread", location probability data may be determined that includes the location (s) at which As a result, these locations will learn how to travel when the user marks the "buy bread" task when leaving the bakery as done. When creating another task "buy bread" is from the location probability data a proposal to buy the bread at the preferred bakery as a learned place, formed and automatically inserted into a record to be created for the further task.

The example shown in FIG. 2 of a device 200 according to the invention comprises a satellite navigation device 201 with steps for determining the current position of the user, indicated by an antenna symbol 202, and the current time t, indicated by a clock symbol 203. An input means 204 is designed for Generating tasks to be completed together with assigned data records and entering information about the completion of a task. For this purpose, the input means 204 comprises a first input channel 205 for input by the user or third parties by means of a human-machine interface, in particular directly connected to the device 200, eg a touch screen, a second input channel 206 for input by the user or third party by means of a mobile device , in particular a mobile telephone, and a third input channel 207 for inputting by a device, eg a control device of a vehicle, preferably a vehicle, with which the user travels. A signal processing device 208 contains a task storage unit 209 for storing the at least one task together with the data set associated with this task, a route planning device or navigation device 210 for determining the routes of the user's movements, a comparison unit 21 1, which is used to check the tasks to be performed, Whether the travel overhead for doing the tasks out of the current location is an allowable travel overhead The learning unit serves to determine the movement probability data for the user's movements and to determine the travel behavior of the user, to determine the location likelihood data for the execution of tasks with the same actions or with the same category of actions by the user as well as for storing the motion probability data, ie, the travel behavior 213 and the location probability data. In addition, an output means 214 is provided for outputting at least one information about a current possibility for the task to be performed on the user. All elements of the device 200 are linked together by data links 215.

Claims

Expectations

1 . Method (100) for automatically planning and/or controlling the completion of at least one task by a user, each task being assigned a data record (101) which at least comprises:

• an indication of an action to be carried out by the user or a category of such an action to be carried out,

• an indication of at least one location where the task is to be completed,

• an indication of a period within which the task can be completed, with an associated end date (te) by which the task must be completed, and

• a statement of permitted additional travel expenses (u),

wherein a current position of the user is determined (107), and for each of the at least one task it is checked (1 12) whether visiting the at least one location where the task has to be completed from the current position requires additional travel effort requires that is not greater than the permitted additional travel effort (u), and if applicable, the user receives information about a current opportunity to complete the task (1 13).

2. Method (100) according to claim 1, characterized in that for each of the at least one task, the permitted additional travel effort (u) is determined repeatedly from an additional effort function that can be specified for each of the at least one task at the current time (1 1 1) .

3. Method (100) according to claim 1 or 2, characterized in that at least one of the at least one task and the associated data record (101) are automatically carried out by a device, preferably by a vehicle, in particular preferably by a vehicle with which the user is moved, generated.

4. Method (100) according to claim 1 or 2, characterized in that at least one of the at least one task and the associated data record (101) is carried out by the user and / or at least one further of the at least one task and the associated data record (101). at least one third party can be created.

5. Method (100) according to one or more of the preceding claims, characterized in that movement probability data for these movements, in particular within certain, recurring time periods, are determined from a plurality of movements of the user (1 18), that from the movement probability data for one Predetermined, upcoming period of time, positions of the user that are likely to be passed through are determined (120), that for each of the at least one task it is checked (1 12) whether a visit to the at least one location where the task is to be completed is possible from at least one of the Positions that are likely to be completed in the predetermined, upcoming period require additional travel effort that is not greater than the permitted additional travel effort (u), and that, if applicable, information about a possibility of completing the task in the upcoming period as an appointment The user's appointment calendar is transferred (121).

6. Method (100) according to one or more of the preceding claims, characterized in that from a plurality of completions of tasks with the same and / or similar actions and / or with the same category of actions by the user, the at least one location at which these tasks are completed, identifying location probability data is determined, and that when generating a further task with this same and/or similar action and/or with this same category of actions, a suggestion for this at least one location where the further task is to be completed , formed from the location probability data and automatically inserted into a data record (101) to be created for the further task.

Device (200) for automatically planning and/or controlling completion of at least one task by a user, comprising:

• at least one device (201, 202, 203) for determining a current position of the user, in particular with a satellite navigation device, and a current time (t);

• at least one input means (204) for generating at least one task to be completed together with a data record (101) assigned to this task and/or for entering information about the completion of a task (1 15), in particular by the user and/or by at least one Third, further in particular automatically by a device, preferably by a vehicle, in particular preferably by a vehicle with which the user moves, the at least one input means (204) in particular with a human-machine interface (205) and / or a wired and/or wireless data transmission device (206; 207);

• at least one signal processing device (208).

o at least one task storage unit (209) for storing (102) the at least one task together with the data record (101) assigned to this task,

o at least one route planning device and/or navigation device (210) for determining at least one route of at least one movement of the user,

o at least one comparison unit (21 1) for checking (1 12) for each of the at least one task whether visiting at least one location where the task is to be completed from the current position requires additional travel effort that is not greater is considered an approved additional travel expense (u), and

o preferably at least one learning unit (212) for determining movement probability data (1 18) for a plurality of movements of the user, in particular within certain, recurring time periods, and for determining (120) positions the user is likely to pass through for a predetermined, upcoming period of time the movement probability data and/or for determining location probability data from a plurality of completions of tasks with the same and/or similar actions and/or with the same rather category of actions by the user, which location probability data designate the at least one location where these tasks are completed, as well as for storing (1 19) the movement probability data and/or the location probability data;

• and at least one output means (214) for outputting at least one piece of information about a current option for completing the task to the user (1 13).

8. Computer program product, comprising program parts for executing a method (100) according to at least one of the preceding claims 1 to 6.

9. Machine-readable, in particular computer-readable, data structure, generated by a method (100) according to at least one of claims 1 to 6 and / or by at least one computer program product according to claim 8.

10. Machine-readable, in particular computer-readable, data carrier on which at least one computer program product according to claim 8 is recorded and / or stored and / or on which at least one data structure according to claim 9 is kept ready for retrieval.