Prosecution Insights
Last updated: April 19, 2026
Application No. 18/434,352

VEHICLE TRAJECTORY CONTROL USING A TREE SEARCH

Final Rejection §103§112
Filed
Feb 06, 2024
Examiner
LEE, HANA
Art Unit
3662
Tech Center
3600 — Transportation & Electronic Commerce
Assignee
Zoox Inc.
OA Round
2 (Final)
60%
Grant Probability
Moderate
3-4
OA Rounds
3y 0m
To Grant
96%
With Interview

Examiner Intelligence

Grants 60% of resolved cases
60%
Career Allow Rate
84 granted / 141 resolved
+7.6% vs TC avg
Strong +37% interview lift
Without
With
+36.6%
Interview Lift
resolved cases with interview
Typical timeline
3y 0m
Avg Prosecution
36 currently pending
Career history
177
Total Applications
across all art units

Statute-Specific Performance

§101
12.6%
-27.4% vs TC avg
§103
48.8%
+8.8% vs TC avg
§102
14.2%
-25.8% vs TC avg
§112
22.1%
-17.9% vs TC avg
Black line = Tech Center average estimate • Based on career data from 141 resolved cases

Office Action

§103 §112
DETAILED ACTION The amendments filed 10/28/2025 have been entered. Claims 2-4, 7-10, 13-17, and 20-21 have been amended. Claims 2-21 remain pending in the application and are discussed on the merits below. 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 . Response to Arguments Applicant's arguments filed 10/28/2025 have been fully considered but are considered moot because the amendments have necessitated a new grounds of rejection as outlined below. Applicant asserts “Gross fails to provide any teaching or suggestion – implicit or otherwise – of a ‘default action’ as formerly recited in claim 2 in pages 11-12. However, Examiner respectfully disagrees. Claim 3 of Applicant’s claim set recites “default action comprises at least one of: repeating the first candidate action after the first candidate action; or maintaining a speed and lane position of the vehicle after the first candidate action” (emphasis added). Gross teaches that from node 1501 to 1512 is no or minimal acceleration or deceleration which indicates that the speed is maintained. However, the rejection has been updated to better reflect such definition by adding Popov’s default action and maintaining a lane position. Response to Amendment Regarding the rejections under 35 USC §112, Applicant has amended the claims to overcome some of the rejections but not all. Some of the rejections under 35 USC §112 have been withdrawn and other remain as outlined below. Regarding the rejections under 35 USC §103, amendments made to the claims have necessitated a new grounds of rejection as outlined below. Claim Rejections - 35 USC § 112 The following is a quotation of 35 U.S.C. 112(b): (b) CONCLUSION.—The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the inventor or a joint inventor regards as the invention. The following is a quotation of 35 U.S.C. 112 (pre-AIA ), second paragraph: The specification shall conclude with one or more claims particularly pointing out and distinctly claiming the subject matter which the applicant regards as his invention. Claims 14 and 21 are rejected under 35 U.S.C. 112(b) or 35 U.S.C. 112 (pre-AIA ), second paragraph, as being indefinite for failing to particularly point out and distinctly claim the subject matter which the inventor or a joint inventor (or for applications subject to pre-AIA 35 U.S.C. 112, the applicant), regards as the invention. Claim 14 recites the limitation “the object” in line 2. There is insufficient antecedent basis for this limitation in the claim. The additional recitations of “the object” in claim 14 also carry the same rejection. Claim 21 recites the limitation “the object” in line 3. There is insufficient antecedent basis for this limitation in the claim. The additional recitations of “the object” in claim 21 also carry the same rejection. 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 2, 4-6, 8, 10-12, 15, and 17-19 are rejected under 35 U.S.C. 103 as being unpatentable over Gross et al. (U.S. Patent Application Publication No. 2018/0150081 A1; hereinafter Gross) in view of Popov et al. (U.S. Patent Application Publication No. 2021/0156963 A1; hereinafter Popov). Regarding claim 2, Gross discloses: A method comprising: determining a first candidate action for controlling motion of a vehicle (method for controlling a first vehicle, see at least [0005] and [0129]; first node 1501 includes an initial state and proceeds in one of three directions 1571, 1572, or 1573, wherein 1571 is for AV 10 decelerating, see at least [0105]-[0106]); determining a first cost associated with the first candidate action (lattice of future states along with cost function for paths, see at least [0065] and [0084]; node 1511 has a cost associated therewith, see at least [0104]); determining a lower bound cost based at least in part on the first cost and an additional cost associated with an additional candidate action (next node using one of the directions includes node 1521 when decelerating, see at least [0113]), the lower bound cost being a minimum cost to move from a first state of the vehicle (cost associated with node 1511 is low, see at least [0107]; cost associated with node 1521 is low, see at least [0116]; lowest-cost path is described as 1501, 1511, and 1521, see at least [0126]); determining, based at least in part on a default action and the first candidate action, a second cost (from node 1511, node 1522 is when AV 10 is neither accelerating or decelerating, see at least [0113]; cost associated with node 1522, see at least [0116]) *Examiner sets forth that when a vehicle is not making any changes, hence not accelerating or decelerating, the vehicle is simply running in a continuing mode which reads on the “default action.” determining, based at least in part on the first cost and the second cost, an upper bound cost associated with the first candidate action (cost associated with node 1522 may be significantly high, see at least [0116]); determining whether to perform the first candidate action based at least in part on the lower bound cost and the upper bound cost (system determines lowest-cost path is described by nodes 1501, 1511, 1521, see at least [0126]; select a lowest total cost path for AV 10 to travel, see at least [0125]); and controlling the vehicle based at least in part on the first candidate action (selected path is implemented by AV 10, see at least [0126]). Gross does not explicitly recite: default action associated with a default control instruction However, However, Popov teaches: default action associated with a default control instruction (default behavior may be to stay in lane, see at least [0070]) It would have been obvious for one of ordinary skill in the art before the effective filing date of the claimed invention to have modified the cost determination and maintaining speed disclosed by Gross by adding the default behavior to stay in lane taught by Popov with a reasonable expectation of success. One of ordinary skill in the art would have been motivated to make this modification “so that the feasible behaviors may be matched up with the most desired behaviors output from the lane planner” (see [0070]). Furthermore, not changing a speed and direction is a default for a cruise setting. Regarding claim 3, The combination of Gross and Popov teaches the elements above and Gross further discloses: the default action associated with the default control instruction is: repeating the first candidate action after the first candidate action; or maintaining a speed (node 1522 if AV is neither accelerating or decelerating, see at least [0113]) Gross does not disclose: maintaining lane positioning of the vehicle However, Popov teaches: maintaining a speed and lane positioning of the vehicle after the first candidate action (default behavior may be to stay in lane, see at least [0070]) It would have been obvious for one of ordinary skill in the art before the effective filing date of the claimed invention to have modified the maintaining speed disclosed by Gross by adding the default behavior to stay in lane taught by Popov with a reasonable expectation of success. One of ordinary skill in the art would have been motivated to make this modification “so that the feasible behaviors may be matched up with the most desired behaviors output from the lane planner” (see [0070]). Furthermore, not changing a speed and direction is a default for a cruise setting. Regarding claim 4, The combination of Gross and Popov teaches the elements above and Gross further discloses: the upper bound cost associated with the first candidate action is a first upper bound cost, and wherein determining to perform the first candidate action is further based on determining that the first upper bound cost is less than a second upper bound cost associated with the additional candidate action (system determines lowest-cost path is described by nodes 1501, 1511, 1521, see at least [0126]; select a lowest total cost path for AV 10 to travel, see at least [0125]; cost associated with nodes 1522 and 1523 may be significantly high, see at least [0116]) Regarding claim 5, The combination of Gross and Popov teaches the elements above and Gross further discloses: the lower bound cost is defined to be the first cost based at least in part on determining that the first cost is less than the additional cost associated with the additional candidate action (system determines lowest-cost path is described by nodes 1501, 1511, 1521, see at least [0126]; select a lowest total cost path for AV 10 to travel, see at least [0125]) Regarding claim 6, The combination of Gross and Popov teaches the elements above and Gross further discloses: receiving sensor data indicating an object (receive and process signals from sensor system 28 to predict presence of objects, see at least [0039] and [0051]); determining, by a machine-learned model and based at least in part on the sensor data, that the object is a reactive object (predict classification and path of objects and features of the environment of the vehicle, see at least [0051]; avoiding moving objects; modules may be implemented as machine learning models and perform classification, see at least [0066] and [0054]) determining, based at least in part on executing a first simulation using the determination that the object is a reactive object, a first prediction (determine a set of predicted paths of one or more objects likely to intersect the region of interest, see at least [0062]) executing the first simulation using the determination that the object is a reactive object comprises determining a motion of a representation of the object based at least in part on the first candidate action (predicted paths of objects likely to intersect the region of interest are determined within a predetermined time interval or planning horizon, see at least [0098]) at least one of the lower bound cost or the upper bound cost is based at least in part on the first simulation (cost of nodes 1511-1548 are associated with whether another vehicle or other object is likely to contact the AV 10 or intersect with a path of the AV or whether the object is likely to come sufficiently close to contacting the AV, see at least [0104]) Regarding claim 8, Gross discloses: A system comprising: one or more processors (at least one processor 44, see at least [0038]); and a memory storing processor-executable instructions that, when executed by the one or more processors, cause the system to perform operations comprising (computer-readable storage device or media 46 to store executable instructions used by the controller, see at least [0038]): determining a first candidate action for controlling motion of a vehicle (method for controlling a first vehicle, see at least [0005] and [0129]; first node 1501 includes an initial state and proceeds in one of three directions 1571, 1572, or 1573, wherein 1571 is for AV 10 decelerating, see at least [0105]-[0106]); determining a first cost associated with the first candidate action (lattice of future states along with cost function for paths, see at least [0065] and [0084]; node 1511 has a cost associated therewith, see at least [0104]); determining a lower bound cost based at least in part on the first cost and an additional cost associated with an additional candidate action (next node using one of the directions includes node 1521 when decelerating, see at least [0113]), the lower bound cost being a minimum cost to move from a first state of the vehicle (cost associated with node 1511 is low, see at least [0107]; cost associated with node 1521 is low, see at least [0116]; lowest-cost path is described as 1501, 1511, and 1521, see at least [0126]); determining, based at least in part on a default action and the first candidate action, a second cost (from node 1511, node 1522 is when AV 10 is neither accelerating or decelerating, see at least [0113]; cost associated with node 1522, see at least [0116]); *Examiner sets forth that when a vehicle is not making any changes, hence not accelerating or decelerating, the vehicle is simply running in a continuing mode which reads on the “default action.” determining, based at least in part on the first cost and the second cost, an upper bound cost associated with the first candidate action (cost associated with node 1522 may be significantly high, see at least [0116]); determining whether to perform the first candidate action based at least in part on the lower bound cost and the upper bound cost (system determines lowest-cost path is described by nodes 1501, 1511, 1521, see at least [0126]; select a lowest total cost path for AV 10 to travel, see at least [0125]); and controlling the vehicle based at least in part on the first candidate action (selected path is implemented by AV 10, see at least [0126]). Gross does not explicitly recite: default action associated with a default control instruction However, However, Popov teaches: default action associated with a default control instruction (default behavior may be to stay in lane, see at least [0070]) It would have been obvious for one of ordinary skill in the art before the effective filing date of the claimed invention to have modified the cost determination and maintaining speed disclosed by Gross by adding the default behavior to stay in lane taught by Popov with a reasonable expectation of success. One of ordinary skill in the art would have been motivated to make this modification “so that the feasible behaviors may be matched up with the most desired behaviors output from the lane planner” (see [0070]). Furthermore, not changing a speed and direction is a default for a cruise setting. Regarding claim 9, The combination of Gross and Popov teaches the elements above and Gross further discloses: the default action associated with the default control instruction is: repeating the first candidate action after the first candidate action; or maintaining a speed of the vehicle after the first candidate action (node 1522 if AV is neither accelerating or decelerating, see at least [0113]) Gross does not disclose: maintaining lane positioning of the vehicle However, Popov teaches: maintaining a speed and lane positioning of the vehicle after the first candidate action (default behavior may be to stay in lane, see at least [0070]) It would have been obvious for one of ordinary skill in the art before the effective filing date of the claimed invention to have modified the maintaining speed disclosed by Gross by adding the default behavior to stay in lane taught by Popov with a reasonable expectation of success. One of ordinary skill in the art would have been motivated to make this modification “so that the feasible behaviors may be matched up with the most desired behaviors output from the lane planner” (see [0070]). Furthermore, not changing a speed and direction is a default for a cruise setting. Regarding claim 10, The combination of Gross and Popov teaches the elements above and Gross further discloses: the upper bound cost associated with the first candidate action is a first upper bound cost, and wherein determining to perform the first candidate action is further based on determining that the first upper bound cost is less than a second upper bound cost associated with the additional candidate action (system determines lowest-cost path is described by nodes 1501, 1511, 1521, see at least [0126]; select a lowest total cost path for AV 10 to travel, see at least [0125]; cost associated with nodes 1522 and 1523 may be significantly high, see at least [0116]) Regarding claim 11, The combination of Gross and Popov teaches the elements above and Gross further discloses: the lower bound cost is defined to be the first cost based at least in part on determining that the first cost is less than the additional cost associated with the additional candidate action (system determines lowest-cost path is described by nodes 1501, 1511, 1521, see at least [0126]; select a lowest total cost path for AV 10 to travel, see at least [0125]) Regarding claim 12, The combination of Gross and Popov teaches the elements above and Gross further discloses: the operations further comprise: receiving sensor data indicating an object (receive and process signals from sensor system 28 to predict presence of objects, see at least [0039] and [0051]); determining, by a machine-learned model and based at least in part on the sensor data, that the object is a reactive object (predict classification and path of objects and features of the environment of the vehicle, see at least [0051]; avoiding moving objects; modules may be implemented as machine learning models and perform classification, see at least [0066] and [0054]); and determining, based at least in part on executing a first simulation using the determination that the object is a reactive object, a first prediction (determine a set of predicted paths of one or more objects likely to intersect the region of interest, see at least [0062]), wherein: executing the first simulation using the determination that the object is a reactive object comprises determining a motion of a representation of the object based at least in part on the first candidate action (predicted paths of objects likely to intersect the region of interest are determined within a predetermined time interval or planning horizon, see at least [0098]); and at least one of the lower bound cost or the upper bound cost is based at least in part on the first simulation (cost of nodes 1511-1548 are associated with whether another vehicle or other object is likely to contact the AV 10 or intersect with a path of the AV or whether the object is likely to come sufficiently close to contacting the AV, see at least [0104]). Regarding claim 15, Gross discloses: A non-transitory computer-readable medium storing processor-executable instructions that, when executed by one or more processors, cause one or more processors to perform operations comprising (computer-readable storage device or media 46 to store executable instructions used by the controller, see at least [0038]; controller 34 includes at least one processor 44, see at least [0038]): determining a first candidate action for controlling motion of a vehicle (first node 1501 includes an initial state and proceeds in one of three directions 1571, 1572, or 1573, wherein 1571 is for AV 10 decelerating, see at least [0105]-[0106]); determining a first cost associated with the first candidate action (lattice of future states along with cost function for paths, see at least [0065] and [0084]; node 1511 has a cost associated therewith, see at least [0104]); determining a lower bound cost based at least in part on the first cost and an additional cost associated with an additional candidate action (next node using one of the directions includes node 1521 when decelerating, see at least [0113]), the lower bound cost being a minimum cost to move from a first state of the vehicle (cost associated with node 1511 is low, see at least [0107]; cost associated with node 1521 is low, see at least [0116]; lowest-cost path is described as 1501, 1511, and 1521, see at least [0126]); determining, based at least in part on a default action and the first candidate action, a second cost (from node 1511, node 1522 is when AV 10 is neither accelerating or decelerating, see at least [0113]; cost associated with node 1522, see at least [0116]); *Examiner sets forth that when a vehicle is not making any changes, hence not accelerating or decelerating, the vehicle is simply running in a continuing mode which reads on the “default action.” determining, based at least in part on the first cost and the second cost, an upper bound cost associated with the first candidate action (cost associated with node 1522 may be significantly high, see at least [0116]); determining whether to perform the first candidate action based at least in part on the lower bound cost and the upper bound cost (system determines lowest-cost path is described by nodes 1501, 1511, 1521, see at least [0126]; select a lowest total cost path for AV 10 to travel, see at least [0125]); and controlling the vehicle based at least in part on the first candidate action (selected path is implemented by AV 10, see at least [0126]). Gross does not explicitly recite: default action associated with a default control instruction However, However, Popov teaches: default action associated with a default control instruction (default behavior may be to stay in lane, see at least [0070]) It would have been obvious for one of ordinary skill in the art before the effective filing date of the claimed invention to have modified the cost determination and maintaining speed disclosed by Gross by adding the default behavior to stay in lane taught by Popov with a reasonable expectation of success. One of ordinary skill in the art would have been motivated to make this modification “so that the feasible behaviors may be matched up with the most desired behaviors output from the lane planner” (see [0070]). Furthermore, not changing a speed and direction is a default for a cruise setting. Regarding claim 16, The combination of Gross and Popov teaches the elements above and Gross further discloses: the default action associated with the default control instruction is: repeating the first candidate action after the first candidate action; or maintaining a speed (node 1522 if AV is neither accelerating or decelerating, see at least [0113]) Gross does not disclose: maintaining lane positioning of the vehicle However, Popov teaches: maintaining a speed and lane positioning of the vehicle after the first candidate action (default behavior may be to stay in lane, see at least [0070]) It would have been obvious for one of ordinary skill in the art before the effective filing date of the claimed invention to have modified the maintaining speed disclosed by Gross by adding the default behavior to stay in lane taught by Popov with a reasonable expectation of success. One of ordinary skill in the art would have been motivated to make this modification “so that the feasible behaviors may be matched up with the most desired behaviors output from the lane planner” (see [0070]). Furthermore, not changing a speed and direction is a default for a cruise setting. Regarding claim 17, The combination of Gross and Popov teaches the elements above and Gross further discloses: the upper bound cost associated with the first candidate action is a first upper bound cost, and wherein determining to perform the first candidate action is further based on determining that the first upper bound cost is less than a second upper bound cost associated with the additional candidate action (system determines lowest-cost path is described by nodes 1501, 1511, 1521, see at least [0126]; select a lowest total cost path for AV 10 to travel, see at least [0125]; cost associated with nodes 1522 and 1523 may be significantly high, see at least [0116]). Regarding claim 18, The combination of Gross and Popov teaches the elements above and Gross further discloses: the lower bound cost is defined to be the first cost based at least in part on determining that the first cost is less than the additional cost associated with the additional candidate action (system determines lowest-cost path is described by nodes 1501, 1511, 1521, see at least [0126]; select a lowest total cost path for AV 10 to travel, see at least [0125]) Regarding claim 19, The combination of Gross and Popov teaches the elements above and Gross further discloses: receiving sensor data indicating an object (receive and process signals from sensor system 28 to predict presence of objects, see at least [0039] and [0051]); determining, by a machine-learned model and based at least in part on the sensor data, that the object is a reactive object (predict classification and path of objects and features of the environment of the vehicle, see at least [0051]; avoiding moving objects; modules may be implemented as machine learning models and perform classification, see at least [0066] and [0054]); and determining, based at least in part on executing a first simulation using the determination that the object is a reactive object, a first prediction (determine a set of predicted paths of one or more objects likely to intersect the region of interest, see at least [0062]), wherein: executing the first simulation using the determination that the object is a reactive object comprises determining a motion of a representation of the object based at least in part on the first candidate action (predicted paths of objects likely to intersect the region of interest are determined within a predetermined time interval or planning horizon, see at least [0098]); and at least one of the lower bound cost or the upper bound cost is based at least in part on the first simulation (cost of nodes 1511-1548 are associated with whether another vehicle or other object is likely to contact the AV 10 or intersect with a path of the AV or whether the object is likely to come sufficiently close to contacting the AV, see at least [0104]) Claims 7, 13-14, and 20-21 are rejected under 35 U.S.C. 103 as being unpatentable over Gross and Popov as applied to claims 2, 8, and 15 above and further in view of Floyd-Jones et al. (U.S. Patent Application Publication No. 2020/0377085 A1; hereinafter Floyd-Jones). Regarding claim 7, The combination of Gross and Popov teaches the elements above and Gross further discloses: receiving sensor data indicating an object (receive and process signals from sensor system 28 to predict presence of objects, see at least [0039] and [0051]) determining, by a machine-learned model and based at least in part on the sensor data, the object (predict classification and path of objects and features of the environment of the vehicle, see at least [0051]; avoiding moving objects; modules may be implemented as machine learning models and perform classification, see at least [0066] and [0054]) Gross does not disclose: determining, by a machine-learned model and based at least in part on the sensor data, that the object is a passive object; and determining, based at least in part on modeling motion of the passive object, a first prediction, wherein: modeling the motion of the passive object comprises determining motion of the passive object based at least in part on a state of the object and exclusive of the first candidate action; and at least one of the lower bound cost or the upper bound cost is based at least in part on modeling the motion. However, Floyd-Jones teaches: determining, based at least in part on the sensor data, that the object is a passive object (sensors collect information to produce model of environment including movement of agents such as obstacle A 104, wherein object A moves away from the primary agent, see at least [0132]-[0133] and Fig. 1) *Examiner sets forth passive object is one that will not interact with the host vehicle (primary agent) ; and determining, based at least in part on modeling motion of the passive object (generate predicted trajectory for obstacle 104, see at least [0132]), a first prediction, wherein: modeling the motion of the passive object comprises determining motion of the passive object based at least in part on a state of the object and exclusive of the first candidate action (object behavior predicter generates one or more predicted trajectories of the dynamic obstacle such as indicating obstacle A 104 is currently on a trajectory heading in a particular direction, see at least [0132]-[0133]); and at least one of the lower bound cost or the upper bound cost is based at least in part on modeling the motion (motion planner adjusts cost values along edge in planning lattice based on the collision assessment to account for the predicted trajectories, see at least [0137]). It would have been obvious for one of ordinary skill in the art before the effective filing date of the claimed invention to have modified the object classification and path determination disclosed by Gross and the default behavior to stay in lane taught by Popov by adding the obstacle moving away taught by Floyd-Jones with a reasonable expectation of success. One of ordinary skill in the art would have been motivated to make this modification because such “functions may advantageously require less computational expense when performing collision assessment than motion equations for example by avoiding the need to evaluate trigonometric functions” (see [0005]). Regarding claim 13, The combination of Gross and Popov teaches the elements above and Gross further discloses: receiving sensor data indicating an object (receive and process signals from sensor system 28 to predict presence of objects, see at least [0039] and [0051]); determining, by a machine-learned model and based at least in part on the sensor data, the object (predict classification and path of objects and features of the environment of the vehicle, see at least [0051]; avoiding moving objects; modules may be implemented as machine learning models and perform classification, see at least [0066] and [0054]) Gross does not disclose: determining, by a machine-learned model and based at least in part on the sensor data, that the object is a passive object; and determining, based at least in part on modeling motion of the passive object, a first prediction, wherein: modeling the motion of the passive object comprises determining motion of the passive object based at least in part on a state of the object and exclusive of the first candidate action; and at least one of the lower bound cost or the upper bound cost is based at least in part on modeling the motion. However, Floyd-Jones teaches: determining, based at least in part on the sensor data, that the object is a passive object (sensors collect information to produce model of environment including movement of agents such as obstacle A 104, wherein object A moves away from the primary agent, see at least [0132]-[0133] and Fig. 1) *Examiner sets forth passive object is one that will not interact with the host vehicle (primary agent) ; and determining, based at least in part on modeling motion of the passive object (generate predicted trajectory for obstacle 104, see at least [0132]), a first prediction, wherein: modeling the motion of the passive object comprises determining motion of the passive object based at least in part on a state of the object and exclusive of the first candidate action (object behavior predicter generates one or more predicted trajectories of the dynamic obstacle such as indicating obstacle A 104 is currently on a trajectory heading in a particular direction, see at least [0132]-[0133]); and at least one of the lower bound cost or the upper bound cost is based at least in part on modeling the motion (motion planner adjusts cost values along edge in planning lattice based on the collision assessment to account for the predicted trajectories, see at least [0137]). It would have been obvious for one of ordinary skill in the art before the effective filing date of the claimed invention to have modified the object classification and path determination disclosed by Gross and the default behavior to stay in lane taught by Popov by adding the obstacle moving away taught by Floyd-Jones with a reasonable expectation of success. One of ordinary skill in the art would have been motivated to make this modification because such “functions may advantageously require less computational expense when performing collision assessment than motion equations for example by avoiding the need to evaluate trigonometric functions” (see [0005]). Regarding claim 14, the combination of Gross and Popov teaches the elements above but does not teach: determining, based at least in part on the sensor data, a likelihood that the object will modify a behavior in response to one or more of the first candidate action or the additional candidate action; and one of: determining to classify the object as a reactive object based at least in part on the likelihood meeting or exceeding a threshold; or determining to classify the object as a passive object based at least in part on the likelihood being less than or equal to the threshold. However, Floyd-Jones teaches: determining, based at least in part on the sensor data, a likelihood that the object will modify a behavior in response to one or more of the first candidate action or the additional candidate action (motion planner determines probability of collision, see at least [0154]) *Examiner sets forth collision requires modification of behavior from both parties determining to classify the object as a reactive object based at least in part on the likelihood meeting or exceeding a threshold; or determining to classify the object as a passive object based at least in part on the likelihood being less than or equal to the threshold (determine collision and assign weight with value greater than zero if probability of collision is greater than a particular threshold, see at least [0154]; motion planner assigns a weight with value greater than zero for probability of collision with dynamic obstacle B, see at least [0154]). *Examiner sets forth that dynamic object A does not have edges assigned with weight because it is moving away from the primary agent and does not meet the probability of collision It would have been obvious for one of ordinary skill in the art before the effective filing date of the claimed invention to have modified the object classification and path determination disclosed by Gross and the default behavior to stay in lane taught by Popov by adding the obstacle collision and pathing taught by Floyd-Jones with a reasonable expectation of success. One of ordinary skill in the art would have been motivated to make this modification because such “to identify a path 512 in the resulting planning lattice 500 that provides a route of travel of the primary agent 102 as specified by the path with a relatively low potential of a collision with dynamic obstacle” (see [0157]). Regarding claim 20, the combination of Gross and Popov teaches the elements above and Gross further discloses: receiving sensor data indicating an object (receive and process signals from sensor system 28 to predict presence of objects, see at least [0039] and [0051]) determining, by a machine-learned model and based at least in part on the sensor data, the object (predict classification and path of objects and features of the environment of the vehicle, see at least [0051]; avoiding moving objects; modules may be implemented as machine learning models and perform classification, see at least [0066] and [0054]) Gross does not disclose: determining, by a machine-learned model and based at least in part on the sensor data, that the object is a passive object; and determining, based at least in part on modeling motion of the passive object, a first prediction, wherein: modeling the motion of the passive object comprises determining motion of the passive object based at least in part on a state of the object and exclusive of the first candidate action; and at least one of the lower bound cost or the upper bound cost is based at least in part on modeling the motion. However, Floyd-Jones teaches: determining, based at least in part on the sensor data, that the object is a passive object (sensors collect information to produce model of environment including movement of agents such as obstacle A 104, wherein object A moves away from the primary agent, see at least [0132]-[0133] and Fig. 1) *Examiner sets forth passive object is one that will not interact with the host vehicle (primary agent) ; and determining, based at least in part on modeling motion of the passive object (generate predicted trajectory for obstacle 104, see at least [0132]), a first prediction, wherein: modeling the motion of the passive object comprises determining motion of the passive object based at least in part on a state of the object and exclusive of the first candidate action (object behavior predicter generates one or more predicted trajectories of the dynamic obstacle such as indicating obstacle A 104 is currently on a trajectory heading in a particular direction, see at least [0132]-[0133]); and at least one of the lower bound cost or the upper bound cost is based at least in part on modeling the motion (motion planner adjusts cost values along edge in planning lattice based on the collision assessment to account for the predicted trajectories, see at least [0137]). It would have been obvious for one of ordinary skill in the art before the effective filing date of the claimed invention to have modified the object classification and path determination disclosed by Gross and the default behavior to stay in lane taught by Popov by adding the obstacle moving away taught by Floyd-Jones with a reasonable expectation of success. One of ordinary skill in the art would have been motivated to make this modification because such “functions may advantageously require less computational expense when performing collision assessment than motion equations for example by avoiding the need to evaluate trigonometric functions” (see [0005]). Regarding claim 21, the combination of Gross and Popov teaches the elements above but does not teach: determining, based at least in part on the sensor data, a likelihood that the object will modify a behavior in response to one or more of the first candidate action or the additional candidate action; and one of: determining to classify the object as a reactive object based at least in part on the likelihood meeting or exceeding a threshold; or determining to classify the object as a passive object based at least in part on the likelihood being less than or equal to the threshold. However, Floyd-Jones teaches: determining, based at least in part on the sensor data, a likelihood that the object will modify a behavior in response to one or more of the first candidate action or the additional candidate action (motion planner determines probability of collision, see at least [0154]) *Examiner sets forth collision requires modification of behavior from both parties determining to classify the object as a reactive object based at least in part on the likelihood meeting or exceeding a threshold; or determining to classify the object as a passive object based at least in part on the likelihood being less than or equal to the threshold (determine collision and assign weight with value greater than zero if probability of collision is greater than a particular threshold, see at least [0154]; motion planner assigns a weight with value greater than zero for probability of collision with dynamic obstacle B, see at least [0154]). *Examiner sets forth that dynamic object A does not have edges assigned with weight because it is moving away from the primary agent and does not meet the probability of collision It would have been obvious for one of ordinary skill in the art before the effective filing date of the claimed invention to have modified the object classification and path determination disclosed by Gross and the default behavior to stay in lane taught by Popov by adding the obstacle collision and pathing taught by Floyd-Jones with a reasonable expectation of success. One of ordinary skill in the art would have been motivated to make this modification because such “to identify a path 512 in the resulting planning lattice 500 that provides a route of travel of the primary agent 102 as specified by the path with a relatively low potential of a collision with dynamic obstacle” (see [0157]). Conclusion Applicant's amendment necessitated the new ground(s) of rejection presented in this Office action. Accordingly, THIS ACTION IS MADE FINAL. See MPEP § 706.07(a). Applicant is reminded of the extension of time policy as set forth in 37 CFR 1.136(a). A shortened statutory period for reply to this final action is set to expire THREE MONTHS from the mailing date of this action. In the event a first reply is filed within TWO MONTHS of the mailing date of this final action and the advisory action is not mailed until after the end of the THREE-MONTH shortened statutory period, then the shortened statutory period will expire on the date the advisory action is mailed, and any nonprovisional extension fee (37 CFR 1.17(a)) pursuant to 37 CFR 1.136(a) will be calculated from the mailing date of the advisory action. In no event, however, will the statutory period for reply expire later than SIX MONTHS from the mailing date of this final action. Any inquiry concerning this communication or earlier communications from the examiner should be directed to HANA LEE whose telephone number is (571)272-5277. The examiner can normally be reached Monday-Friday: 7:30AM-4:30PM EST. 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, Jelani Smith can be reached at (571) 270-3969. 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. /H.L./Examiner, Art Unit 3662 /DALE W HILGENDORF/Primary Examiner, Art Unit 3662
Read full office action

