Prosecution Insights
Last updated: April 19, 2026
Application No. 17/751,587

Work Method, Work Vehicle and Work System

Non-Final OA §103
Filed
May 23, 2022
Examiner
BEAN, JARED C
Art Unit
3669
Tech Center
3600 — Transportation & Electronic Commerce
Assignee
Yanmar Holdings Co. Ltd.
OA Round
3 (Non-Final)
63%
Grant Probability
Moderate
3-4
OA Rounds
2y 12m
To Grant
99%
With Interview

Examiner Intelligence

Grants 63% of resolved cases
63%
Career Allow Rate
74 granted / 118 resolved
+10.7% vs TC avg
Strong +39% interview lift
Without
With
+38.7%
Interview Lift
resolved cases with interview
Typical timeline
2y 12m
Avg Prosecution
33 currently pending
Career history
151
Total Applications
across all art units

Statute-Specific Performance

§101
15.9%
-24.1% vs TC avg
§103
61.4%
+21.4% vs TC avg
§102
11.6%
-28.4% vs TC avg
§112
7.7%
-32.3% vs TC avg
Black line = Tech Center average estimate • Based on career data from 118 resolved cases

Office Action

§103
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 . Status of Claims This non-final action is in response to Applicant’s appealed filing of 10/26/2025. Claims 1-8 and 10-12 are currently pending and have been examined. Response to Appeal Brief In view of the appeal brief filed on 10/26/2025, PROSECUTION IS HEREBY REOPENED. A new ground of rejection is set forth below. To avoid abandonment of the application, appellant must exercise one of the following two options: (1) file a reply under 37 CFR 1.111 (if this Office action is non-final) or a reply under 37 CFR 1.113 (if this Office action is final); or, (2) initiate a new appeal by filing a notice of appeal under 37 CFR 41.31 followed by an appeal brief under 37 CFR 41.37. The previously paid notice of appeal fee and appeal brief fee can be applied to the new appeal. If, however, the appeal fees set forth in 37 CFR 41.20 have been increased since they were previously paid, then appellant must pay the difference between the increased fees and the amount previously paid. A Supervisory Patent Examiner (SPE) has approved of reopening prosecution by signing below: Response to Arguments Applicant’s arguments with respect to claims 1-8 and 10-12, rejected under 35 USC § 103, filed in the appeal brief on 10/26/2025, have been considered but are moot because the new ground of rejection does not rely on any reference applied in the prior rejection of record for any teaching or matter specifically challenged in the argument. 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. Claims 1-4, 6-8, and 11-12 are rejected under 35 U.S.C. 103 as being unpatentable over Diekhans et al. (US 20070233348 A1; reference incorporated from ruling found in European Search Opinion filed 10/27/2022 regarding family application EP 22174863) in view of Takeda et al. (US 20200128726 A1). Regarding claim 1, Diekhans discloses a work method (see at least abstract) comprising: driving a plurality of work vehicles including at least one automatic traveling work vehicle to automatically travel on a travel path created in a farm field (see at least abstract and ¶ [0005] disclosing controlling several combine harvesters capable of GPS-assisted automatic driving and steering); dividing by an allocating process that divides a work area of the farm field into a plurality of work blocks based on each of the work vehicles, and that allocates any of the plurality of work vehicles to each of the work blocks (see at least ¶ [0052-0055] and Figs. 2-3 disclosing each combine harvester being assigned to different crop beds that subdivide a field); and working the plurality of work vehicles by a working process to work on the plurality of work blocks (see at least abstract and ¶ [0038] and [0041] disclosing a driving control unit working in tandem with a route planning system to make the combine harvester follow a reference line), wherein a shape of the plurality of work blocks dividing the work area is selectable by the allocating process (see at least ¶ [0052-0053] and Figs. 3-4 disclosing using reference lines to select and subdivide a polygonal field into different sized subregions). While Diekhans discloses communication through mobile wireless means (see at least ¶ [0029]), it does not explicitly disclose dividing by and allocation process and transmitting through a portable terminal. However, Takeda teaches a mobile terminal management computer for setting, dividing, and allocating a field map into a plurality of areas corresponding to growth, yield, crops, and/or soil data (see at least ¶ [0033], [0041], [0050-0055], [0064-0069], [0079], and [0083-0086]). It would be obvious to one of ordinary skill in the art before the effective filing date of the present invention to incorporate the mobile terminal of Takeda into the work allocation system of Diekhans with a reasonable expectation of success because both inventions are directed toward dividing area and information of an agricultural area worked by a combine harvester. Takeda demonstrates that it is known in the art to divide area and information of an agricultural area through a mobile terminal to inform and direct future combine harvester operations, and would be obvious to one of ordinary skill in the art to use and provide ease of access to direct the combines. Regarding claim 2, Diekhans discloses the allocating process, based on a work width of each of the work vehicles, divides the work area into the plurality of work blocks, and allocates the work vehicles to the work blocks (see at least ¶ [0052-0055] and Figs. 2-3 disclosing each combine harvester being assigned to different crop beds that subdivide a field based on the working width of the combine harvester). Regarding claim 3, Diekhans discloses when the respective work vehicles are different in work width, the allocating process divides the work area into the work blocks of different sizes, and allocates the work vehicles' work vehicle, that has a larger work width, to a larger work block of the work blocks (see at least ¶ [0052-0055] and Figs. 2-3 disclosing each combine harvester being assigned to different crop beds of different sizes based on the working width of the combine harvester). Regarding claim 4, Diekhans discloses the plurality of work vehicles is a plurality of combine harvesters (see at least ¶ [0036] disclosing the machine systems are combine harvesters), and when the respective combine harvesters are different in the number of harvestable strips constituting the work widths, the allocating process divides the work area into the work blocks of different sizes, and allocates the combine harvesters' combine harvester, that has a larger number of harvestable strips, to the larger work block (see at least ¶ [0052-0055] and Figs. 2-3 disclosing each combine harvester being assigned to different crop beds of different sizes based on the working width of the combine harvester, with smaller harvesters working smaller beds). Regarding claim 6, Diekhans discloses the plurality of work vehicles is a plurality of combine harvesters (see at least ¶ [0036] disclosing the machine systems are combine harvesters), and the allocating process divides the work area into a plurality of work blocks by performing, by the combine harvesters' combine harvester as the automatic traveling work vehicle, a section harvesting traveling to sectionalize the plurality of work blocks, and thereafter allocates any of the plurality of the combine harvesters to each of the work blocks (see at least ¶ [0017-0020] disclosing the field is divided into individual crop beds by reference lines that a combine harvester travels to create the subregions and harvest an allocated bed). Regarding claim 7, Diekhans discloses the allocating process divides the work area into a plurality of the work blocks so that the section harvesting traveling from one end side to another end side in a direction of intersecting with a strip direction of the farm field, and allocates the combine harvester as the automatic traveling work vehicle to the work blocks' work block on the other end side (see at least ¶ [0017-0020] and Figs. 2-5 disclosing the field is divided into individual crop beds by reference lines that a combine harvester travels to create the subregions and harvest an allocated bed, with reference lines and paths traveling across from one end of the field to the other), and the working process performs work from the work block on the other end side by the combine harvester as the automatic traveling work vehicle (see at least ¶ [0017-0020] and Figs. 2-5 disclosing the combine harvesters harvest their assigned beds by following reference lines and paths that travel across from one end of the field to the other). Regarding claim 8, Diekhans discloses which of the plurality of work vehicles is to be allocated to each of the work blocks is selectable by the allocating process (see at least ¶ [0052-0055] and Figs. 2-3 disclosing each combine harvester being assigned to different crop beds that subdivide a field). Regarding claim 11, Diekhans discloses a work system (see at least abstract) comprising: a work vehicle that automatically travels based on a travel path created in a farm field (see at least abstract and ¶ [0005] disclosing controlling several combine harvesters capable of GPS-assisted automatic driving and steering), and a work allocator that divides a work area of the farm field into a plurality of work blocks based on a plurality of work vehicles including the work vehicle and another work vehicle, and that allocates any of the plurality of work vehicles to each of the work blocks (see at least ¶ [0038], [0041], and [0052-0055] and Figs. 2-3 disclosing each combine harvester possessing a route planner that plots reference lines to follow that assign each combine harvester to different crop beds that subdivide a field), wherein the work vehicle includes a self-driving controller that performs work on the work block allocated to the work vehicle (see at least abstract and ¶ [0038] and [0041] disclosing a driving control unit working in tandem with a route planning system to make the combine harvester follow a reference line), and a shape of the plurality of work blocks dividing the work area is selectable by the allocating process (see at least ¶ [0052-0053] and Figs. 3-4 disclosing using reference lines to select and subdivide a polygonal field into different sized subregions). While Diekhans discloses communication through mobile wireless means (see at least ¶ [0029]), it does not explicitly disclose dividing by and allocation process and transmitting through a portable terminal. However, Takeda teaches a mobile terminal management computer for setting, dividing, and allocating a field map into a plurality of areas corresponding to growth, yield, crops, and/or soil data (see at least ¶ [0033], [0041], [0050-0055], [0064-0069], [0079], and [0083-0086]). It would be obvious to one of ordinary skill in the art before the effective filing date of the present invention to incorporate the mobile terminal of Takeda into the work allocation system of Diekhans with a reasonable expectation of success because both inventions are directed toward dividing area and information of an agricultural area worked by a combine harvester. Takeda demonstrates that it is known in the art to divide area and information of an agricultural area through a mobile terminal to inform and direct future combine harvester operations, and would be obvious to one of ordinary skill in the art to use and provide ease of access to direct the combines. Regarding claim 12, Diekhans discloses a work system comprising: a plurality of work vehicles including at least one automatic traveling work vehicle that automatically travel based on a travel path created in a farm field (see at least abstract and ¶ [0005] disclosing controlling several combine harvesters capable of GPS-assisted automatic driving and steering); a work allocator that divides a work area of the farm field into a plurality of work blocks based on each of the work vehicles, and that allocates any of the plurality of work vehicles to each of the work blocks (see at least ¶ [0038], [0041], and [0052-0055] and Figs. 2-3 disclosing each combine harvester possessing a route planner that plots reference lines to follow that assign each combine harvester to different crop beds that subdivide a field), wherein the plurality of work vehicles perform a work of the respectively allocated work blocks (see at least abstract and ¶ [0038] and [0041] disclosing a driving control unit working in tandem with a route planning system to make the combine harvester follow a reference line), and a shape of the plurality of work blocks dividing the work area is selectable by the allocating process (see at least ¶ [0052-0053] and Figs. 3-4 disclosing using reference lines to select and subdivide a polygonal field into different sized subregions). While Diekhans discloses communication through mobile wireless means (see at least ¶ [0029]), it does not explicitly disclose dividing by and allocation process and transmitting through a portable terminal. However, Takeda teaches a mobile terminal management computer for setting, dividing, and allocating a field map into a plurality of areas corresponding to growth, yield, crops, and/or soil data (see at least ¶ [0033], [0041], [0050-0055], [0064-0069], [0079], and [0083-0086]). It would be obvious to one of ordinary skill in the art before the effective filing date of the present invention to incorporate the mobile terminal of Takeda into the work allocation system of Diekhans with a reasonable expectation of success because both inventions are directed toward dividing area and information of an agricultural area worked by a combine harvester. Takeda demonstrates that it is known in the art to divide area and information of an agricultural area through a mobile terminal to inform and direct future combine harvester operations, and would be obvious to one of ordinary skill in the art to use and provide ease of access to direct the combines. Claims 5 and 10 are rejected under 35 U.S.C. 103 as being unpatentable over Diekhans et al. and Takeda et al., as applied to claim 1 above, and in view of Turpin et al. (US 20170280614 A1; reference incorporated from ruling found in European Search Opinion filed 10/27/2022 regarding family application EP 22174863). Regarding claim 5, Diekhans discloses the plurality of work vehicles is a plurality of combine harvesters (see at least ¶ [0036] disclosing the machine systems are combine harvesters). The combination of Diekhans and Takeda does not disclose when the combine harvesters are different in available capacity of a reservoir for reserving a grain harvested by each of the combine harvesters, the allocating process, based on the available capacity of the reservoir of each of the combine harvesters, divides the work area into the plurality of work blocks and allocates the combine harvesters to the work blocks. However, Turpin suggests when the combine harvesters are different in available capacity of a reservoir for reserving a grain harvested by each of the combine harvesters, the allocating process, based on the available capacity of the reservoir of each of the combine harvesters, divides the work area into the plurality of work blocks and allocates the combine harvesters to the work blocks (see at least claims 4 and 14 disclosing assignment of each of agricultural machines is according to at least one of the individual capacities of the agricultural machines). It would be obvious to one of ordinary skill in the art before the effective filing date of the present invention to incorporate capacity considerations of Turpin into the combination of Diekhans and Takeda with a reasonable expectation of success because all inventions are directed toward the operation of combine harvesters operating simultaneously in designated sections of a field. Turpin demonstrates that it would be obvious to assign a combine harvester to a crop bed while considering its capacity. Regarding claim 10, the combination of Diekhans and Takeda does not disclose the allocating process sets a transfer path for transferring between the work blocks, on one side of the farm field in a strip direction. However, Turpin suggests the allocating process sets a transfer path for transferring between the work blocks, on one side of the farm field in a strip direction (see at least ¶ [0021] and Fig. 1 disclosing haul vehicles and/or chaser carts traveling along harvested swaths and headlands around a field perimeter to travel between combines working in unharvested swaths). It would be obvious to one of ordinary skill in the art before the effective filing date of the present invention to incorporate the transitional tracts of Turpin into the combination of Diekhans and Takeda with a reasonable expectation of success because both inventions are directed toward the operation of combine harvesters operating simultaneously in designated sections of a field. This would allow companion and/or support vehicles to travel between individual beds or even other fields without interfering with the operations of the combine harvesters. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to JARED C BEAN whose telephone number is (571)272-5255. The examiner can normally be reached 7:30AM - 5:00PM. 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, Navid Z Mehdizadeh can be reached at (571) 272-7691. 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. /J.C.B./Examiner, Art Unit 3669 /NAVID Z. MEHDIZADEH/Supervisory Patent Examiner, Art Unit 3669
Read full office action

