Prosecution Insights
Last updated: April 19, 2026
Application No. 18/681,976

COORDINATED AND OPTIMIZED DISPATCHING METHOD FOR ELECTRIC BUSES

Non-Final OA §101
Filed
Feb 07, 2024
Examiner
LABOGIN, DORETHEA L
Art Unit
3624
Tech Center
3600 — Transportation & Electronic Commerce
Assignee
Nanjing University Of Science And Technology
OA Round
3 (Non-Final)
14%
Grant Probability
At Risk
3-4
OA Rounds
3y 11m
To Grant
30%
With Interview

Examiner Intelligence

Grants only 14% of cases
14%
Career Allow Rate
24 granted / 172 resolved
-38.0% vs TC avg
Strong +16% interview lift
Without
With
+16.2%
Interview Lift
resolved cases with interview
Typical timeline
3y 11m
Avg Prosecution
36 currently pending
Career history
208
Total Applications
across all art units

Statute-Specific Performance

§101
41.2%
+1.2% vs TC avg
§103
39.3%
-0.7% vs TC avg
§102
13.0%
-27.0% vs TC avg
§112
5.7%
-34.3% vs TC avg
Black line = Tech Center average estimate • Based on career data from 172 resolved cases

Office Action

§101
DETAILED ACTION Status of the Application This Office Action is in response to Application Serial 18/681,976. In response to Examiner’s action mail dated October 01, 2025, Applicant submitted amendments and arguments. Applicant amended claim 1 and claim 7. Applicant cancelled claims 13-19. Applicant previously cancelled claims 8-12. Claims 1-7 are pending in this application. 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 . 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. Continued Examination Under 37 CFR 1.114 A request for continued examination under 37 CFR 1.114, including the fee set forth in 37 CFR 1.17(e), was filed in this application after final rejection. Since this application is eligible for continued examination under 37 CFR 1.114, and the fee set forth in 37 CFR 1.17(e) has been timely paid, the finality of the previous Office action has been withdrawn pursuant to 37 CFR 1.114. Applicant's submission filed on December 30,2025 has been entered. Information Disclosure Statement Applicant did not submit an Information Disclosure Statement for consideration. Response to Arguments Applicant's arguments filed December 1, 2025 have been fully considered but they are not persuasive. Applicant’s arguments are moot in view of the revised rejections. Applicant’s arguments will be address herein below. Response to Claim Rejections- 35 U.S.C. 101 On pages 8-10 of the Applicant’s 35 U.S.C. 101 arguments, the Applicant submits, the newly amended claim 1 and claim 7 meet the patent eligibility requirements. Applicant argues: Applicant disagrees with Applicant’s determination of the claims recite mathematical concepts. Applicant amended the claims to: minimize service time of all buses and an operational energy consumption cost and regulate a number of departures in a peak period to reduce a total waiting of a passenger. Applicant present disclosure solves the problem of mismatching between dynamic passenger flows and bus transport capacity, enables the dispatching strategy to be closer to an actual passenger flow situation and have better actual benefits, and has wide use prospects in urban bus line networks. Applicant submits the method claimed in the amended claim 1 has incorporated the abstract idea into the practical application for dispatching the electric buses in a road network based on an output result of the computer model, and Applicant respectfully requests reconsideration and withdrawl of the rejection under 35 U.S.C. 101 of amended independent claims 1 and dependent claim 2-7. Examiner submits, the Applicant’s claims recite variables and mathematical equations including a bi-level programming model, and therefore, the claims recite a mathematical concept and therefore are a directed to a judicial exception. Since the claims recite limitations that are grouped as a mathematical concept the claims are directed to a judicial exception. The claims recite an improvement to the data variables (e.g., bus departure, passenger flow). Although the claims recite bi-level programming model is solved according to a genetic algorithm to acquire an optimal bus dispatching plan, the genetic algorithm that is an optimization technique, is recited as a mathematical algorithm. The Applicant’s claims do not recite additional elements, so the judicial exception is not integrated into a practical application. Therefore, the Subject Matter Eligibility analysis stops at Step 2A. Response to Amendment Claims 1-7 stand pending in this application. Applicant amended claim 1. Cancelled claims 13-19 & 8-12. Regarding the 35 U.S.C. 101, the pending claims have been fully considered. The Applicant’s arguments are not persuasive. A flow chart of the Subject Matter Eligibility Test for Products and Processes is provided below for reference. See MPEP 2106. PNG media_image1.png 901 652 media_image1.png Greyscale Regarding prior art, Examiner completed a prior art search particularly for the limitations in amended claim 1 and claim 7. Examiner considered the combination of Lou, Fu, Zheng, Ming, Wang and Liu are before the effective filing date; however, the specific ordered combined sequence of mathematical equations and variables used in the Applicant’s application cannot be found in the cited prior art and can only be found as recited in Applicant’s Specification. Any combination of the cited references and/or additional references(s) to teach all the claim elements, including the features identified by Applicant that are not taught by the cited prior art, would be the result of impermissible hindsight reconstruction. Accordingly, any combination of Lou, Fu, Zheng, Ming, Wang and Liu and/or any other additional reference(s) would be improper to teach the claimed invention. The claims 1-7 are allowable. Claim Rejections - 35 USC § 101 35 U.S.C. 101 reads as follows: Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title. Claims 1-7 are process. Claims 1-7 are rejected under 35 U.S.C. 101 because the claimed invention is directed to an abstract idea without significantly more. The claim 1 recites: PNG media_image2.png 837 760 media_image2.png Greyscale PNG media_image3.png 855 761 media_image3.png Greyscale PNG media_image4.png 506 732 media_image4.png Greyscale These claims recite mathematical equations. The pending claims are mathematical concepts, and therefore, are directed to a judicial exception at step 2A prong one. The claims do NOT recite additional elements. Therefore, the judicial exception is/are not integrated into a practical application under the second prong of Step 2A. Step 2B analysis is not required. Dependent claims 2 -7 further narrow the abstract idea of independent claim 1. The claims 1-7 are not patent eligible. Since there are no limitations in these claims that transform the exception into a patent eligible application such that these claims amount to significantly more than the exception itself, claims 1-7 are rejected under 35 U.S.C. 101 as being directed to non-statutory subject matter. Conclusion The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. Lou (CN 110119835A) discloses dynamic bus departure scheduling optimization and models’ flexibility to obtain the passenger total waiting time. Fu (US 11615368 B) considers vehicle energy consumption and route assignments. Zheng (CN 104504229 A) discloses intelligent bus dispatching method based on mixed heuristic algorithm and passenger wait and passenger get off. Wei (2017, Bilevel programming model for multi-model regional bus timetable and vehicle dispatch). Chen (CN 113743685 B) discloses travel time, traffic, bus departure, bus capacity, and travel route. Wang (CN 114036749 B) discloses genetic algorithms, demand orders e.g., taxi scheduling, and electric consumption. Liu (CN 111754039 A) discloses the number of times of transportation service that can be executed after the first time of charging or finishing charging for the operation bus, average departure frequency, passenger flow, total operations cost. Any inquiry concerning this communication or earlier communications from the examiner should be directed to THEA LABOGIN whose telephone number is (571)272-9149. The examiner can normally be reached Monday -Friday, 8am-5pm. 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, Patricia Munson can be reached at 571-270- 5396. 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. /THEA LABOGIN/Examiner, Art Unit 3624
Read full office action