Prosecution Timeline

Feb 06, 2024
Application Filed
Feb 15, 2024
Response after Non-Final Action
Mar 28, 2024
Response after Non-Final Action
Aug 08, 2025
Non-Final Rejection — §103, §112
Oct 21, 2025
Examiner Interview Summary
Oct 21, 2025
Applicant Interview (Telephonic)
Oct 28, 2025
Response Filed
Jan 18, 2026
Final Rejection — §103, §112
Mar 24, 2026
Examiner Interview Summary
Mar 24, 2026
Applicant Interview (Telephonic)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12534067
SYSTEM AND METHOD FOR VEHICLE NAVIGATION
2y 5m to grant Granted Jan 27, 2026
Patent 12509078
VEHICLE CONTROL DEVICE
2y 5m to grant Granted Dec 30, 2025
Patent 12485990
DRIVER ASSISTANCE SYSTEM
2y 5m to grant Granted Dec 02, 2025
Patent 12453305
MOBILE ROBOT SYSTEM AND BOUNDARY INFORMATION GENERATION METHOD FOR MOBILE ROBOT SYSTEM
2y 5m to grant Granted Oct 28, 2025
Patent 12442161
WORK MACHINE
2y 5m to grant Granted Oct 14, 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
60%
Grant Probability
96%
With Interview (+36.6%)
3y 0m
Median Time to Grant
Moderate
PTA Risk
Based on 141 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