Prosecution Insights
Last updated: April 19, 2026
Application No. 19/310,282

Semantic Robotic Device System

Non-Final OA §DP
Filed
Aug 26, 2025
Examiner
MARC, MCDIEUNEL
Art Unit
3656
Tech Center
3600 — Transportation & Electronic Commerce
Assignee
Lucomm Technologies Inc.
OA Round
1 (Non-Final)
91%
Grant Probability
Favorable
1-2
OA Rounds
2y 1m
To Grant
98%
With Interview

Examiner Intelligence

Grants 91% — above average
91%
Career Allow Rate
1187 granted / 1305 resolved
+39.0% vs TC avg
Moderate +7% lift
Without
With
+7.4%
Interview Lift
resolved cases with interview
Fast prosecutor
2y 1m
Avg Prosecution
21 currently pending
Career history
1326
Total Applications
across all art units

Statute-Specific Performance

§101
15.6%
-24.4% vs TC avg
§103
35.1%
-4.9% vs TC avg
§102
5.7%
-34.3% vs TC avg
§112
8.5%
-31.5% vs TC avg
Black line = Tech Center average estimate • Based on career data from 1305 resolved cases

Office Action

§DP
DETAILED ACTION Claims 1-30 are pending. 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 . Priority Acknowledgment is made of applicant’s claim for priority of U.S provisional application under 35 U.S.C. 119(e). Acknowledgment is made of the claim for priority or continuation and divisional applications under 35 U.S.C. 120. Double Patenting The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the claims at issue are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); and In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969). A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on a nonstatutory double patenting ground provided the reference application or patent either is shown to be commonly owned with this application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b). The USPTO internet Web site contains terminal disclaimer forms which may be used. Please visit http://www.uspto.gov/forms/. The filing date of the application will determine what form should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to http://www.uspto.gov/patents/process/file/efs/guidance/eTD-info-I.jsp. Claims 1-30 are provisionally rejected on the ground of non-statutory obviousness-type double patenting as being unpatentable over claims 1-30 of copending Application No. 19/362,183. Although the conflicting claims are not identical, they are not patentably distinct from each other because removing inherent and/or unnecessary limitations/step or adding an element and its function would be within the level of one of ordinary skill in the art. It is well settled that the adding or deleting an element and its function in the present Application such as “semantic” and its function are an obvious expedient if the remaining elements perform the same function as before. In re Karlson, 136 USPQ 184 (CCPA 1963). Also note Ex parte Rainu, 168 USPQ 375 (Bd. App. 1969). Omission of a reference element or step whose function is not needed would be obvious to one of ordinary skill in the art. Application No. 19/310,282 Application No. 19/362,183 1. A semantic robotic device system, comprising: a processor, a memory and at least one transceiver; the memory storing a plurality of semantics; the memory further storing at least one affirmative semantic and at least one non-affirmative semantic associated with at least one semantic goal; the processor being configured to: infer a first semantic and a second semantic among the plurality of semantics based on data received via the at least one transceiver; infer a first determination that the first inferred semantic is non-affirmative by having a high entropy with respect to the at least one affirmative semantic at a first time and further infer a second determination that the second inferred semantic is affirmative by semantically matching the second inferred semantic with the at least one affirmative semantic at a second time; infer one or more subsequent semantics after the first time, and further to infer a third semantic among the plurality of semantics, the third semantic being inferred to cause a reduction in the entropy between the one or more subsequent semantics and the at least one affirmative semantic; generate thin client presentation data in rapport with the at least one semantic goal based on the third semantic and the one or more subsequent inferred semantics; and cause the at least one transceiver to transmit the thin client presentation data to a remote device. 1. A method for operating a semantic system having a processor, a memory and at least one transceiver, the method comprising: storing a plurality of semantics in the memory; storing a plurality of endpoints in the memory; each of the endpoints being associated with at least one semantic among the plurality of semantics; storing at least one semantic goal in the memory; configuring the processor to: infer a first semantic group comprising a first subset of endpoints among the plurality of endpoints, the first semantic group being inferred based on a determination of an affirmative semantic resonance between each member of the first semantic group and the at least one semantic goal; infer a second semantic group comprising a second subset of endpoints among the plurality of endpoints, the second semantic group being inferred based on a non-affirmative semantic resonance between each member of the second semantic group and the at least one semantic goal; generate representation data of the first semantic group and the second semantic group; and cause the at least one transceiver to transmit the representation data to a remote device. 11. A semantic robotic device system, comprising: a processor, a memory and at least one transceiver; the memory storing a plurality of semantics; the memory storing a user interface control semantic; the memory storing at least one affirmative semantic and at least one non-affirmative semantic associated with at least one semantic goal; the processor being configured to: infer a first semantic and a second semantic among the plurality of semantics based on data received via the at least one transceiver; infer a first determination that the first inferred semantic is non-affirmative by having a high entropy with respect to the at least one affirmative semantic at a first time and further infer a second determination that the second inferred semantic is affirmative by semantically matching the second inferred semantic with the at least one affirmative semantic at a second time; infer one or more subsequent semantics after the first time, and further to infer a third semantic among the plurality of semantics, the third semantic being inferred to cause are duction in the entropy between the one or more subsequent semantics and the at least one affirmative semantic; arrange thin client presentation data associated with the third semantic and the one or more inferred subsequent semantics for display in the user interface control; and cause the at least one transceiver to transmit the thin client presentation data to a remote device. 11. A method for operating a semantic system having a processor and a memory, the method comprising: storing a plurality of semantics in the memory; storing a plurality of endpoints in the memory; each endpoint from among the plurality of endpoints being associated with at least one semantic among the plurality of semantics; storing at least one semantic goal in the memory; configuring the processor to: infer a first semantic group comprising a first subset of endpoints among the plurality of endpoints, the first semantic group being inferred via a semantic analysis which applies a semantic drift to determine affirmative semantic resonance between each member of the first semantic group and the at least one semantic goal; infer a second semantic group comprising a second subset of endpoints among the plurality of endpoints, the second semantic group being inferred via a semantic analysis which applies a high entropy semantic drift to determining a non-affirmative semantic resonance between each member of the second semantic group and the at least one semantic goal; select at least one user interface control based on a first semantic from among the plurality of semantics, the first semantic being associated with the first semantic group; and send data associated with the first semantic group to the at least one user interface control. 20. A semantic robotic device system, comprising: a processor, a memory and at least one transceiver; the memory storing a plurality of semantics; the memory further storing at least one affirmative semantic and at least one non-affirmative semantic associated with at least one semantic goal; the processor being configured to: infer a first semantic and a second semantic among the plurality of semantics based on data received via the at least one transceiver; infer a first determination that the first inferred semantic is affirmative by semantically matching the first inferred semantic with the at least one affirmative semantic at a first time and further based on a determination that the second inferred semantic is non- affirmative by semantically matching the second inferred semantic with the at least one non-affirmative semantic at a second time; infer one or more subsequent semantics after the first time, and further to infer a third semantic among the plurality of semantics, the third semantic being inferred to cause a reduction in the entropy between the one or more subsequent semantics and the at least one affirmative semantic; generate thin client presentation data in rapport with the at least one semantic goal based on the inferred first determination, the second inferred determination and the third semantic; and cause the at least one transceiver to transmit the thin client presentation data to a remote device. 21. A method for operating a semantic system having a processor and a memory, the method comprising: storing a plurality of semantics in the memory; storing a plurality of endpoints in the memory; each endpoint from among the plurality of endpoints being associated with at least one semantic among the plurality of semantics; storing at least one semantic goal in the memory; configuring the processor to: infer a first semantic group comprising a first subset of endpoints among the plurality of endpoints, the first semantic group being inferred based on a semantic analysis which applies a semantic drift to determine affirmative semantic resonance between each member of the first semantic group and the at least one semantic goal; infer a second semantic group comprising a second subset of endpoints among the plurality of endpoints, the second semantic group being inferred based on a semantic analysis which applies a high entropy semantic drift to determining a non-affirmative semantic resonance between each member of the second semantic group and the at least one semantic goal; select at least one user interface control based on a first semantic from among the plurality of semantics, the first semantic being associated with the second semantic group; and generate presentation data associated with the second semantic group for displaying in the at least one user interface control. 27. A semantic robotic device system, comprising: a processor, a memory and at least one transceiver; the memory storing a plurality of semantics; the memory storing a user interface control; the memory storing at least one affirmative semantic and at least one non-affirmative semantic associated with at least one semantic goal; the processor being configured to: infer a first semantic and a second semantic among the plurality of semantics; infer a first determination that the first inferred semantic is affirmative by semantically matching the first inferred semantic with the at least one affirmative semantic at a first time and further based on a determination that the second inferred semantic is non- affirmative by semantically matching the second inferred semantic with the at least one non-affirmative semantic at a second time; infer one or more subsequent semantics after the first time, and further to infer a third semantic among the plurality of semantics, the third semantic being inferred to cause a reduction in the entropy between the one or more subsequent semantics and the at least one affirmative semantic; and cause the at least one transceiver to transmit to a remote device generated thin client presentation data associated with the third semantic and the one or more subsequent inferred semantics arranged to be displayed in the at least one user interface control. 28. A method for operating a semantic system having a processor, a memory and at least one transceiver, the method comprising: storing a plurality of semantics in the memory; storing a plurality of endpoints in the memory; each endpoint from among the plurality of endpoints being associated with at least one semantic among the plurality of semantics; configuring the processor to: infer at least one semantic goal indicative of at least one intrinsic purpose for the plurality of endpoints and store the inferred at least one semantic goal in the memory; infer a semantic group comprising a subset of endpoints among the plurality of endpoints, the semantic group being inferred based on a non-affirmative semantic resonance between each member of the semantic group and the inferred at least one semantic goal; generate representation data of the semantic group; and cause the at least one transceiver to transmit the representation data to a remote device. This is a provisional obviousness-type double patenting rejection because the conflicting claims have not in fact been patented. Hence, it is obvious that the claimed combination or the narrower claims of the patent would encompass the broader claimed combination of the claims of the instant application. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to MCDIEUNEL MARC whose telephone number is (571) 272-6964. The examiner can normally be reached on Work 9:00 AM to 7:30. If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, WADE MILES can be reached on (571) 270-7777. The fax phone number for the organization where this application or proceeding is assigned is (571)-273-3976. Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see http://pair-direct.uspto.gov. Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative or access to the automated information system, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. PNG media_image1.png 275 275 media_image1.png Greyscale /McDieunel Marc/ Primary Examiner, Art Unit 3665
Read full office action