Prosecution Timeline

Feb 07, 2024
Application Filed
Aug 09, 2025
Non-Final Rejection — §101
Sep 17, 2025
Response Filed
Sep 27, 2025
Final Rejection — §101
Dec 01, 2025
Response after Non-Final Action
Dec 30, 2025
Request for Continued Examination
Feb 12, 2026
Response after Non-Final Action
Mar 07, 2026
Non-Final Rejection — §101 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12586018
SYSTEM AND METHOD FOR CREATING A SERVICE INSTANCE
2y 5m to grant Granted Mar 24, 2026
Patent 12406218
DASHBOARD FOR MULTI SITE MANAGEMENT SYSTEM
2y 5m to grant Granted Sep 02, 2025
Patent 12321841
Unsupervised Cross-Domain Data Augmentation for Long-Document Based Prediction and Explanation
2y 5m to grant Granted Jun 03, 2025
Patent 12299609
DYNAMICALLY TRANSMITTING ONLINE MODE INVITATIONS TO PROVIDER DEVICES IN RESPONSE TO DETECTED CHANGES IN PROVIDER DEVICE EFFICIENCY
2y 5m to grant Granted May 13, 2025
Patent 11928619
VEHICLE DISPATCH SERVICE BOARDING LOCATION DETERMINATION METHOD, AND VEHICLE DISPATCH SERVICE BOARDING LOCATION DETERMINATION DEVICE
2y 5m to grant Granted Mar 12, 2024
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
14%
Grant Probability
30%
With Interview (+16.2%)
3y 11m
Median Time to Grant
High
PTA Risk
Based on 172 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