Prosecution Insights
Last updated: November 04, 2026
Application No. 19/071,733

CLEANING ROBOTS, CONTROL METHOD AND CONTROL APPARATUS, AND STORAGE MEDIUM

Non-Final OA §102§103§112
Filed
Mar 05, 2025
Priority
Sep 06, 2022 — CN 202211082403.6 +1 more
Examiner
LEE, DOUGLAS
Art Unit
1714
Tech Center
1700 — Chemical & Materials Engineering
Assignee
Qfeeltech (Beijing) Co. Ltd.
OA Round
1 (Non-Final)
45%
Grant Probability
Moderate
1-2
OA Rounds
1y 10m
Est. Remaining
59%
With Interview

Examiner Intelligence

Grants 45% of resolved cases
45%
Career Allowance Rate
309 granted / 680 resolved
-19.6% vs TC avg
Moderate +14% lift
Without
With
+13.5%
Interview Lift
resolved cases with interview
Typical timeline
3y 6m
Avg Prosecution
31 currently pending
Career history
717
Total Applications
across all art units

Statute-Specific Performance

§101
0.8%
-39.2% vs TC avg
§103
63.2%
+23.2% vs TC avg
§102
10.2%
-29.8% vs TC avg
§112
23.5%
-16.5% vs TC avg
Black line = Tech Center average estimate • Based on career data from 680 resolved cases

Office Action