Prosecution Timeline

Aug 26, 2025
Application Filed
Mar 16, 2026
Non-Final Rejection — §DP (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12600043
Robot for Assisting With and Performing Household Chores
2y 5m to grant Granted Apr 14, 2026
Patent 12596011
METHOD FOR PRESENTING ROADING CONDITIONS, ROAD CONDITION PROCESSING, APPARATUSES, AND COMPUTER DEVICE
2y 5m to grant Granted Apr 07, 2026
Patent 12589485
TEACHING POINT GENERATION DEVICE THAT GENERATES TEACHING POINTS ON BASIS OF OUTPUT OF SENSOR, AND TEACHING POINT GENERATION METHOD
2y 5m to grant Granted Mar 31, 2026
Patent 12582039
SYSTEMS AND METHODS FOR INITIAL HARVEST PATH PREDICTION AND CONTROL
2y 5m to grant Granted Mar 24, 2026
Patent 12576515
OFF-LINE LEARNING FOR ROBOT CONTROL USING A REWARD PREDICTION MODEL
2y 5m to grant Granted Mar 17, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

AI Strategy Recommendation

Get an AI-powered prosecution strategy using examiner precedents, rejection analysis, and claim mapping.
Powered by AI — typically takes 5-10 seconds

Prosecution Projections

1-2
Expected OA Rounds
91%
Grant Probability
98%
With Interview (+7.4%)
2y 1m
Median Time to Grant
Low
PTA Risk
Based on 1305 resolved cases by this examiner. Grant probability derived from career allow 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