Prosecution Timeline

May 23, 2022
Application Filed
Dec 18, 2024
Non-Final Rejection — §103
Mar 24, 2025
Response Filed
May 16, 2025
Final Rejection — §103
Aug 26, 2025
Response after Non-Final Action
Aug 26, 2025
Notice of Allowance
Sep 18, 2025
Response after Non-Final Action
Oct 26, 2025
Response after Non-Final Action
Nov 12, 2025
Response after Non-Final Action
Dec 09, 2025
Non-Final Rejection — §103
Feb 27, 2026
Interview Requested
Feb 28, 2026
Interview Requested
Mar 05, 2026
Applicant Interview (Telephonic)
Mar 05, 2026
Examiner Interview Summary
Apr 07, 2026
Interview Requested
Apr 15, 2026
Applicant Interview (Telephonic)
Apr 15, 2026
Examiner Interview Summary

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12589898
STEERABLE DEPENDENT VEHICLE FOR UNMANNED AERIAL VEHICLES
2y 5m to grant Granted Mar 31, 2026
Patent 12585269
FLEET MIGRATION MANAGEMENT SYSTEMS AND METHODS
2y 5m to grant Granted Mar 24, 2026
Patent 12552559
ANTENNA MEASUREMENT USING UNMANNED AERIAL VEHICLES
2y 5m to grant Granted Feb 17, 2026
Patent 12530035
TRAVEL CONTROL SYSTEM, CONTROL METHOD, AND CONTROL DEVICE
2y 5m to grant Granted Jan 20, 2026
Patent 12495734
THREE DIMENSIONAL GRID MAP FOR CROSS MEMBER LOCATION AND AVOIDANCE DURING AN UNLOADING OPERATION
2y 5m to grant Granted Dec 16, 2025
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

3-4
Expected OA Rounds
63%
Grant Probability
99%
With Interview (+38.7%)
2y 12m
Median Time to Grant
High
PTA Risk
Based on 118 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