§102 §103 §112
DETAILED ACTION Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Claim Rejections - 35 USC § 112 The following is a quotation of 35 U.S.C. 112(b): (b) CONCLUSION.—The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the inventor or a joint inventor regards as the invention. The following is a quotation of 35 U.S.C. 112 (pre-AIA ), second paragraph: The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the applicant regards as his invention. Claims 17 and 20 are rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, as being indefinite for failing to particularly point out and distinctly claim the subject matter which the inventor or a joint inventor (or for applications subject to pre-AIA 35 U.S.C. 112, the applicant), regards as the invention. Claim 17 recites “the first condition,” “the second condition,” “the third condition” and “the fourth condition.” There is insufficient antecedent basis for these limitations in the claim because claim 17 depends upon claim 15 and not claim 16 where the recitations are made. For purposes of examination, claim 17 will be interpreted as depending on claim 16. Appropriate correction is required. Claim 20 recites “the first condition,” “the second condition,” “the third condition” and “the fourth condition.” There is insufficient antecedent basis for these limitations in the claim because claim 20 depends upon claim 18 and not claim 19 where the recitations are made. For purposes of examination, claim 20 will be interpreted as depending on claim 19. Appropriate correction is required. Claim Rejections - 35 USC § 102 In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. The following is a quotation of the appropriate paragraphs of 35 U.S.C. 102 that form the basis for the rejections under this section made in this Office action: A person shall be entitled to a patent unless – (a)(1) the claimed invention was patented, described in a printed publication, or in public use, on sale, or otherwise available to the public before the effective filing date of the claimed invention. Claim(s) 1-3, 6-8, 12, 13 and 15-20 is/are rejected under 35 U.S.C. 102(a)(1) as being anticipat4ed by U.S. Patent App. Pub. No. 2020/0077863 to Huang et al. As to claims 1, 15 and 18, Huang discloses a control method for a cleaning robot comprising: receiving a weekly cleaning constraining condition input by a user, wherein the weekly cleaning constraining condition represents a condition to be satisfied when the cleaning robot cleans, in a pre-set period, one or more sub-zones of a plurality of sub-zones corresponding to a work zone included in a map of the work zone, wherein the pre-set period is an integer multiple of a week (see Huang paragraphs [0043], [0046]-[0049] disclosing receiving various weekly cleaning constraining condition inputs by the user within a pre-set period of one or more sub-zones of a plurality of sub-zones wherein the pre-set period can be an integer multiple of a week); determining weekly plan options that satisfy the weekly cleaning constraining condition and providing the weekly plan options to the user (see Huang paragraphs [0043]-[0049] where various cleaning schedules are created, compared and presented to the user for possible selection); obtaining a to-be-executed weekly plan option selected by the user from the weekly plan options (see, e.g., Huang paragraph [0046] where the user can select the desired cleaning election); and controlling the cleaning robot to execute a cleaning task in the pre-set period according to the to-be-executed weekly plan option (see Huang paragraph [0044] where the robot executes the cleaning mission according to the schedule). Regarding claim 15, Huang discloses that the control method can be performed by a control apparatus for a cleaning robot (see Huang paragraphs [0057]-[0059] disclosing one or more programmable processors executing one or more computer programs to perform the functions described of the cleaning robot). Regarding claim 18, Huang discloses a non-transitory computer-readable storage medium storing instructions, which when executed by a processor, cause the processor to perform a control method for a cleaning robot, the control method comprising the control method of claim 1 above (see Huang paragraphs [0057]-[0059]). As to claim 2, Huang discloses that the weekly cleaning constraining condition can include a first condition and/or a second condition wherein the first condition relates to a number of cleanings to be performed in the pre-set period and the second condition relates to an area to be cleaned in the pre-set period (see Huang paragraph [0048], [0053] disclosing number of cleaning passes can be set and paragraph [0050] where individual rooms can be selected). As to claim 3, Huang discloses that the weekly constraining condition can include a third condition wherein the third condition relates to a cleaning time in which the cleaning is to be performed in the pre-set period (see Huang paragraphs [0047]-[0049] where the day and time of the week can be set). As to claim 5, Huang discloses that the weekly cleaning constraining condition can include a fifth condition, wherein the fifth condition relates to a moving mode in the pre-set period (see Huang paragraph [0043] where cleaning parameters can include spot cleaning and edge cleaning). As to claim 6, Huang discloses that the plurality of sub-zones can be divided into a plurality of categories and wherein the first condition can be configured to specify a total number of cleanings to be performed in the pre-set period for a corresponding category of sub-zones and/or to specify a number of cleanings to be performed on each day of the pre-set period for a corresponding category of sub-zones (see Huang Fig. 8 and paragraph [0053] where the number of cleanings can be based on the size of the rooms or in places where deep cleaning is needed). As to claim 7, Huang discloses that the second condition can be configured to specify a first area that is a sum of areas of sub-zones of all categories in which cleanings are to be performed in the pre-set period and/or a second area that is a sum of areas of sub-zones of all categories in which cleanings are to be performed on a single day, wherein the first area is equal to a sum of products, wherein each product is a product of an area of each category of sub-zones and a number of cleanings to be performed in the pre-set period corresponding to each category of sub-zones and wherein the second area is equal to a sum of products, wherein each product is a product of an area of each category of sub-zones in which cleaning is to be performed on a single day and a number of cleanings to be performed on a single day for each corresponding category of sub-zones (see Huang paragraphs [0050] and [0053]-[0056] disclosing that the cleaning schedule (read as second condition) can be configured to specify specific rooms and the number of cleanings for each room (read as equal to a sum of products where each product is a product of an area of each category (i.e., each room) and a number of cleanings to be performed in each room). As to claim 8, Huang discloses that the third condition can be configured to specify a cleaning time of a pre-set day of the pre-set period being the shortest or a number of interval days between cleanings for a corresponding category or subzones (see Huang paragraphs [0047]-[0049] where a cleaning time of a pre-set day can be selected or specific days of the week can be selected). As to claim 10, Huang discloses that the moving mode can include at least one of an edge following mode (see Huang paragraph [0043] disclosing that the cleaning parameter can include edge cleaning). It is noted that the return-to-recharge mode is not a required moving mode since the claim recites “at least one of…”. As to claim 12, Huang discloses that the weekly plan options can change as the weekly cleaning constraining condition changes, and the control method further comprises in response to a change in the to-be-executed weekly plan option, controlling the cleaning robot to execute new cleaning task according to to-be-executed weekly plan option in the pre-set period (see Huang paragraphs [0046]-[0054] where the user can add and customize additional cleaning schedules). As to claim 13, Huang discloses that when there is a conflict between at least two conditions included in the weekly cleaning constraining condition, performing an error processing corresponding to the conflict (see Huang paragraph [0043]). As to claims 16 and 19, Huang discloses that the weekly cleaning constraining condition can include one or more of the following conditions: a first condition and/or a second condition wherein the first condition relates to a number of cleanings to be performed in the pre-set period and the second condition relates to an area to be cleaned in the pre-set period (see Huang paragraph [0048], [0053] disclosing number of cleaning passes can be set and paragraph [0050] where individual rooms can be selected); and/or a third condition wherein the third condition relates to a cleaning time in which the cleaning is to be performed in the pre-set period (see Huang paragraphs [0047]-[0049] where the day and time of the week can be set). As to claims 17 and 20, Huang discloses that the plurality of sub-zones can be divided into a plurality of categories and wherein the first condition can be configured to specify a total number of cleanings to be performed in the pre-set period for a corresponding category of sub-zones and/or to specify a number of cleanings to be performed on each day of the pre-set period for a corresponding category of sub-zones (see Huang Fig. 8 and paragraph [0053] where the number of cleanings can be based on the size of the rooms or in places where deep cleaning is needed). Huang also discloses that the second condition can be configured to specify a first area that is a sum of areas of sub-zones of all categories in which cleanings are to be performed in the pre-set period and/or a second area that is a sum of areas of sub-zones of all categories in which cleanings are to be performed on a single day, wherein the first area is equal to a sum of products, wherein each product is a product of an area of each category of sub-zones and a number of cleanings to be performed in the pre-set period corresponding to each category of sub-zones and wherein the second area is equal to a sum of products, wherein each product is a product of an area of each category of sub-zones in which cleaning is to be performed on a single day and a number of cleanings to be performed on a single day for each corresponding category of sub-zones (see Huang paragraphs [0050] and [0053]-[0056] disclosing that the cleaning schedule (read as second condition) can be configured to specify specific rooms and the number of cleanings for each room (read as equal to a sum of products where each product is a product of an area of each category (i.e., each room) and a number of cleanings to be performed in each room). Huang further discloses that the third condition can be configured to specify a cleaning time of a pre-set day of the pre-set period being the shortest or a number of interval days between cleanings for a corresponding category or subzones (see Huang paragraphs [0047]-[0049] where a cleaning time of a pre-set day can be selected or specific days of the week can be selected). It is noted that claims 16 and 19 disclose “one or more of the following conditions” and does not require all of the conditions. Claim Rejections - 35 USC § 103 In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. The factual inquiries for establishing a background for determining obviousness under 35 U.S.C. 103 are summarized as follows: 1. Determining the scope and contents of the prior art. 2. Ascertaining the differences between the prior art and the claims at issue. 3. Resolving the level of ordinary skill in the pertinent art. 4. Considering objective evidence present in the application indicating obviousness or nonobviousness. This application currently names joint inventors. In considering patentability of the claims the examiner presumes that the subject matter of the various claims was commonly owned as of the effective filing date of the claimed invention(s) absent any evidence to the contrary. Applicant is advised of the obligation under 37 CFR 1.56 to point out the inventor and effective filing dates of each claim that was not commonly owned as of the effective filing date of the later invention in order for the examiner to consider the applicability of 35 U.S.C. 102(b)(2)(C) for any potential 35 U.S.C. 102(a)(2) prior art against the later invention. Claim(s) 4, 9, 11 and 14 is/are rejected under 35 U.S.C. 103 as being unpatentable over U.S. Patent App. Pub. No. 2020/0077863 to Huang et al. as applied to claim 1 above, and further in view of U.S. Patent App. Pub. No. 2018/0074508 to Kleiner et al. Huang is relied upon as discussed above with respect to the rejection of claim 1. As to claims 4 and 9, Huang does not explicitly disclose that the weekly cleaning constraining condition also includes a fourth condition and wherein the fourth condition relates to a cleaning order in which cleanings are to be performed in the pre-set period and the fourth condition is configured to specify an order in which a plurality of sub-zones of a same category are to be cleaned and/or an order in which sub-zones of a plurality of categories are to be cleaned on the same day. Kleiner discloses a similar method wherein a specific order of subregions are to be cleaned on the same day (see Kleiner paragraphs [0151], [0162], [0195]). It would have been obvious to one of ordinary skill in the art at the time of filing to include a fourth condition relating to the cleaning order in which the cleanings are to be performed and on which days as disclosed by Kleiner as is known in the art and to optimize the cleaning schedule of the robot. As to claim 11, since Haung discloses that the robot controlled such that the cleaning task is executed at the scheduled pre-set time (see Huang paragraph [0044]), it is reasonably expected that the robot would be directly controlled to execute the cleaning task as scheduled. Furthermore, Kleiner discloses that it is known in the art to track the cleaning path of the robot such that the robot does not traverse a previously cleaned area (see Kleiner paragraph [0229]) and it would have been obvious to one of ordinary skill in the art at the time of filing to determine whether an area has already been cleaned as disclosed by Kleiner in order to optimize the cleaning path of the robot. As to claim 14, Huang does not explicitly disclose based on pre-set or user-set priorities of conditions included in the weekly cleaning constraining condition, determining the weekly plan options on an order from high priority to low priority. Kliner discloses a similar method wherein the user can set the order from high priority to low priority when determining the weekly plan options (see Kleiner paragraphs [0151], [0162], [0195]). It would have been obvious to one of ordinary skill in the art at the time of filing to include user-set priorities in determining the weekly plan options as disclosed by Kleiner in order to allow the user to optimize the cleaning as disclosed by Kleiner. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to DOUGLAS LEE whose telephone number is (571)270-3296. The examiner can normally be reached M-F 7:30-4:30pm. Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Kaj Olsen can be reached at 571-272-1344. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of published or unpublished applications may be obtained from Patent Center. Unpublished application information in Patent Center is available to registered users. To file and manage patent submissions in Patent Center, visit: https://patentcenter.uspto.gov. Visit https://www.uspto.gov/patents/apply/patent-center for more information about Patent Center and https://www.uspto.gov/patents/docx for information about filing in DOCX format. For additional questions, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /DOUGLAS LEE/Primary Examiner, Art Unit 1714
Read full office action

Prosecution Timeline

Mar 05, 2025
Application Filed
Oct 29, 2026
Non-Final Rejection mailed — §102, §103, §112 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12778339
SYSTEM FOR CLEANING MILK DUCTS FOR A MACHINE FOR PREPARING BEVERAGES
3y 1m to grant Granted Nov 03, 2026
Patent 12779856
RECORDING APPARATUS AND CLEANING METHOD OF RECORDING APPARATUS
2y 6m to grant Granted Nov 03, 2026
Patent 12778369
CLEANER SYSTEM AND CONTROL METHOD THEREFOR
2y 7m to grant Granted Nov 03, 2026
Patent 12773087
Home Appliance
2y 11m to grant Granted Oct 27, 2026
Patent 12766775
Systems and Methods of Cleaning Extruders
2y 9m to grant Granted Oct 20, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

1-2
Expected OA Rounds
45%
Grant Probability
59%
With Interview (+13.5%)
3y 6m (~1y 10m remaining)
Median Time to Grant
Low
PTA Risk
Based on 680 resolved cases by this examiner. Grant probability derived from career allowance rate.

Sign in with your work email

Enter your email to receive a magic link. No password needed.

Personal email addresses (Gmail, Yahoo, etc.) are not accepted.

Free tier: 3 strategy analyses per month