Patent Application
20250176780
This application claims the priority, under 35 U.S.C. § 119, of German Patent Application DE 102023212213.8, filed Dec. 5, 2023; the prior application is herewith incorporated by reference in its entirety.
The invention relates to a cleaning robot. In particular, the invention relates to an apparatus and a corresponding method for increasing the convenience of using a cleaning robot.
A cleaning robot can be used in a household to perform one or more different cleaning tasks, in particular vacuuming and/or mopping. For this purpose, it is possible to enable a user of the cleaning robot to define a usage order for performing a cleaning task via a user interface of the cleaning robot. The usage order can be aimed at an immediate (ad hoc) execution of the cleaning task (so that the cleaning task is initiated manually). On the other hand, the usage order can be directed to a cleaning task that is planned for the future (which corresponds to a so-called scheduled task). Determining usage orders for performing different cleaning tasks can possibly be associated with a relatively high effort for the user.
The present document deals with the technical task of increasing the convenience of a cleaning robot in relation to the definition of a usage order for the performance of a cleaning task in an efficient and reliable manner.
The object is achieved in each case by the subjects of the individual independent claims. Advantageous embodiments are defined in particular in the dependent claims, described in the following description or illustrated in the attached drawing.
With the foregoing and other objects in view there is provided, in accordance with the invention, an apparatus for determining a usage order for a cleaning robot. The apparatus contains a controller configured to:
In accordance with one aspect, an apparatus for determining a usage order for a cleaning robot, in particular for a robot for vacuuming and/or sweeping and/or mopping is described. The apparatus can be part of the cleaning robot. Alternatively or additionally, the apparatus can be at least partially or completely part of an external computing unit (for example, a backend server).
The apparatus is configured so as to determine a quantity (for example 10 or more, or 50 or more, or 100 or more) of cleaning orders already executed that were executed by the cleaning robot within a previous operating period (for example, 1 week or more, or 4 weeks or more). The individual cleaning orders from the quantity of cleaning orders already executed were each manually started by a user of the cleaning robot (via a user interface of the cleaning robot).
The individual cleaning orders each indicate the scope of the cleaning task that is executed by the cleaning robot in the respective cleaning order, in particular the spatial scope of the cleaning task and/or the scope of the cleaning task (for example vacuuming or mopping). Furthermore, the individual cleaning orders can each indicate a time, in particular the day of the week and a time of day, on which the respective cleaning order was executed.
Historical usage data in relation to the previous use of the cleaning robot can thus be determined (in the form of a quantity of cleaning orders already executed).
The apparatus is configured so as to determine and/or adapt at least one usage order for a preceding point in time on the basis of the quantity of cleaning orders already executed. The determined usage order can be a planned usage order that is automatically executed, in particular started, by the cleaning robot at a specific point in time, in particular on a specific day of the week and/or at a specific time of day (without the user having to interact via a user interface of the cleaning robot).
The usage order indicates the scope of the cleaning task that is executed by the cleaning robot, in particular the spatial scope of the cleaning task and/or the scope of the cleaning task.
An apparatus is thus described that is configured so as to determine a suggestion for a (possibly planned) usage order on the basis of the historical usage data (in relation to the previous use of the cleaning robot and/or in relation to the cleaning tasks performed so far). The usage order can define a cleaning task with a specific spatial scope and/or with a specific task scope. In this way, the cleaning robot can be operated in a particularly convenient manner.
The entire area (for example, the house or the apartment) in which the cleaning robot is operated can be divided into a large number of different subregions (for example, rooms). The spatial scope can indicate one or more subregions from the plurality of different subregions.
The cleaning robot can be configured so as to be operated in a plurality of different cleaning modes (for example vacuuming or mopping or both in combination). In addition, the intensity (for example, the suction strength and/or the amount of water) of the respective cleaning mode can be changed and/or adjusted. The scope of tasks can indicate the cleaning mode of the cleaning robot and/or the intensity of the cleaning mode.
The apparatus can be configured so as to output a suggestion for executing the determined usage order to a user of the cleaning robot via a user interface of the cleaning robot. The user interface can be provided, for example, on a user device (for example, a smartphone) of the user. The user can accept the suggestion in order to operate the cleaning robot in a convenient manner.
The apparatus can be configured so as to recognize, on the basis of the quantity of cleaning orders already executed, that a cleaning order has not been initiated within the previous operating period for a specific subregion of the overall region in which the cleaning robot is operated and/or for a specific cleaning mode of the plurality of different cleaning modes that can be performed by the cleaning robot. Based on this knowledge, a usage order can be determined (and proposed), which has the specific subregion and/or the specific cleaning mode as a scope. In this way, it is rendered possible to operate the cleaning robot in a particularly convenient manner.
Alternatively or additionally, the apparatus can be configured so as to identify, on the basis of the quantity of cleaning orders already executed, a specific subregion of the overall region and/or a specific cleaning mode of the plurality of different cleaning modes of the cleaning robot, for which there is a relatively high number of cleaning orders (for example greater than a number threshold value) in the quantity of cleaning orders already executed. Based on this knowledge, a usage order can be determined and/or adapted, which has the specific subregion and/or the specific cleaning mode as a scope. In particular, the apparatus can be configured so as to identify an already planned usage order, which already has the specific cleaning mode but not the specific subregion as a scope. The scope of the already planned usage order can then be expanded by the specific subregion and stored in a modified form. In this way, it is rendered possible to operate the cleaning robot in a particularly convenient manner.
The apparatus can be configured so as to determine the preceding point in time, in particular the day of the week and the time of day, for the execution of the usage order on the basis of the points in time, in particular the day of the week and/or time of day, of the quantity of cleaning orders already executed. In this way, it is rendered possible to operate the cleaning robot in a particularly convenient manner.
As already stated above, the scope of the individual cleaning orders from the quantity of cleaning orders already executed in each case indicates one or more subregions of the overall region in which the cleaning robot is operated.
The apparatus can be configured so as to subdivide the individual cleaning orders from the quantity of cleaning orders already executed into one or more data entries for the corresponding one or more subregions, so that the scope of the individual data entries in each case only relates to a single subregion of the overall region. The individual cleaning orders can thus be divided in each case into one or more components (i.e. data entries), one data entry per subregion. The usage order for the preceding point in time can then be determined and/or adapted in a particularly precise and robust manner on the basis of the data entries.
As already stated above, the individual cleaning orders and the data entries determined therefrom each indicate a day of the week and a time of day on which and at which the respective cleaning order or the respective data entry was executed. The apparatus can be configured so as to allocate the determined data entries to a respective day section from a sequence of day sections in dependence upon the respective day of the week and the respective time of day, wherein the sequence of day sections divides a week into a limited number of (for example between 20 and 100) day sections.
It is possible to determine a quantity of allocated data entries for the individual day sections of the sequence of day sections. The usage order for the preceding point in time can then be determined and/or adapted in a particularly robust and precise manner on the basis of the quantity of allocated data entries for at least one day section.
In particular, the apparatus can be configured so as to identify a day section that has a number of allocated data entries that is equal to or greater than a number threshold (for example, 2 or more, or 3 or more). The usage order for the preceding point in time can then be determined and/or adapted in a particularly precise and robust manner on the basis of the quantity of allocated data entries for the identified day section.
The apparatus can be configured so as to determine the preceding point in time, in particular the day of the week and the time of day, for the usage order on the basis of the day of the week and the times of day of the individual data entries of the quantity of allocated data entries for the identified day section. For example, the time of day of the usage order can be determined as an average of the times of day of the data entries.
The apparatus can be configured so as to detect that there is an already planned usage order for the identified day section. The scope of the already planned usage order can then be expanded on the basis of the quantity of allocated data entries for the identified day section. In this way, it is rendered possible to operate the cleaning robot in a particularly convenient manner.
The apparatus can be configured so as to allocate the determined data entries to a first day section from a sequence of first day sections and a second day section from a sequence of second day sections in dependence upon the respective day of the week and the respective time of day, wherein the second day sections are offset in time and overlap with the corresponding first day sections. The usage order can then be determined and/or adapted for the preceding point in time on the basis of the quantity of allocated data entries for a specific first day section and for a specific second day section, which is offset and overlapping with the specific first day section.
In accordance with a further aspect, a cleaning robot, in particular a robot for vacuuming and/or sweeping and/or mopping, is described, which comprises the apparatus described in this document.
In accordance with a further aspect, a method for determining a usage order for a cleaning robot is described. The method comprises determining a quantity of cleaning orders already executed that were executed by the cleaning robot within a previous operating period, wherein the individual cleaning orders each indicate the scope of the cleaning task that is performed by the cleaning robot in the respective cleaning order. Furthermore, the method includes determining and/or adapting at least one usage order for a preceding point in time on the basis of the quantity of cleaning orders already executed, wherein the usage order indicates the scope of the cleaning task to be performed by the cleaning robot in the usage order.
It should be noted that any aspects of the apparatus described in this document and/or the method described in this document can be combined with one another in a variety of ways and/or in any desired manner. In particular, the features of the claims can be combined with one another in a variety of ways and/or in any desired manner.
Other features which are considered as characteristic for the invention are set forth in the appended claims.
Although the invention is illustrated and described herein as embodied in an apparatus and a method for determining a usage order, it is nevertheless not intended to be limited to the details shown, since various modifications and structural changes may be made therein without departing from the spirit of the invention and within the scope and range of equivalents of the claims.
The construction and method of operation of the invention, however, together with additional objects and advantages thereof will be best understood from the following description of specific embodiments when read in connection with the accompanying drawings.
As explained at the beginning, the present document deals with increasing the convenience in relation to the determination of usage orders of a cleaning robot. In this context,
In the vacuuming mode of the cleaning robot 100, the underside 122 faces the floor to be cleaned or the surface of a cleaning area, such as a room, that is to be cleaned. The underside 122 of the cleaning robot 100 typically has one or more drive units 101 (with one or more drive wheels), due to which the cleaning robot 100 can be moved independently in order to clean different areas of the floor. In addition, the cleaning robot 100 can have one or more guide and/or support elements 104 (for example non-driven wheels), which allow a stable movement of the cleaning robot 100 over the floor to be cleaned. In addition, a cleaning robot 100 typically contains one or more cleaning units 106 (in particular suction nozzles) that are configured so as to clean the floor under the cleaning robot 100.
A cleaning unit 106 (in particular a suction nozzle) can have a brush roller 102 that is configured so as to rotate about an axis of rotation, wherein the axis of rotation is typically arranged parallel to the underside 122 of the cleaning robot 100. The brush roller 102 can be used to mechanically detach dust and/or soiling on the floor to be cleaned from the floor, so that the dust and/or the soiling can be sucked into the suction mouth 107 of the cleaning unit 106 with increased reliability.
A user interface 112 (see
In addition, a cleaning robot 100 typically has one or more environment sensors 110 (see
It is possible to enable the user of the cleaning robot 100 to define a usage order for a cleaning task of the cleaning robot 100 at a user interface of the cleaning robot 100. A usage order can alternatively be referred to as a cleaning order (in particular if the order is started manually by the user). The user interface can be provided, for example, via a mobile user device (for example, a smartphone) of the user.
A planned usage order 150 (for the future) can also be referred to as a “scheduled task”.
This document describes a method and a corresponding apparatus 130, which render it possible to create suggestions for new planned usage orders 150 or for adapting existing, planned usage orders 150 on the basis of the usage history of a cleaning robot 100.
The cleaning robot 100 can be configured so as to store each of its usage orders or cleaning orders 150 (both manually started usage orders and planned usage orders), specifying one or more of the following pieces of information:
On the basis of the documentation of the start times for cleaning specific rooms or zones, the frequency of these usage orders 150 can also be determined.
A breakdown of the usage orders 150 by individual rooms and the cleaning mode used in the process allows conclusions to be drawn about cleaning tasks actually desired by the user. In this case, it can be advantageous to really distinguish the rooms (i.e. subregions) that are cleaned by the cleaning robot during a “clean all” order (in which the entire area is to be cleaned) from those which are theoretically listed on the map, but which could not be cleaned or were not cleaned. This has to do with the usage behavior of some users who start a “clean all” program, but deliberately block the way to some rooms (for example by means of a door) in order to ultimately allow the cleaning robot 100 to work only in the desired one or more rooms. There are also users who carry the cleaning robot 100 into a room, give the “clean all” cleaning command there and close the door of the room in order to have the robot clean only in this room.
In addition, a detailing of individual areas can be of interest, for example in order to be able to document “spot cleaning” programs in which the cleaning robot 100 is to clean a (round or square) area with a specific dimension (for example with a specific diameter or with a specific edge length or with a specific number of square meters) at a specific point. If such a cleaning is performed relatively frequently by the user at almost the same location, this cleaning task for a recurring cleaning can also be proposed as a usage order 150. Examples of such areas can be: the entrance area at the front door, the area in front of the kitchenette or in front of a cat toilet.
The documentation of the usage orders 150 that are terminated by the user allows a conclusion to be drawn as to whether a usage order 150 was incorrectly specified by the user or whether only parts of the defined area should be cleaned. For example, if the cleaning of three rooms is commissioned, but interrupted after two rooms, it can be assumed that the cleaning in the last room was not considered so important. However, if more than 75% of a room was cleaned before the cleaning was canceled, it can be concluded that the cleaning of the room was planned and desired. If necessary, each usage order 150 in which more than 75% of the planned area of a room has been cleaned can be stored and taken into account. In this case, all room cleaning mode combinations of the usage order 150 can be accepted as entries in the usage history. An exemplary vacuuming and mopping usage order 150 at full power level over the rooms or zones “A”, “B” and “C” can thus be broken down via the data entries
An analysis algorithm can evaluate the usage history repeatedly, for example once a day or once a week. For this purpose, usage data for a specific past operating period (for example 4 or 8 previous weeks) can be evaluated in order to enable a robust and statistically relevant evaluation. The (control) apparatus 130 of the cleaning robot 100 can be configured so as not to provide a suggestion for a usage order 150 until a sufficient quantity of usage data is available. Furthermore, usage data from a relatively long time ago can be disregarded or taken into account to a lesser extent in the analysis in order to enable an analysis of the current usage behavior of the user. Usage data from a relatively long time ago can therefore be deleted.
The data entries to be included in the analysis can be sorted according to room cleaning mode combinations (i.e. according to data entries). Each individual combination (i.e. each individual data entry) can then be considered separately.
All data entries that belong to a combination (for example, “Room B, vacuum, 100% power”) can be allocated to individual “day sections”. These day sections are time intervals of a 7-day 24-hour week and each have a length of, for example, 4 hours (or 2 hours or 6 hours). A particularly robust evaluation can be achieved by introducing the same number of second day sections, which have the same length, but are offset by half a length compared to the first day sections.
The individual data entries can be allocated (based on the respective day of the week and the respective time of day) in each case to a first day section 201 and a second day section 202 in which the respective data entry falls. The number of data entries that are allocated to a day section 201, 202 allows conclusions to be drawn as to when a user performed the corresponding room cleaning mode combination relatively frequently or relatively rarely. It is possible to determine a quantity 205 of data entries for the individual day sections 201, 202.
The one or more day sections 201, 202 in which at least a specific minimum number of data entries for cleaning tasks have been performed can then be considered. For the individual day sections 201, 202, it is thus possible to check whether a threshold value of data entries is reached or exceeded. Day sections 201, 202 that overlap and that have both reached the threshold value can be combined into a common, merged day section. Data entries that have been allocated to two overlapping day sections 201, 202 are only taken over once in the merged day section. This procedure prevents inaccurate predictions of usage behavior for data entries close to section limits.
In the resulting list of (possibly merged) day sections, a data point can be created for each day section that exceeds the threshold value for data entries for executed cleaning tasks, which is used as a representative for the day section in the further processing. The data point remains linked to the day section and the data entries that are allocated to it, but receives a time stamp that corresponds, for example, to the average value of the start times of all data entries that are allocated to the day section. In this way, a set of data points can be determined that represent when a room cleaning mode combination was performed relatively frequently within a week (Monday-Sunday).
Use of the generated data points 219 as independent suggestions for usage orders 150 can lead to a temporal collision with other suggestions for other room cleaning mode combinations or to a temporal collision with already existing usage orders.
In a subsequent step, all data can be merged, i.e. all data points of all room cleaning mode combinations and all existing (already planned) usage orders 150. This can in turn be done by allocating the data to day sections 201, 202 (as explained in connection with
An allocation to a first and a second day section 201, 202 can be made again, and it is then possible to merge day sections 201, 202 and the quantities 205 of data entries. Based on the merged day sections 212 and the merged quantities 215, data points 219 can then be determined for usage orders 150 (taking into account already existing planned usage orders 150).
The described method can be divided into several steps that can be allocated to two stages. In the first stage, data entries are created and allocated to day sections 201, 202 before the data entries are combined into data points 219. This reduces the quantity of data to be further processed and compared with each other. In the second stage, these data points are in turn allocated to day sections 201, 202 before the actual evaluation finally takes place. The first stage can be performed for each room cleaning mode combination, and in the second stage, all data can then be combined again in order to determine combined usage orders 150 (for several rooms).
In a second stage of the method 300, the determined data points 219 and the already defined planned usage orders 150 (i.e. scheduled tasks) can be allocated to day sections 201, 202 (step 305). In a further step 306, overlapping day sections 201, 202, which each have a specific minimum number of data entries, can be combined.
Thus, (merged) day sections 212 can be defined, which each have data points 219 and planned usage orders 150. This information can be used to define new (possibly planned) usage orders 150 and/or to adapt already existing planned usage orders 150.
First, an evaluation of the data points 219 per room or zone can be used to determine when the room or zone was last cleaned. If the last cleaning process that included this room or zone was longer than, for example, 10 days ago, and in addition other cleaning orders were executed during this period (i.e. the user was not away), the user can be asked (via the one or more user interfaces) whether this room or this zone should be cleaned in a specific way (for example intensity of dry and/or wet cleaning). Alternatively, it can be suggested to the user to extend a possibly already existing scheduled task (i.e. a planned usage order) with the cleaning of this room. On the other hand, if the identified room is never to be cleaned, this room can no longer be proposed for cleaning in the future.
In addition, the one or more remaining day sections 212, which have a quantity 215 of data entries, can be evaluated individually. For this purpose, it can be checked for each data point 219 of a manually started cleaning order 150 whether there is already an entry for a scheduled task with the same settings for room and cleaning mode in the same day section 212 or whether the data point 219 can be converted to a scheduled task alone or with one or more other data points 219 from the same or from another day section 212. In this test, the following cases, among others, can be observed.
1. For a considered data point 219 of a manually started usage order 150, there is no suitable scheduled task with the same room cleaning mode combination in the associated day section 212. In the associated and in no other day section 212 there is another data point of the same room cleaning mode combination within a defined maximum time interval (for example, 2h).
This considered data point 219 is a candidate for a new scheduled task. A suggestion for a usage order 150 for this room cleaning mode combination can be submitted to the user. The suggested start time can correspond to the average value of the start times of the data entries that are allocated to the data point (or alternatively the latest start time) and can be rounded to a quarter of an hour, for example. The data point 219 can finally be removed from the overview.
2. For a considered data point 219 of a manually started usage order 150, there is a suitable scheduled task that includes the room of the usage order 150 with the same room cleaning mode combination in the associated day section 212. Both entries are within a defined maximum time interval (for example, 2h).
This data point 219 is already included in a scheduled task. The data point 219 therefore does not need to be considered further and can be removed from the overview.
3. For a considered data point 219 of a manually started usage order 150, there is a suitable scheduled task with the same room cleaning mode combination, however not the same room, in the associated day section 212. Both entries are within a defined maximum time interval (for example, 2h).
This data point 219 is a candidate to be added to the existing scheduled task. A suggestion can be submitted to the user to extend the scheduled task by the room of the data point 219. The suggested start time can remain unchanged if necessary, but can also correspond to an average value of the start times (data point 219, scheduled task) (for example, rounded to a quarter of an hour). The data point 219 can finally be removed from the overview.
4. For a considered data point 219 of a manually started usage order 150, there is no suitable scheduled task with the same room cleaning mode combination in the associated day section 212, however in simultaneous or temporally overlapping day sections 212 of other days of the week. The start times of data point 219 and scheduled task are within a defined maximum time interval (for example, 2h).
This data point 219 is a candidate to be added to the existing scheduled task. A suggestion can be submitted to the user to extend the scheduled task (in particular the periodicity and/or the frequency of the scheduled task) by the day of the week of the data point 219. The suggested start time can remain unchanged if necessary, but can also correspond to an average value of the start times (data point 219, scheduled task) (for example, rounded to a quarter of an hour). The data point 219 can finally be removed from the overview.
5. For a considered data point 219 of a manually started usage order 150, there is no suitable scheduled task in the associated day section 212 on any day of the week that includes the same room cleaning mode combination, however there are one or more other data points 219 of manually started cleaning orders with the same room cleaning mode combination in simultaneous or temporally overlapping day sections 212 of other days of the week. The start times of data points 219 are within a defined maximum time interval (for example, 2h).
This data point 219 and the found one or more similar data points 219 are candidates for a new scheduled task. A suggestion for this room cleaning mode combination can be submitted to the user on the days of the week involved. The suggested start time can correspond to the average value of the start times of the data entries that are allocated to the data points 219 (or alternatively the latest start time) and can be rounded to a quarter of an hour, for example. The data point 219 and the one or more further combined data points 219 can finally be removed from the overview.
In total, a structured sequence of checks can be performed for each data point 219, which results in the above-mentioned and/or further case distinctions. The suggestion to create a new scheduled task from a data point 219 of a manually started usage order 150 can only be output if all possibilities for adjusting one or more already planned usage orders 150 have already been checked and evaluated negatively.
It can be assumed that the one or more cleaning settings for individual rooms are each defined with the respective scheduled task and are also taken from this data and applied by the cleaning robot 100. However, it is also possible for a user to specify room-specific cleaning modes that are specified in advance by the user in the map of the user interface for each room. One or more cleaning modes can thus in each case be associated with the individual rooms.
In a scheduled task or in a manually started usage order, it may then not be necessary to provide information about the cleaning mode, since these are automatically taken from the map data depending on the room to be cleaned.
For the evaluation of the data entries or data points 219 and the existing usage orders 150, there is thus no need to compare the cleaning mode. In the context of the described method, only an evaluation of the start time and room can then take place.
The suggestions for one or more new or adapted usage orders 150 are preferably not implemented directly, but can be sent, for example, to the user (i.e., for example, to the user's user device) via a push message. The user can then accept or reject the suggestions. The suggestions can remain temporarily stored until a feedback from the user takes place, or—if the user does not use the user interface for a relatively long time—until a recent suggestion replaces the previous one. If the user accepts the suggestion or the suggestions, corresponding changes are automatically implemented in the one or more planned usage orders 150.
It can be checked for a data point 219 for a manually started cleaning order in a day section 212 whether a planned usage order 150 with the same settings 152 already exists in the same day section 212 and for the same room 151 (generally for the same subregion and/or for the same area) (steps 401, 402). If this is the case, the data point 219 can be deleted (step 413).
If this is not the case, it can be checked whether a planned usage order 150 with the same settings already exists in the same day section 212 but for a different room (subregion and/or area) 151 (step 403). If this is the case, the already planned usage order 150 can be adapted (i.e. expanded by the room (subregion and/or area) 151 of the data point 219) (step 414).
If this is not the case, it can be checked whether a planned usage order 150 with other settings 152 already exists in the same day section 212 and for the same room (subregion and/or area) 151 (step 404). If this is the case, the already planned usage order 150 can be adapted (i.e. expanded by the settings of the data point 219) (step 415).
If this is not the case, it can be checked whether a planned usage order 150 with the same settings 152 already exists in the same day section 212 and for the same room (subregion and/or area) 151 but for another day of the week 154 (step 405). If this is the case, the already planned usage order 150 can be adapted (i.e. expanded by the day of the week 154 of the data point 219) (step 416).
If this is not the case, it can be checked whether one or more other data points 219 exist that have the same settings 152 in the same day section 212, but on a different day of the week in each case (step 406). If this is the case, a newly planned usage order 150 can be created (for the data points 219) (step 417).
If this is not the case, it can be checked whether one or more other data points 219 exist for the same room (subregion and/or area) 151, for the same day section 212, for the same or a different day of the week, and with a different setting 152 in each case (step 407). If this is the case, a newly planned usage order 150 can be created (for the data points 219) (step 418).
If this is the case, a suggestion for a planned usage order 150 can be created for the data point 219 (step 408).
The method 400 can then be performed repeatedly for the following data point 219. In this way, the data points 219 for the manually started cleaning orders can be checked gradually.
By means of the measures described in this document, the cleaning orders (usage orders) 150 started via the timer function can be automatically adapted to the user's usage preferences, if necessary without the user having to intervene. For example, the user receives suggestions for usage orders 150 for frequently manually started cleaning tasks, so that the user has to start the cleaning robot 100 themselves less often and can rely on the planned usage orders 150.
In the context of the described method, a distinction can be made between individual days of the week, rooms and/or cleaning modes during the evaluation, so that the user's preferences can be recognized and taken into account in a particularly precise manner. If necessary, the user can be reminded to clean previously omitted areas. The described combination of data entries into data points 219 allows the quantity of data to be processed to be reduced, so that even relatively large quantities of data with limited hardware performance can be evaluated.
The method 500 further comprises determining and/or adapting 502 at least one usage order 150 for a preceding point in time on the basis of the quantity of cleaning orders already executed. In this case, the usage order 150 can indicate the scope 151, 152 of the cleaning task to be performed by the cleaning robot 100 in the usage order 150.
The present invention is not limited to the described exemplary embodiments. In particular, it should be noted that the description and the figures are intended to illustrate only the principle of the apparatus described in this document and/or the method described in this document.
The following is a summary list of reference numerals and the corresponding structure used in the above description of the invention:
| Number | Date | Country | Kind |
|---|---|---|---|
| 102023212213.8 | Dec 2023 | DE | national |
