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 action is in response to amendment filed on 22 January 2025. Claims 1-20 have been cancelled. Claims 21-40 are currently pending and have been examined.
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 conflicting claims 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); 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 nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP § 2146 et seq. for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b).
The filing of a terminal disclaimer by itself is not a complete reply to a nonstatutory double patenting (NSDP) rejection. A complete reply requires that the terminal disclaimer be accompanied by a reply requesting reconsideration of the prior Office action. Even where the NSDP rejection is provisional the reply must be complete. See MPEP § 804, subsection I.B.1. For a reply to a non-final Office action, see 37 CFR 1.111(a). For a reply to final Office action, see 37 CFR 1.113(c). A request for reconsideration while not provided for in 37 CFR 1.113(c) may be filed after final for consideration. See MPEP §§ 706.07(e) and 714.13.
The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The actual filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) 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 www.uspto.gov/patents/apply/applying-online/eterminal-disclaimer.
Claims 21-40 s rejected on the ground of nonstatutory double patenting over claims 1-20 of U.S. Patent No. 12, 190, 297 since the claims, if allowed, would improperly extend the “right to exclude” already granted in the patent.
The subject matter claimed in the instant application is fully disclosed in the patent and is covered by the patent since the patent and the application are claiming common subject matter, as follows:
18/989,930
12,190,297
21. (New) A computer-implemented method comprising:
identifying a virtual queue of one or more vehicles scheduled for service at a vehicle service center comprising a set of sequential stations for servicing vehicles in a sequential order, the one or more vehicles comprising a vehicle associated with a transportation matching system;
determining, for the virtual queue, a predefined progression rate defining a per-station maximum amount of time to perform a station service;
determining, in response to adding the vehicle associated with the transportation matching system to the virtual queue, a set of resources associated with the vehicle service center for performing one or more station services at the set of sequential stations on the one or more vehicles;
dispatching the vehicle associated with the transportation matching system to the vehicle service center in accordance with a position of the vehicle in the virtual queue; and
dynamically allocating, during progression of the one or more vehicles through the set of sequential stations, the set of resources to the set of sequential stations to perform the one or more station services at the set of sequential stations in accordance with the predefined progression rate and a complexity of each of the one or more station services determined based on a difficulty level, a skill level, or a number of tasks required to satisfy each of the one or more station services.
15. A computer-implemented method comprising:
identifying a vehicle associated with a dynamic transportation matching system, wherein a service is associated with the vehicle;
identifying a virtual queue of one or more other vehicles scheduled for service at a vehicle service center comprising a set of sequential stations, wherein vehicles progress through the set of sequential stations;
determining, for the virtual queue, a predefined progression rate defining a per-station maximum amount of time to perform a station service;
determining a complexity of the service associated with the vehicle, wherein the complexity of the service is based on at least one of a difficulty level, a skill level, or a number of tasks required to satisfy the service;
determining a complexity of each of one or more services associated with the one or more other vehicles, wherein the complexity of each of the one or more services is based on at least one of a difficulty level, a skill level, or a number of tasks required to satisfy each of the one or more services;
determining that, in adding the vehicle to the virtual queue, the vehicle and the one or more other vehicles corresponding to the virtual queue can proceed through the set of sequential stations of the vehicle service center in accordance with the predefined progression rate by
based on the complexity of the service for the vehicle and the complexity of each of the one or more services for the one or more other vehicles, determining a predicted progression rate at which the vehicle and the one or more other vehicles will move through the set of sequential stations; and
comparing the predicted progression rate to the predefined progression rate to determine that adding the vehicle to the virtual queue will allow the vehicle and the one or more other vehicles to move through the set of sequential stations in accordance with the predefined progression rate;
automatically adding the vehicle to the virtual queue with the one or more other vehicles scheduled for service at the vehicle service center in response to determining that the vehicle and the one or more other vehicles corresponding to the virtual queue can proceed through the set of sequential stations of the vehicle service center in accordance with the predefined progression rate; and dispatching the vehicle to the vehicle service center in accordance with a position of the vehicle in the virtual queue.
Although the claims at issue are not identical, they are not patentably distinct from each other because: though the wordings are different, the limitations carried are either inherently implied or would have been obvious to one of ordinary sill in the art. 18/989,930 differ from the patent by stating: “identifying a virtual queue of one or more vehicles scheduled for service at a vehicle service center comprising a set of sequential stations for servicing vehicles in a sequential order, the one or more vehicles comprising a vehicle associated with a transportation matching system” vs “ identifying a vehicle associated with a dynamic transportation matching system, wherein a service is associated with the vehicle; and identifying a virtual queue of one or more other vehicles scheduled for service at a vehicle service center comprising a set of sequential stations, wherein vehicles progress through the set of sequential stations;”. While the nature of the limitations are different, however do not result in a patentable distinction, in either case, because the limitations carried are either inherently implied or would have been obvious to one of ordinary skill in the art, or otherwise described in language that do not carry patentable weight either case. 18/989,930’s major difference in language by the lacking of the step of “ determining, for the virtual queue, a predefined progression rate defining a per-station maximum amount of time to perform a station service; “, “ determining a complexity of the service associated with the vehicle, wherein the complexity of the service is based on at least one of a difficulty level, a skill level, or a number of tasks required to satisfy the service;” and “determining a complexity of each of one or more services associated with the one or more other vehicles, wherein the complexity of each of the one or more services is based on at least one of a difficulty level, a skill level, or a number of tasks required to satisfy each of the one or more services;”. A person of ordinary skill in the art would not have been motivated to modify the part’s claimed invention (by omitting the limitation) to arrive at the invention in the continual application, the omission steps does not render the new claim unpatentable. Further, it is widely known in the art that, in order to effectively preserve patent on the broader claims by excluding the specific calculation and determination. 18/989,930 differ from the patent by stating “determining, in response to adding the vehicle associated with the transportation matching system to the virtual queue, a set of resources associated with the vehicle service center for performing one or more station services at the set of sequential stations on the one or more vehicles;” vs “determining that, in adding the vehicle to the virtual queue, the vehicle and the one or more other vehicles corresponding to the virtual queue can proceed through the set of sequential stations of the vehicle service center in accordance with the predefined progression rate by”. While the nature of the limitation are different, however do not result in a patentable distinction, because the limitations carried are either inherently implied or would have been obvious to one of ordinary skill in the art, or otherwise described in language that do not carry patentable weight either case. 18/989,930’s major difference in language by the lacking of the step of “ based on the complexity of the service for the vehicle and the complexity of each of the one or more services for the one or more other vehicles, determining a predicted progression rate at which the vehicle and the one or more other vehicles will move through the set of sequential stations;” and “comparing the predicted progression rate to the predefined progression rate to determine that adding the vehicle to the virtual queue will allow the vehicle and the one or more other vehicles to move through the set of sequential stations in accordance with the predefined progression rate;”. A person of ordinary skill in the art would not have been motivated to modify the part’s claimed invention (by omitting the limitation) to arrive at the invention in the continual application, the omission steps does not render the new claim unpatentable. Further, it is widely known in the art that, in order to effectively preserve patent on the broader claims by excluding the specific calculation and determination. 18/989,930 recites “dynamically allocating” vs “automatically add the” however, the wordings are different, the limitations carried are either inherently implied or would have been obvious to one of ordinary skill in the art, or otherwise described in language that do not carry patentable.
Furthermore, there is no apparent reason why applicant was prevented from presenting claims corresponding to those of the instant application during prosecution of the application which matured into a patent. See In re Schneller, 397 F.2d 350, 158 USPQ 210 (CCPA 1968). See also MPEP § 804.
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.
Step 1: The claims 21-27 are a method , claims 28-34 are a system and claims 35-40 are medium. Thus, each independent claim, on its face, is directed to one of the statutory categories of 35 U.S.C. §101. However, the claims 21-40 are rejected under 35 U.S.C. 101 because the claimed invention is directed to an abstract idea without significantly more.
Step 2A-Prong 1: independent claims (21, 28 and 35) recite “ identifying a virtual queue of one or more vehicles scheduled for service at a vehicle service center comprising a set of sequential stations for servicing vehicles in a sequential order, the one or more vehicles comprising a vehicle associated with a transportation matching system”; determining, for the virtual queue, a predefined progression rate defining a per-station maximum amount of time to perform a station service; determining, in response to adding the vehicle associated with the transportation matching system to the virtual queue, a set of resources associated with the vehicle service center for performing one or more station services at the set of sequential stations on the one or more vehicles; dispatching the vehicle associated with the transportation matching system to the vehicle service center in accordance with a position of the vehicle in the virtual queue. These limitation, as drafted, are a process that, under its broadest reasonable interpretation covers managing a queue and allocating resources based on predefined rates and complexities. This is a fundamental management, logistics, and scheduling principle that has been in use in various forms. These limitations fall within “Certain Methods Of
Organizing Human Activity” for commercial or legal interactions (including agreements in the
form of contracts; legal obligations; advertising, marketing or sales activities or behaviors;
business relations). Futher the claims also covers in principle managing a simplified version of this system (e.g., manager at a service a service center making decision based on vehicle types, skill level of workers and task lists) performance of the limitation in the mind, the claims also recite a mental process. Simply put, these limitation merely describe facilitating the completion of transportation requests each day, which is clearly a business arrangement in its purest form.
Claims 22-27, 29-34 and 36-40, merely provide additional abstract concepts and narrow the abstract idea of claims 21, 28 and 35. Further, claims 21-40 are recited at such a high level that the claimed steps amount to no more than a mental processes, such as concepts performed in the human mind (including an observation, evaluation, judgment, opinion) because a human can instruct to dispatching the vehicle to the vehicle service center in accordance with the vehicle’s position.
Step 2A-Prong 2: The claims recited additional elements of a “computer-implemented method” and “executing on a processor” , which uses a generic computer component (processor , memory) is recited at high level of generality , i.e., as a generic processor and memory for performing the generic functions of identifying, determining and dispatching steps. The recited
recites conventional computer components and generic software functions to implement the abstract idea. The "transportation matching system" and "vehicle service center" are mentioned as the environment for the abstract process, but the claim doesn't focus on a specific, unconventional technological solution to a technical problem. Merely stating the method is "computer-implemented" or "executing on a processor" with a memory is considered a generic use of a computer and does not add an inventive concept. The claims does not recite an improvement to the computer's functionality itself (e.g., a specific improvement to memory storage, data retrieval speed, or network communication).
The dynamically allocating resources based on rate and complexity limitation is also recited at high level of generality but as viewed a result-oriented limitation using a known optimization or scheduling algorithm without describing a specific, inventive application or improvement in computer technology itself. The claims does not recite an improvement to the computer's functionality itself beyond the abstract logic. The "predefined progression rate" is a mathematical or business rule, not a technical improvement. Accordingly, this additional element does not integrate the abstract idea into a practical application because it does not impose any meaningful limits on practicing the abstract idea. The claims are directed to the abstract idea.
Step 2B: As discussed with respect to Step 2A Prong Two, the additional element in the claim amounts to no more than mere instructions to apply the exception using a generic computer component. The same analysis applies here in 2B, i.e., mere instructions to apply an exception using a generic computer component cannot integrate a judicial exception into a practical application at Step 2A or provide an inventive concept in Step 2B. The claims are ineligible.
Claim Rejections - 35 USC § 103
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.
Claim(s) 21, 22, 27, 28, 29, 34, 35, 36 and 40 is/are rejected under 35 U.S.C. 103 as being unpatentable over Wu (US Pub., 2010/0293030 A1) in view of Slattery et al (US Pub., No., 2019/0139258 A1) and futher view of Briggs et al (US Patent No., 9, 940,596 B1)
With respect to claim 21, Wu teaches a computer-implemented method comprising:
identifying a virtual queue of one or more vehicles scheduled for service at a vehicle service center comprising a set of sequential stations for servicing vehicles in a sequential order, the one or more vehicles comprising a vehicle associated with a transportation matching system (Fig. 6, 61, discloses establish a database in the service center for storing the information including dispatching condition sets of respective vehicle, 62 discloses in response to a vehicle service request the service center selects a vehicle from the database according to a vehicle-requiring condition corresponding to the vehicle service request [identify one or more vehicle schedule for service], 63 discloses if s the dispatch conditions of the selected vehicle matches the vehicle-require condition? Y issues an inquiry signal from the service center to the host of the selected vehicle, Fig. 7, 702 and paragraph [0034] discloses select the vehicles matching one or more specified vehicle-requiring conditions according to the dispatching priority ranking table [virtual queue] );
determining, in response to adding the vehicle associated with the transportation matching system to the virtual queue, a set of resources associated with the vehicle service center for performing one or more station services at the set of sequential stations on the one or more vehicles (paragraph [0037], discloses the vehicle matching the one or more specific vehicle requiring condition are selected according to the dispatching priority ranking table. If none of the vehicles match all of the specified vehicle-requiring conditions (Step 703), the specified vehicle-requiring condition with the lowest priority ranking is rejected repeatedly done otherwise the vehicles matching all of the specific vehicles-requiring condition are selected [adding the vehicle] and sorted and an inquiry signal is issued form the service center); and
dispatching the vehicle associated with the transportation matching system to the vehicle service center in accordance with a position of the vehicle in the virtual queue (Fig. 6, 63 disclose if the dispatching condition set of the selected vehicle matches the vehicle-requiring condition? Issue an inquiring signal form the service center to the host of the selected vehicle).
Wu teaches the above element including accepting a reserved vehicle service task, a vehicle-dispatching method is provided(abstract), receives a real-time vehicle service request or a reserved vehicle service request (Fig. 7, 701) , receive a scheduled time of a reserved vehicle service task by the service center (Fig. 8, 801). Wu failed to teach determining, for the virtual queue, a predefined progression rate defining a per-station maximum amount of time to perform a station service; and dynamically allocating, during progression of the one or more vehicles through the set of sequential stations, the set of resources to the set of sequential stations to perform the one or more station services at the set of sequential stations in accordance with the predefined progression rate and a complexity of each of the one or more station services determined based on a difficulty level, a skill level, or a number of tasks required to satisfy each of the one or more station services.
However, Slattery teaches determining, for the virtual queue, a predefined progression rate defining a per-station maximum amount of time to perform a station service (Fig. 5, discloses vehicles serviced start time , paragraph [0078], discloses a disply window that id displayed that allow the user to see details of the vehicle serviced .., start time, the object tracking module vehicles serviced start time .., end time.., paragraph [0052], dislcies tracking module can also analyze the image from the first camera and the second camera to match up the time t1, t2, t3 and t4 with the appropriate vehicle , the time and the running time for each vehicle are monitored continually .. , paragraphs [0053], dislcies analyzing a difference between the second time t2 (i.e., when the vehicle leaves he first zone) and the third time t3 …, it may be determined that a vehicle normally take between five second and 20 second to move from the que position to the bay position .. paragraph [0061], discloses determine if the wait time is appropriate with respect to the service received and paragraph [0079], discloses a vehicle queue camera that captures when a vehicle first arrives at a location …, the service time and the wait time can be added together to calculation total customer time ). Therefore, it would have been obvious to the one ordinary skill in the art before the effective filing date of the claimed invention for the vehicle matching the one or more specific vehicle requiring condition are selected according to the dispatching priority ranking of Wu with calculating the difference between the start time and end time to determine the elapsed time of Slattery in order to analyze statistics related to service wait times (see Slattery, paragraph [0004]).
Wu and Slattery teaches the above elements, Wu futher teaches the host is allocated to the dispatching priority ranking table belonging to the east sub-district and the south sub-district for sorting (paragraph [0040]) and Slattery teaches automatically monitor the amount of time that it task to perform various service for the cusmter (paragraph [0004]) . Wu and Slattery failed to teach dynamically allocating, during progression of the one or more vehicles through the set of sequential stations and vehicles through the set of sequential stations, the set of resources to the set of sequential stations to perform the one or more station services at the set of sequential stations in accordance with the predefined progression rate and a complexity of each of the one or more station services determined based on a difficulty level, a skill level, or a number of tasks required to satisfy each of the one or more station services
However, Brigges teaches dynamically allocating, during progression of the one or more vehicles through the set of sequential stations and vehicles through the set of sequential stations, the set of resources to the set of sequential stations to perform the one or more station services at the set of sequential stations in accordance with the predefined progression rate and a complexity of each of the one or more station services determined based on a difficulty level, a skill level, or a number of tasks required to satisfy each of the one or more station services (Col. 5, lines 4-14, discloses dynamically allocate service vehicles so that if a base station become shorthanded (e.g., has fewer service vehicles than desired) the system may transfer a service vehicle from another base station to the shorthanded base station. Additionally, the system may generate target goals and predict the levels of service it may provide based on the amount of resources available. For example, the system may determine whether it has sufficient resources to provide services within 15 minutes or whether it should only expect to be able to provide services within 20 minutes. The system may also collect and record performance data indicating whether goals are being met [progression rate and a complexity]). Therefore, it would have been obvious to the one ordinary skill in the art before the effective filing date of the claimed invention for the vehicle matching the one or more specific vehicle requiring condition are selected according to the dispatching priority ranking of Wu and calculating the difference between the start time and end time to determine the elapsed time of Slattery with dynamic allocating feature of Brigges in order to reduce or optimize the response time to service request (see Brigges , Col. 3, lines 39-40).
With respect to claim 22, Wu in view of Slattery and futher of Brigges teaches elements of claim 21, Wu failed to teach the method further comprising determining that the vehicle is able to proceed through the set of sequential stations at in accordance with the predefined progression rate by: determining a predicted progression rate at which the vehicle moves through the set of sequential stations based on the complexity of each of the one or more station services; and comparing the predicted progression rate to the predefined progression rate.
However, Slattery teaches determining that the vehicle is able to proceed through the set of sequential stations at in accordance with the predefined progression rate (paragraph [0030], discloses the location wait time server may be configured to receive service information from multiple shops located [sequential stations] .., the location wait time server can process the service information to determine an estimated time at each shop [predefined progress rate]) by:
determining a predicted progression rate at which the vehicle moves through the set of sequential stations based on the complexity of each of the one or more station services and
comparing the predicted progression rate to the predefined progression rate (Fig. 5, paragraph [0078], discloses the display view allow the user to see details of the diffent customers that have had vehicle services .., and paragraph [0089], discloses displays up to the minute information about the wait times at those shops. From this information, a customer can determine where they can go to get the fastest service or determine if the shop nearest to them is busy). Therefore, it would have been obvious to the one ordinary skill in the art before the effective filing date of the claimed invention for the vehicle matching the one or more specific vehicle requiring condition are selected according to the dispatching priority ranking of Wu with calculating the difference between the start time and end time to determine the elapsed time of Slattery in order to analyze statistics related to service wait times (see Slattery, paragraph [0004]).
With respect to claim 27 , Wu in view of Slattery and futher view of Brigges teaches elements of claim 21, Wu teaches preventing an additional vehicle associated with the transportation matching system from being added to the virtual queue (Fig. 7, 702-704, and paragraph [0037] discloses select the vehicle match one or more one or more specified vehicle-requiring conditions according to the dispatching priority ranking table, if none of the vehicles match all of the specific vehicle-requiring condition – Yes, reject specified vehicle- requiring condition with the lowest priority ranking). Wu failed to teach the computer-implemented method further comprising: generating a prediction of an aggregated estimated service time of the one or more station services for the one or more vehicles based on available resources of the vehicle service center; determining that the aggregated estimated service time exceeds a threshold time determined according to the predefined progression rate.
However, Slattery teaches generating a prediction of an aggregated estimated service time of the one or more station services for the one or more vehicles based on available resources of the vehicle service center; determining that the aggregated estimated service time exceeds a threshold time determined according to the predefined progression rate (Fig. 5, discloses vehicles serviced start time , paragraph [0078], discloses a disply window that id displayed that allow the user to see details of the vehicle serviced .., start time, the object tracking module vehicles serviced start time .., end time.., paragraph [0052], dislcies tracking module can also analyze the image from the first camera and the second camera to match up the time t1, t2, t3 and t4 with the appropriate vehicle , the time and the running time for each vehicle are monitored continually .. , paragraphs [0053], dislcies analyzing a difference between the second time t2 (i.e., when the vehicle leaves he first zone) and the third time t3 …, it may be determined that a vehicle normally take between five second and 20 second to move from the que position to the bay position .. paragraph [0061], discloses determine if the wait time is appropriate with respect to the service received and paragraph [0079], discloses a vehicle queue camera that captures when a vehicle first arrives at a location …, the service time and the wait time can be added together to calculation total customer time ). Therefore, it would have been obvious to the one ordinary skill in the art before the effective filing date of the claimed invention for the vehicle matching the one or more specific vehicle requiring condition are selected according to the dispatching priority ranking of Wu with calculating the difference between the start time and end time to determine the elapsed time of Slattery in order to analyze statistics related to service wait times (see Slattery, paragraph [0004]).
With respect to claim 28, Wu teaches a system comprising:
at least one processor; a non-transitory computer-readable medium comprising instruction, that when executed by the at least one processor (paragraph [0019], discloses vehicle-dispatching system.., computer, personal digital assistance (PDA) ..), to cause the system to:
identify a virtual queue of one or more vehicles scheduled for service at a vehicle service center comprising a set of sequential stations for servicing vehicles in a sequential order, the one or more vehicles comprising a vehicle associated with a transportation matching system (Fig. 6, 61, discloses establish a database in the service center for storing the information including dispatching condition sets of respective vehicle, 62 dislcies in response to a vehicle service request the service center selects a vehicle from the database according to a vehicle-requiring condition corresponding to the vehicle service request [identify one or more vehicle schedule for service], 63 discloses if s the dispatch conditions of the selected vehicle matches the vehicle-require condition? Y issues an inquiry signal from the service center to the host of the selected vehicle, Fig. 7, 702 and paragraph [0034] discloses select the vehicles matching one or more specified vehicle-requiring conditions according to the dispatching priority ranking table [virtual queue] );
determine, in response to adding the vehicle associated with the transportation matching system to the virtual queue, a set of resources associated with the vehicle service center for performing one or more station services at the set of sequential stations on the one or more vehicles (paragraph [0037], discloses the vehicle matching the one or more specific vehicle requiring condition are selected according to the dispatching priority ranking table. If none of the vehicles match all of the specified vehicle-requiring conditions (Step 703), the specified vehicle-requiring condition with the lowest priority ranking is rejected repeatedly done otherwise the vehicles matching all of the specific vehicles-requiring condition are selected [adding the vehicle] and sorted and an inquiry signal is issued form the service center); and
dispatch the vehicle associated with the transportation matching system to the vehicle service center in accordance with a position of the vehicle in the virtual queue (Fig. 6, 63 disclose if the dispatching condition set of the selected vehicle matches the vehicle-requiring condition? Issue an inquiring signal form the service center to the host of the selected vehicle).
Wu teaches the above element including accepting a reserved vehicle service task, a vehicle-dispatching method is provided(abstract), receives a real-time vehicle service request or a reserved vehicle service request (Fig. 7, 701) , receive a scheduled time of a reserved vehicle service task by the service center (Fig. 8, 801). Wu failed to teach determining, for the virtual queue, a predefined progression rate defining a per-station maximum amount of time to perform a station service; and dynamically allocating, during progression of the one or more vehicles through the set of sequential stations, the set of resources to the set of sequential stations to perform the one or more station services at the set of sequential stations in accordance with the predefined progression rate and a complexity of each of the one or more station services determined based on a difficulty level, a skill level, or a number of tasks required to satisfy each of the one or more station services.
However, Slattery teaches determine, for the virtual queue, a predefined progression rate defining a per-station maximum amount of time to perform a station service (Fig. 5, discloses vehicles serviced start time , paragraph [0078], discloses a disply window that id displayed that allow the user to see details of the vehicle serviced .., start time, the object tracking module vehicles serviced start time .., end time.., paragraph [0052], dislcies tracking module can also analyze the image from the first camera and the second camera to match up the time t1, t2, t3 and t4 with the appropriate vehicle , the time and the running time for each vehicle are monitored continually .. , paragraphs [0053], dislcies analyzing a difference between the second time t2 (i.e., when the vehicle leaves he first zone) and the third time t3 …, it may be determined that a vehicle normally take between five second and 20 second to move from the que position to the bay position .. paragraph [0061], discloses determine if the wait time is appropriate with respect to the service received and paragraph [0079], discloses a vehicle queue camera that captures when a vehicle first arrives at a location …, the service time and the wait time can be added together to calculation total customer time ). Therefore, it would have been obvious to the one ordinary skill in the art before the effective filing date of the claimed invention for the vehicle matching the one or more specific vehicle requiring condition are selected according to the dispatching priority ranking of Wu with calculating the difference between the start time and end time to determine the elapsed time of Slattery in order to analyze statistics related to service wait times (see Slattery, paragraph [0004]).
Wu and Slattery teaches the above elements, Wu futher teaches the host is allocated to the dispatching priority ranking table belonging to the east sub-district and the south sub-district for sorting (paragraph [0040]) and Slattery teaches automatically monitor the amount of time that it task to perform various service for the cusmter (paragraph [0004]) . Wu and Slattery failed to teach dynamically allocating, during progression of the one or more vehicles through the set of sequential stations and vehicles through the set of sequential stations, the set of resources to the set of sequential stations to perform the one or more station services at the set of sequential stations in accordance with the predefined progression rate and a complexity of each of the one or more station services determined based on a difficulty level, a skill level, or a number of tasks required to satisfy each of the one or more station services
However, Brigges teaches dynamically allocate, during progression of the one or more vehicles through the set of sequential stations and vehicles through the set of sequential stations, the set of resources to the set of sequential stations to perform the one or more station services at the set of sequential stations in accordance with the predefined progression rate and a complexity of each of the one or more station services determined based on a difficulty level, a skill level, or a number of tasks required to satisfy each of the one or more station services (Col. 5, lines 4-14, discloses dynamically allocate service vehicles so that if a base station become shorthanded (e.g., has fewer service vehicles than desired) the system may transfer a service vehicle from another base station to the shorthanded base station. Additionally, the system may generate target goals and predict the levels of service it may provide based on the amount of resources available. For example, the system may determine whether it has sufficient resources to provide services within 15 minutes or whether it should only expect to be able to provide services within 20 minutes. The system may also collect and record performance data indicating whether goals are being met [progression rate and a complexity]). Therefore, it would have been obvious to the one ordinary skill in the art before the effective filing date of the claimed invention for the vehicle matching the one or more specific vehicle requiring condition are selected according to the dispatching priority ranking of Wu and calculating the difference between the start time and end time to determine the elapsed time of Slattery with dynamic allocating feature of Brigges in order to reduce or optimize the response time to service request (see Brigges , Col. 3, lines 39-40).
With respect to claim 29, Wu in view of Slattery and futher of Brigges teaches elements of claim 28, Wu failed to teach the system further comprising instruction that, when executed by at least one processor, cause the system to determine that the vehicle is able to proceed through the set of sequential stations at in accordance with the predefined progression rate by: determining a predicted progression rate at which the vehicle moves through the set of sequential stations based on the complexity of each of the one or more station services; and comparing the predicted progression rate to the predefined progression rate.
However, Slattery teaches determine that the vehicle is able to proceed through the set of sequential stations at in accordance with the predefined progression rate (paragraph [0030], discloses the location wait time server may be configured to receive service information from multiple shops located [sequential stations] .., the location wait time server can process the service information to determine an estimated time at each shop [predefined progress rate]) by:
determine a predicted progression rate at which the vehicle moves through the set of sequential stations based on the complexity of each of the one or more station services and
comparing the predicted progression rate to the predefined progression rate (Fig. 5, paragraph [0078], discloses the display view allow the user to see details of the diffent customers that have had vehicle services .., and paragraph [0089], discloses displays up to the minute information about the wait times at those shops. From this information, a customer can determine where they can go to get the fastest service or determine if the shop nearest to them is busy). Therefore, it would have been obvious to the one ordinary skill in the art before the effective filing date of the claimed invention for the vehicle matching the one or more specific vehicle requiring condition are selected according to the dispatching priority ranking of Wu with calculating the difference between the start time and end time to determine the elapsed time of Slattery in order to analyze statistics related to service wait times (see Slattery, paragraph [0004]).
With respect to claim 34, Wu in view of Slattery and futher view of Brigges teaches elements of claim 28, Wu teaches the system further comprising instruction that, when executed by at least one processor, cause the system to prevent an additional vehicle associated with the transportation matching system from being added to the virtual queue (Fig. 7, 702-704, and paragraph [0037] discloses select the vehicle match one or more one or more specified vehicle-requiring conditions according to the dispatching priority ranking table, if none of the vehicles match all of the specific vehicle-requiring condition – Yes, reject specified vehicle- requiring condition with the lowest priority ranking). Wu failed to teach the computer-implemented method further comprising: generating a prediction of an aggregated estimated service time of the one or more station services for the one or more vehicles based on available resources of the vehicle service center; determining that the aggregated estimated service time exceeds a threshold time determined according to the predefined progression rate.
However, Slattery teaches generate a prediction of an aggregated estimated service time of the one or more station services for the one or more vehicles based on available resources of the vehicle service center; determine that the aggregated estimated service time exceeds a threshold time determined according to the predefined progression rate (Fig. 5, discloses vehicles serviced start time , paragraph [0078], discloses a disply window that id displayed that allow the user to see details of the vehicle serviced .., start time, the object tracking module vehicles serviced start time .., end time.., paragraph [0052], dislcies tracking module can also analyze the image from the first camera and the second camera to match up the time t1, t2, t3 and t4 with the appropriate vehicle , the time and the running time for each vehicle are monitored continually .. , paragraphs [0053], dislcies analyzing a difference between the second time t2 (i.e., when the vehicle leaves he first zone) and the third time t3 …, it may be determined that a vehicle normally take between five second and 20 second to move from the que position to the bay position .. paragraph [0061], discloses determine if the wait time is appropriate with respect to the service received and paragraph [0079], discloses a vehicle queue camera that captures when a vehicle first arrives at a location …, the service time and the wait time can be added together to calculation total customer time ). Therefore, it would have been obvious to the one ordinary skill in the art before the effective filing date of the claimed invention for the vehicle matching the one or more specific vehicle requiring condition are selected according to the dispatching priority ranking of Wu with calculating the difference between the start time and end time to determine the elapsed time of Slattery in order to analyze statistics related to service wait times (see Slattery, paragraph [0004]).
With respect to claim 35, Wu teaches a non-transitory computer-readable medium comprising instruction, that when executed by the at least one processor (paragraph [0019], discloses vehicle-dispatching system.., computer, personal digital assistance (PDA) ..), to cause the system to:
identify a virtual queue of one or more vehicles scheduled for service at a vehicle service center comprising a set of sequential stations for servicing vehicles in a sequential order, the one or more vehicles comprising a vehicle associated with a transportation matching system (Fig. 6, 61, discloses establish a database in the service center for storing the information including dispatching condition sets of respective vehicle, 62 dislcies in response to a vehicle service request the service center selects a vehicle from the database according to a vehicle-requiring condition corresponding to the vehicle service request [identify one or more vehicle schedule for service], 63 discloses if s the dispatch conditions of the selected vehicle matches the vehicle-require condition? Y issues an inquiry signal from the service center to the host of the selected vehicle, Fig. 7, 702 and paragraph [0034] discloses select the vehicles matching one or more specified vehicle-requiring conditions according to the dispatching priority ranking table [virtual queue] );
determine, in response to adding the vehicle associated with the transportation matching system to the virtual queue, a set of resources associated with the vehicle service center for performing one or more station services at the set of sequential stations on the one or more vehicles (paragraph [0037], discloses the vehicle matching the one or more specific vehicle requiring condition are selected according to the dispatching priority ranking table. If none of the vehicles match all of the specified vehicle-requiring conditions (Step 703), the specified vehicle-requiring condition with the lowest priority ranking is rejected repeatedly done otherwise the vehicles matching all of the specific vehicles-requiring condition are selected [adding the vehicle] and sorted and an inquiry signal is issued form the service center); and
dispatch the vehicle associated with the transportation matching system to the vehicle service center in accordance with a position of the vehicle in the virtual queue (Fig. 6, 63 disclose if the dispatching condition set of the selected vehicle matches the vehicle-requiring condition? Issue an inquiring signal form the service center to the host of the selected vehicle).
Wu teaches the above element including accepting a reserved vehicle service task, a vehicle-dispatching method is provided(abstract), receives a real-time vehicle service request or a reserved vehicle service request (Fig. 7, 701) , receive a scheduled time of a reserved vehicle service task by the service center (Fig. 8, 801). Wu failed to teach determining, for the virtual queue, a predefined progression rate defining a per-station maximum amount of time to perform a station service; and dynamically allocating, during progression of the one or more vehicles through the set of sequential stations, the set of resources to the set of sequential stations to perform the one or more station services at the set of sequential stations in accordance with the predefined progression rate and a complexity of each of the one or more station services determined based on a difficulty level, a skill level, or a number of tasks required to satisfy each of the one or more station services.
However, Slattery teaches determine, for the