Prosecution Insights
Last updated: November 11, 2026
Application No. 18/584,442

GOODS SORTING METHOD AND DEVICE, WAREHOUSE SYSTEM, AND STORAGE MEDIUM

Final Rejection §101§103
Filed
Feb 22, 2024
Priority
Aug 31, 2021 — CN 202111015111.6 +1 more
Examiner
CRAWLEY, TALIA F
Art Unit
3627
Tech Center
3600 — Transportation & Electronic Commerce
Assignee
Shenzhen Kubo Software Co. Ltd.
OA Round
2 (Final)
49%
Grant Probability
Moderate
3-4
OA Rounds
10m
Est. Remaining
74%
With Interview

Examiner Intelligence

Grants 49% of resolved cases
49%
Career Allowance Rate
417 granted / 857 resolved
-3.3% vs TC avg
Strong +25% interview lift
Without
With
+25.2%
Interview Lift
resolved cases with interview
Typical timeline
3y 7m
Avg Prosecution
35 currently pending
Career history
912
Total Applications
across all art units

Statute-Specific Performance

§101
26.9%
-13.1% vs TC avg
§103
43.2%
+3.2% vs TC avg
§102
19.5%
-20.5% vs TC avg
§112
5.1%
-34.9% vs TC avg
Black line = Tech Center average estimate • Based on career data from 857 resolved cases

Office Action

§101 §103
DETAILED ACTION Notice of Pre-AIA or AIA Status The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Disposition of Claims Claims 1-20 are pending in the instant application. Claim 6 has been cancelled. Claims 18 and 19 have been previously withdrawn. Claims 1, 5, 17, and 20 have been amended. No claims have been cancelled. Claims 1-5, 7-17, and 20 are rejected herein. The rejection of the pending claims is hereby made final. Response to Remarks The examiner has considered Applicant’s arguments pertaining to the rejection of the pending claims under 35 USC 101 but does not find said arguments to be persuasive. The examiner submits that the pending claims recited at least a method and non-transitory computer readable medium for goods sorting and planning, which both fall into one of the four statutory categories. The claims must then qualify as patent eligible subject matter. i.e., the claim must not be directed to a judicial exception unless the claim as a whole includes additional limitations amounting to significantly more than the exception. The judicial exceptions (also called "judicially recognized exceptions" or simply "exceptions") are subject matter that the courts have found to be outside of, or exceptions to, the four statutory categories of invention, and are limited to abstract ideas, laws of nature and natural phenomena (including products of nature). Alice Corp. Pty. Ltd. v. CLS Bank Int'l, 573 U.S. 208, 216, 110 USPQ2d 1976, 1980 (2014) (citing Ass'n for Molecular Pathology v. Myriad Genetics, Inc., 569 U.S. 576, 589, 106 USPQ2d 1972, 1979 (2013). See MPEP § 2106.04 for detailed information on the judicial exceptions. Because abstract ideas, laws of nature, and natural phenomenon "are the basic tools of scientific and technological work", the Supreme Court has expressed concern that monopolizing these tools by granting patent rights may impede innovation rather than promote it. See Alice Corp., 573 U.S. at 216, 110 USPQ2d at 1980; Mayo Collaborative Servs. v. Prometheus Labs., Inc., 566 U.S. 66, 71, 101 USPQ2d 1961, 1965 (2012). However, the Court has also emphasized that an invention is not considered to be ineligible for patenting simply because it involves a judicial exception. Alice Corp., 573 U.S. at 217, 110 USPQ2d at 1980-81 (citing Diamond v. Diehr, 450 U.S. 175, 187, 209 USPQ 1, 8 (1981)). See also Thales Visionix Inc. v. United States, 850 F.3d. 1343, 1349, 121 USPQ2d 1898, 1902 (Fed. Cir. 2017) ("That a mathematical equation is required to complete the claimed method and system does not doom the claims to abstraction."). Accordingly, the Court has said that integration of an abstract idea, law of nature or natural phenomenon into a practical application may be eligible for patent protection. See, e.g., Alice, 573 U.S. at 217, 110 USPQ2d at 1981 (explaining that "in applying the §101 exception, we must distinguish between patents that claim the ‘buildin[g] block[s]’ of human ingenuity and those that integrate the building blocks into something more" (quoting Mayo, 566 U.S. at 89, 110 USPQ2d at 1971) and stating that Mayo "set forth a framework for distinguishing patents that claim laws of nature, natural phenomena, and abstract ideas from those that claim patent-eligible applications of those concepts"); Mayo, 566 U.S. at 80, 84, 101 USPQ2d at 1969, 1971. The Supreme Court in Mayo laid out a framework for determining whether an applicant is seeking to patent a judicial exception itself, or a patent-eligible application of the judicial exception. See Alice Corp., 573 U.S. at 217-18, 110 USPQ2d at 1981 (citing Mayo, 566 U.S. 66, 101 USPQ2d 1961). This framework, which is referred to as the Mayo test or the Alice/Mayo test, is discussed in further detail in subsection III, below. The first part of the Mayo test is to determine whether the claims are directed to an abstract idea, a law of nature or a natural phenomenon (i.e., a judicial exception). Id. If the claims are directed to a judicial exception, the second part of the Mayo test is to determine whether the claim recites additional elements that amount to significantly more than the judicial exception. Id. citing Mayo, 566 U.S. at 72-73, 101 USPQ2d at 1966). The Supreme Court has described the second part of the test as the "search for an 'inventive concept'". Alice Corp., 573 U.S. at 217-18, 110 USPQ2d at 1981 (citing Mayo, 566 U.S. at 72-73, 101 USPQ2d at 1966). The examiner does agree that the broadest reasonable interpretation of the claim must be established and considered in the determination of patent eligibility under 35 USC 101. In considering the pending claims, the examiner submits the following: Claim 1 of the pending application (as well as the claims that depend therefrom) recite: A goods sorting method applied to a goods sorting device, wherein the method comprises: determining to-be-delivered goods corresponding to a target order, wherein the target order is an order in a future preset time period; determining target warehouse positions of the to-be-delivered goods according to a target operating workstation corresponding to the target order; and when the target warehouse positions of the to-be-delivered goods and storage warehouse positions of the to-be-delivered goods meet a transfer condition, controlling a robot to carry carrying the to-be-delivered goods to corresponding target warehouse positions, wherein the storage warehouse positions are warehouse positions at which the to-be-delivered goods are currently stored, the determining target warehouse positions of the to-be-delivered goods according to a target operating workstation corresponding to the target order comprises: calculating second distances between roadway exits of roadways and the target operating workstation; for each roadway, determining first scores of warehouse positions corresponding to the roadway according to third distances between the warehouse positions corresponding to the roadway and a roadway exit of the roadway; and repeating the following steps, until the target warehouse positions of all the to-be-delivered goods corresponding to the target order are determined: acquiring a first quantity of target warehouse positions corresponding to the roadways; determining roadway scores of the roadways according to the second distances and the first quantity; and for a current target roadway with the highest roadway score, in descending order of the first scores, determining, from warehouse positions of the target roadway that are not determined as target warehouse positions, a preset quantity of warehouse positions as a preset quantity of target warehouse positions of the to-be-delivered goods, and updating the first quantity for the target roadway according to the preset quantity, wherein the preset quantity is a quantity of layers of temporary storage shelving units of the robot. The language of at least claim 1 is reproduced above, with the significant structural language and method steps emboldened. In considering the claims, the examiner has taken into consideration the state of the art at the time of filing consistent with Applicant’s specification, as originally filed. The examiner further submits that the language of the computer readable storage medium as recited in independent claim 20, recites language that is similar to that recited in the method of claim 1, so that the 101 analysis as applied to claim 1, similarly applies to claim 20, at least based on its resemblance to claim 1. Based on the broadest reasonable interpretation of claim 1, it is clear that the pending claim 1 and similarly recited independent claim 20 falls into the judicial exception category of certain methods of organizing human activity, which includes fundamental economic principles or practices including hedging, insurance, mitigating risk); commercial or legal interactions (including agreements in the form of contracts; legal obligations; advertising, marketing or sales activities or behaviors; business relations); managing personal behavior or relationships or interactions between people (including social activities, teaching, and following rules or instructions) (see MPEP § 2106.04(a)(2), subsection II). The aforementioned categorization is evidenced at least in the steps of: “determining to-be-delivered goods corresponding to a target order, wherein the target order is an order in a future preset time period; determining target warehouse positions of the to-be-delivered goods according to a target operating workstation corresponding to the target order” (claim 1 of the pending application) which constitutes sales activities or behaviors, and therefore places the pending claim into the category of certain methods of organizing human activity. If the identified limitation(s) falls within at least one of the groupings of abstract ideas, it is reasonable to conclude that the claim recites an abstract idea in Step 2A Prong One. The claim then requires further analysis in Step 2A Prong Two, to determine whether any additional elements in the claim integrate the abstract idea into a practical application, see MPEP § 2106.04(d). The Supreme Court has identified a number of concepts falling within the "certain methods of organizing human activity" grouping as abstract ideas. In particular, in Alice, the Court concluded that the use of a third party to mediate settlement risk is a ‘‘fundamental economic practice’’ and thus an abstract idea. 573 U.S. at 219–20, 110 USPQ2d at 1982. In the aforementioned claims, the loan validator tool acts as an intermediary between the user and the merchant to effectuate a loan approval, making it a fundamental economic practice, that is being implemented on a computer processor. An example that would be considered analogous to the pending claims would be manual processing of a loan approval, Inventor Holdings, LLC v. Bed Bath Beyond, 876 F.3d 1372, 1378-79, 125 USPQ2d 1019, 1023 (Fed. Cir. 2017). The Supreme Court has long distinguished between principles themselves (which are not patent eligible) and the integration of those principles into practical applications (which are patent eligible). See, e.g., Mayo Collaborative Servs. v. Prometheus Labs., Inc., 566 U.S. 66, 80, 84, 101 USPQ2d 1961, 1968-69, 1970 (2012). The Federal Circuit has distinguished between claims that are ‘‘directed to’’ a judicial exception (which require further analysis to determine their eligibility) and those that are not (which are therefore patent eligible), e.g., claims that improve the functioning of a computer or other technology or technological field. See Diamond v. Diehr, 450 U.S. 175, 209 USPQ 1 (1981); Gottschalk v. Benson, 409 U.S. 63, 175 USPQ 673 (1972), MPEP 2106.06(b) (summarizing Enfish, LLC v. Microsoft Corp., 822 F.3d 1327, 118 USPQ2d 1684 (Fed. Cir. 2016), McRO, Inc. v. Bandai Namco Games Am. Inc., 837 F.3d 1299, 120 USPQ2d 1091 (Fed. Cir. 2016), and other cases that were eligible as improvements to technology or computer functionality instead of being directed to abstract ideas). Accordingly, after determining that a claim recites a judicial exception in Step 2A Prong One, examiners should evaluate whether the claim as a whole integrates the recited judicial exception into a practical application of the exception in Step 2A Prong Two. A claim that integrates a judicial exception into a practical application will apply, rely on, or use the judicial exception in a manner that imposes a meaningful limit on the judicial exception, such that the claim is more than a drafting effort designed to monopolize the judicial exception. The Supreme Court and Federal Circuit have identified a number of considerations as relevant to the evaluation of whether the claimed additional elements demonstrate that a claim is directed to patent-eligible subject matter. The list of considerations here is not intended to be exclusive or limiting. Additional elements can often be analyzed based on more than one type of consideration and the type of consideration is of no import to the eligibility analysis. Additional discussion of these considerations, and how they were applied in particular judicial decisions, is provided in MPEP § 2106.05(a) through (c) and MPEP § 2106.05(e) through (h). Limitations the courts have found indicative that an additional element (or combination of elements) may have integrated the exception into a practical application include: • An improvement in the functioning of a computer, or an improvement to other technology or technical field, as discussed in MPEP §§ 2106.04(d)(1) and 2106.05(a); • Applying or using a judicial exception to effect a particular treatment or prophylaxis for a disease or medical condition, as discussed in MPEP § 2106.04(d)(2); • Implementing a judicial exception with, or using a judicial exception in conjunction with, a particular machine or manufacture that is integral to the claim, as discussed in MPEP § 2106.05(b); • Effecting a transformation or reduction of a particular article to a different state or thing, as discussed in MPEP § 2106.05(c); and • Applying or using the judicial exception in some other meaningful way beyond generally linking the use of the judicial exception to a particular technological environment, such that the claim as a whole is more than a drafting effort designed to monopolize the exception, as discussed in MPEP § 2106.05(e). The courts have also identified limitations that did not integrate a judicial exception into a practical application: • Merely reciting the words "apply it" (or an equivalent) with the judicial exception, or merely including instructions to implement an abstract idea on a computer, or merely using a computer as a tool to perform an abstract idea, as discussed in MPEP § 2106.05(f); • Adding insignificant extra-solution activity to the judicial exception, as discussed in MPEP § 2106.05(g); and PNG media_image1.png 18 19 media_image1.png Greyscale • Generally linking the use of a judicial exception to a particular technological environment or field of use, as discussed in MPEP § 2106.05(h). Examiners evaluate integration into a practical application by: (1) identifying whether there are any additional elements recited in the claim beyond the judicial exception(s); and (2) evaluating those additional elements individually and in combination to determine whether they integrate the exception into a practical application, using one or more of the considerations introduced in subsection I supra, and discussed in more detail in MPEP §§ 2106.04(d)(1), 2106.04(d)(2), 2106.05(a) through (c) and 2106.05(e) through (h). In determining if the language of the pending claims integrate the judicial exception into a practical application, the examiner identifies the method steps and the system components of exemplary claim 1, which are provided in bold below: Claim 1. : A goods sorting method applied to a goods sorting device, wherein the method comprises: determining to-be-delivered goods corresponding to a target order, wherein the target order is an order in a future preset time period; determining target warehouse positions of the to-be-delivered goods according to a target operating workstation corresponding to the target order; and when the target warehouse positions of the to-be-delivered goods and storage warehouse positions of the to-be-delivered goods meet a transfer condition, controlling a robot to carry carrying the to-be-delivered goods to corresponding target warehouse positions, wherein the storage warehouse positions are warehouse positions at which the to-be-delivered goods are currently stored, the determining target warehouse positions of the to-be-delivered goods according to a target operating workstation corresponding to the target order comprises: calculating second distances between roadway exits of roadways and the target operating workstation; for each roadway, determining first scores of warehouse positions corresponding to the roadway according to third distances between the warehouse positions corresponding to the roadway and a roadway exit of the roadway; and repeating the following steps, until the target warehouse positions of all the to-be-delivered goods corresponding to the target order are determined: acquiring a first quantity of target warehouse positions corresponding to the roadways; determining roadway scores of the roadways according to the second distances and the first quantity; and for a current target roadway with the highest roadway score, in descending order of the first scores, determining, from warehouse positions of the target roadway that are not determined as target warehouse positions, a preset quantity of warehouse positions as a preset quantity of target warehouse positions of the to-be-delivered goods, and updating the first quantity for the target roadway according to the preset quantity, wherein the preset quantity is a quantity of layers of temporary storage shelving units of the robot. A claim reciting a judicial exception is not directed to the judicial exception if it also recites additional elements demonstrating that the claim as a whole integrates the exception into a practical application. One way to demonstrate such integration is when the claimed invention improves the functioning of a computer or improves another technology or technical field. The application or use of the judicial exception in this manner meaningfully limits the claim by going beyond generally linking the use of the judicial exception to a particular technological environment and thus transforms a claim into patent-eligible subject matter. Such claims are eligible at Step 2A because they are not "directed to" the recited judicial exception. The courts have not provided an explicit test for this consideration but have instead illustrated how it is evaluated in numerous decisions. These decisions, and a detailed explanation of how examiners should evaluate this consideration are provided in MPEP § 2106.05(a). In short, first the specification should be evaluated to determine if the disclosure provides sufficient details such that one of ordinary skill in the art would recognize the claimed invention as providing an improvement. The specification need not explicitly set forth the improvement, but it must describe the invention such that the improvement would be apparent to one of ordinary skill in the art. Conversely, if the specification explicitly sets forth an improvement but in a conclusory manner (i.e., a bare assertion of an improvement without the detail necessary to be apparent to a person of ordinary skill in the art), the examiner should not determine the claim improves technology. Second, if the specification sets forth an improvement in technology, the claim must be evaluated to ensure that the claim itself reflects the disclosed improvement. That is, the claim includes the components or steps of the invention that provide the improvement described in the specification. The claim itself does not need to explicitly recite the improvement described in the specification (e.g., "thereby increasing the bandwidth of the channel"). One of ordinary skill in the art would recognize that Applicant’s specification fails to identify or explicitly disclose any improvement in the function of a computer or any other technology or technological field, as evidenced by the aforementioned citations from Applicant’s specification. Applicant’s specification merely combines generic, well understood computing elements in the performance of the well understood, routine, and conventional steps. Claims 2-5 and 7-17 fail to cure the deficiencies under 35 USC 101 of the claims from which they depend and are similarly rejected for the same reasoning as applied to independent claim 1, and similarly recited claim 20. For the aforementioned reasoning, the claims are found to be ineligible, and the rejection of the pending claims in view of 35 USC 101 is hereby maintained and made final. Applicant’s arguments pertaining to the rejection of the pending claims under 35 USC 102(a)(1) and 103, in view of the applied prior art of record, are found to be moot in view of the new grounds of rejection as presented below. Claim Rejections - 35 USC § 101 35 U.S.C. 101 reads as follows: Whoever invents or discovers any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof, may obtain a patent therefor, subject to the conditions and requirements of this title. Claims 1-5, 7-17 and 20 are rejected under 35 U.S.C. 101 because the claimed invention is directed to a judicial exception (an abstract idea) without significantly more. Under 2106.03 Eligibility step 1, it must be considered whether the claims are directed to one of the four statutory classes of invention. In the instant case, claims 1-17 are directed to a method, and claim 20 is directed towards a non transitory computer storage medium, each of which falls within one of the four statutory categories of inventions (process/apparatus). Accordingly, the claims will be further analyzed under 2106.04 Eligibility step 2A: Under 2106.04 Eligibility step 2A, it must be considered whether the claims are “directed to” a judicial exception by referring to the groupings of subject matter. 2106.04, certain methods of organizing human activity include fundamental economic principles or practices (including hedging, insurance, mitigating risk); commercial or legal interactions (including agreements in the form of contracts; legal obligations; advertising, marketing or sales activities or behaviors; business relations); managing personal behavior or relationships or interactions between people (including social activities, teaching, and following rules or instructions). Regarding representative independent claim 1, the claim sets forth a method for goods sorting in a warehouse environment, in the following limitations: determining to-be-delivered goods in a target order, wherein the target order is an order that is to be fulfilled within a predetermined time in the future; determining a target warehouse position of a piece of to-be-delivered goods according to a target operating workstation corresponding to the target order; when the target warehouse position of the piece of to-be-delivered goods and a storage warehouse position of the piece of to-be-delivered goods meet a transfer condition, controlling a robot to transport the piece of to-be-delivered goods to the target warehouse position, wherein the storage warehouse position is a warehouse position at which the piece of to-be-delivered goods is currently stored; calculating second distances between roadway exits of roadways and the target operating workstation; for each roadway, determining first scores of warehouse positions corresponding to the roadway according to third distances between the warehouse positions corresponding to the roadway and a roadway exit of the roadway; repeating the following steps, until the target warehouse positions of all the to-be-delivered goods corresponding to the target order are determined: acquiring a first quantity of target warehouse positions corresponding to the roadways; determining roadway scores of the roadways according to the second distances and the first quantity; determining, from warehouse positions of the target roadway that are not determined as target warehouse positions, a preset quantity of warehouse positions as a preset quantity of target warehouse positions of the to-be-delivered goods, and updating the first quantity for the target roadway according to the preset quantity, wherein the preset quantity is a quantity of layers of temporary storage shelving units of the robot The above-recited limitations set forth an arrangement to determine optimal item positioning in a warehouse environment. This arrangement amounts to certain methods of organizing human activity associated with sales activities and commercial interactions. Such concepts have been considered ineligible certain methods of organizing human activity by the Courts (See 2019 Revised Patent Subject Matter Eligibility Guidance). Under 2106.04 Eligibility step 2A (prong 2), the next step in the eligibility analysis looks at whether the abstract idea is integrated into a practical application. This requires an additional element or combination of additional elements in the claims to apply, rely on, or use the judicial exception in a manner that imposes a meaningful limit on the judicial exception, such that the claim is more than a drafting effort designed to monopolize the exception. In this instance, the claims recite the additional elements such as: A robot (claim 1) However, this element does not amount to an improvement in the functioning of a computer or any other technology or technical field, apply the judicial exception with, or by use of, a particular machine, or apply or use the judicial exception in some other meaningful way beyond generally linking the use of the judicial exception to a particular technological environment, such that the claim as a whole is more than a drafting effort designed to monopolize the exception. In addition, the recitations above are recited at a high level of generality and also do not amount to an improvement in the functioning of a computer or any other technology or technical field, apply the judicial exception with, or by use of, a particular machine, or apply or use the judicial exception in some other meaningful way beyond generally linking the use of the judicial exception to a particular technological environment, such that the claim as a whole is more than a drafting effort designed to monopolize the exception. Independent claim 20 and dependent claims 2-17 also fail to recite elements which amount to an improvement in the functioning of a computer or any other technology or technical field, apply the judicial exception with, or by use of, a particular machine, or apply or use the judicial exception in some other meaningful way beyond generally linking the use of the judicial exception to a particular technological environment, such that the claim as a whole is more than a drafting effort designed to monopolize the exception. For example, independent claims and dependent claims are directed to the abstract idea itself and do not amount to an integration according to any one of the considerations above. Step 2B is the next step in the eligibility analyses and evaluates whether the claims recite additional elements that amount to an inventive concept (i.e., “significantly more”) than the recited judicial exception. According to Office procedure, revised Step 2A overlaps with Step 2B, and thus, many of the considerations need not be re-evaluated in Step 2B because the answer will be the same. In Step 2A, several additional elements were identified as additional limitations: A robot (claim 1) These additional limitations, including the limitations in the independent claims and dependent claims, do not amount to an inventive concept because they were already analyzed under Step 2A and did not amount to a practical application of the abstract idea. For these reasons, the claims are rejected under 35 U.S.C. 101. Appropriate correction and/or clarification is required. Claim Rejections - 35 USC § 103 In the event the determination of the status of the application as subject to AIA 35 U.S.C. 102 and 103 (or as subject to pre-AIA 35 U.S.C. 102 and 103) is incorrect, any correction of the statutory basis (i.e., changing from AIA to pre-AIA ) for the rejection will not be considered a new ground of rejection if the prior art relied upon, and the rationale supporting the rejection, would be the same under either status. The following is a quotation of 35 U.S.C. 103 which forms the basis for all obviousness rejections set forth in this Office action: A patent for a claimed invention may not be obtained, notwithstanding that the claimed invention is not identically disclosed as set forth in section 102, if the differences between the claimed invention and the prior art are such that the claimed invention as a whole would have been obvious before the effective filing date of the claimed invention to a person having ordinary skill in the art to which the claimed invention pertains. Patentability shall not be negated by the manner in which the invention was made. Claims 1, 9, 11, 13-17, and 20 are rejected under 35 U.S.C. 103 as being unpatentable over Li et al (US 2020/0302391) in view of Hance et al (US 2019/0062055). Regarding claim 1, the prior art discloses a goods sorting method applied to a goods sorting device, comprising: determining to-be-delivered goods in a target order, wherein the target order is an order that is to be fulfilled within a predetermined time in the future (see at least paragraph [0068] to Li et al, wherein the staff can customize the order classifications dimensions, such as the owner, the warehouse area, the outbound type, the shipper, the cut-off time, and the order priority. The configuration of cut-off time allows the staff to select a certain period of time for picking the pending orders in the period of time). With the order priority, the pending order with higher order priority is preferentially processed according to the preset order priority; determining a target warehouse position of a piece of to-be-delivered goods according to a target operating workstation corresponding to the target order (see at least paragraph [0117] to Li et al, wherein the robot scheduling module 330 is configured to schedule the target robot at least partly according to the position information of the target workstation to control the target robot to carry the target inventory container matching the order item to the target workstation); and when the target warehouse position of the piece of to-be-delivered goods and a storage warehouse position of the piece of to-be-delivered goods meet a transfer condition (see at least paragraph [0199] to Li et al, target condition), controlling a robot to carry the piece of to-be-delivered goods to the target warehouse position, wherein the storage warehouse position is a warehouse position at which the piece of to-be-delivered goods is currently stored (see at least paragraph [0203] to Li et al, wherein the picking order group processing module 1320 is further configured to determine a target inventory container at least partly according to target order information, inventory information, and an inventory container selection strategy; determine a first target robot according to the target inventory container and the optimal path for a robot to reach the target inventory container, and control the first target robot to carry the target inventory container). Li et al does not appear to explicitly disclose the determining target warehouse positions of the to-be-delivered goods according to a target operating workstation corresponding to the target order comprises: calculating second distances between roadway exits of roadways and the target operating workstation; for each roadway, determining first scores of warehouse positions corresponding to the roadway according to third distances between the warehouse positions corresponding to the roadway and a roadway exit of the roadway; and repeating the following steps, until the target warehouse positions of all the to-be-delivered goods corresponding to the target order are determined: acquiring a first quantity of target warehouse positions corresponding to the roadways; determining roadway scores of the roadways according to the second distances and the first quantity; and for a current target roadway with the highest roadway score, in descending order of the first scores, determining, from warehouse positions of the target roadway that are not determined as target warehouse positions, a preset quantity of warehouse positions as a preset quantity of target warehouse positions of the to-be-delivered goods, and updating the first quantity for the target roadway according to the preset quantity, wherein the preset quantity is a quantity of layers of temporary storage shelving units of the robot. However, Hance et al discloses a robot inventory updating system and method for order routing, wherein the determining target warehouse positions of the to-be-delivered goods according to a target operating workstation corresponding to the target order comprises: calculating second distances between roadway exits of roadways and the target operating workstation; for each roadway, determining first scores of warehouse positions corresponding to the roadway according to third distances between the warehouse positions corresponding to the roadway and a roadway exit of the roadway; and repeating the following steps, until the target warehouse positions of all the to-be-delivered goods corresponding to the target order are determined: acquiring a first quantity of target warehouse positions corresponding to the roadways; determining roadway scores of the roadways according to the second distances and the first quantity; and for a current target roadway with the highest roadway score, in descending order of the first scores, determining, from warehouse positions of the target roadway that are not determined as target warehouse positions, a preset quantity of warehouse positions as a preset quantity of target warehouse positions of the to-be-delivered goods, and updating the first quantity for the target roadway according to the preset quantity, wherein the preset quantity is a quantity of layers of temporary storage shelving units of the robot (see at least paragraphs [0035-0041] and [0046] to Hance et al, wherein n order routing system may have different levels of visibility into separate warehouses. For instance, a first warehouse may be fully automated with a WMS fully integrated with the order routing system, a second warehouse may have a WMS that is not in communication with the order routing system, and a third warehouse may be a semi-automated warehouse with both robotic actors and human actors. However, robots that are in communication with the order routing system may be deployed in each of the three warehouses. The robots allow for the creation of a mirrored database with the positions of all inventory at each of the three warehouses even without direct integration with the WMS at each warehouse. A single system that receives robot inventory updates across a network of warehouses and also controls the order pipeline between warehouses has improved visibility to route orders). The examiner recognizes that obviousness may be established by combining or modifying the teachings of the prior art to produce the claimed invention where there is some teaching, suggestion, or motivation to do so found either in the references themselves or in the knowledge generally available to one of ordinary skill in the art. See In re Fine, 837 F.2d 1071, 5 USPQ2d 1596 (Fed. Cir. 1988), In re Jones, 958 F.2d 347, 21 USPQ2d 1941 (Fed. Cir. 1992), and KSR International Co. v. Teleflex, Inc., 550 U.S. 398, 82 USPQ2d 1385 (2007). The examiner submits that the combination of the teaching of the order processing system and method, as disclosed by Li et al and the system and method for robot inventory updates for order routing, as taught by Hance et al, in order to improve order fulfillment times and efficiency, and reduce bottlenecks, could have been readily and easily implemented, with a reasonable expectation of success. As such, the aforementioned combination is found to be obvious to try, given the state of the art at the time of filing. Regarding claim 9, the prior art discloses the method according to claim 8, wherein the sequentially determining, in descending order of roadway scores, first warehouse positions in the roadway as the target warehouse positions of the to-be-delivered goods in the target order comprises: sequentially determining, in descending order of roadway scores and descending order of the first scores in the roadways, a corresponding quantity of first warehouse positions as the target warehouse positions of the to-be-delivered goods in the target order, and ignoring a roadway whose quantity of the first warehouse positions is 0 (see at least paragraph [0163] to Li et al). The examiner submits that the combination of the teaching of the order processing system and method, as disclosed by Li et al and the system and method for robot inventory updates for order routing, as taught by Hance et al, in order to improve order fulfillment times and efficiency, and reduce bottlenecks, could have been readily and easily implemented, with a reasonable expectation of success. As such, the aforementioned combination is found to be obvious to try, given the state of the art at the time of filing. Regarding claim 11, the prior art discloses the method according to claim 1, further comprising: for each of the to-be-delivered goods, determining a warehouse-position type of each of the to-be-delivered goods; and correspondingly, the determining a target warehouse position of a piece of to-be-delivered goods according to a target operating workstation corresponding to the target order comprises: determining, according to the target operating workstation corresponding to the target order and the warehouse-position type of the piece of to-be-delivered goods, the target warehouse position matching the warehouse-position type of the piece of to-be-delivered goods (see at least paragraph [0270] to Li et al, wherein each inventory container corresponds to an order item type, and has an inventory container identification (ID) and an order item type identification of the order item stored in the inventory container. The order item type identification and the inventory container ID are stored in an ID memory of the inventory container, and can be synchronized to a server through a communication module on the inventory container). The examiner submits that the combination of the teaching of the order processing system and method, as disclosed by Li et al and the system and method for robot inventory updates for order routing, as taught by Hance et al, in order to improve order fulfillment times and efficiency, and reduce bottlenecks, could have been readily and easily implemented, with a reasonable expectation of success. As such, the aforementioned combination is found to be obvious to try, given the state of the art at the time of filing. Regarding claim 13, the prior art discloses the method according to claim 1, further comprising: determining an allocation sequence of the to-be-delivered goods in the target order, so as to sequentially allocate target warehouse positions to the to-be-delivered goods in the target order based on the allocation sequence (see at least paragraph [0122] to Li et al, wherein the workstation allocating and matching module 320 is further configured to sequentially match, according to parameters of the order items in the pending orders in each batch of task). The examiner submits that the combination of the teaching of the order processing system and method, as disclosed by Li et al and the system and method for robot inventory updates for order routing, as taught by Hance et al, in order to improve order fulfillment times and efficiency, and reduce bottlenecks, could have been readily and easily implemented, with a reasonable expectation of success. As such, the aforementioned combination is found to be obvious to try, given the state of the art at the time of filing. Regarding claim 14, the prior art discloses the method according to claim 1, wherein that the target warehouse position of the piece of to-be-delivered goods and a storage warehouse position of the piece of to-be-delivered goods meet a transfer condition comprises: the target warehouse position of the piece of to-be-delivered goods and the storage warehouse position of the piece of to-be-delivered goods are not in a same roadway; or the target warehouse position of the piece of to-be-delivered goods exceed a preset range of the storage warehouse position of the piece of to-be-delivered goods; or the target warehouse position of a piece of to-be-delivered goods and the storage warehouse position of the piece of to-be-delivered goods are not a same warehouse position (see at least paragraph [0122] to Li et al, wherein the workstation allocating and matching module 320 is further configured to sequentially match, according to parameters of the order items in the pending orders in each batch of task, a target inventory container pool corresponding to the target workstation and a target inventory container other than the inventory container pool in the inventory container area, and take the inventory container with the quantity of order items in each batch of task exceeding a second threshold as the target inventory container). The examiner submits that the combination of the teaching of the order processing system and method, as disclosed by Li et al and the system and method for robot inventory updates for order routing, as taught by Hance et al, in order to improve order fulfillment times and efficiency, and reduce bottlenecks, could have been readily and easily implemented, with a reasonable expectation of success. As such, the aforementioned combination is found to be obvious to try, given the state of the art at the time of filing. Regarding claim 15, the prior art discloses the method according to claim 1, wherein the determining to-be-delivered goods in a target order comprises: determining the to-be-delivered goods in the target order according to an order requirement of the target order and the target operating workstation corresponding to the target order (see at least paragraph [0017] to Li et al, wherein The allocating and selecting module is configured to allocate the batch of task to a corresponding target workstation for any of the at least one batch task, select a target inventory container matching an order item for a pending order in the batch of task, and select a target robot for transferring the target inventory container for the batch of task). The examiner submits that the combination of the teaching of the order processing system and method, as disclosed by Li et al and the system and method for robot inventory updates for order routing, as taught by Hance et al, in order to improve order fulfillment times and efficiency, and reduce bottlenecks, could have been readily and easily implemented, with a reasonable expectation of success. As such, the aforementioned combination is found to be obvious to try, given the state of the art at the time of filing. Regarding claim 16, the prior art discloses the method according to claim 1, further comprising: determining the target operating workstation of the target order according to a production line corresponding to the target order (see at least paragraph [0017] to Li et al, wherein The allocating and selecting module is configured to allocate the batch of task to a corresponding target workstation for any of the at least one batch task, select a target inventory container matching an order item for a pending order in the batch of task, and select a target robot for transferring the target inventory container for the batch of task). The examiner submits that the combination of the teaching of the order processing system and method, as disclosed by Li et al and the system and method for robot inventory updates for order routing, as taught by Hance et al, in order to improve order fulfillment times and efficiency, and reduce bottlenecks, could have been readily and easily implemented, with a reasonable expectation of success. As such, the aforementioned combination is found to be obvious to try, given the state of the art at the time of filing. Regarding claim 17, the prior art discloses the method according to claim 1, wherein when the target warehouse position of the piece of to-be-delivered goods is occupied by a piece of occupying goods, the method further comprises: controlling the robot to take out the piece of occupying goods from the target warehouse position; and correspondingly, the controlling a robot to carry the piece of to-be-delivered goods to the target warehouse position comprises: after the piece of occupying goods is taken out, controlling the robot to store the piece of to-be-delivered goods at the target warehouse position (see at least paragraph [0018] to Li et al, wherein The robot controlling module is configured to control the target robot to transfer the target inventory container matching the order item to the target workstation corresponding to the batch of task). The examiner submits that the combination of the teaching of the order processing system and method, as disclosed by Li et al and the system and method for robot inventory updates for order routing, as taught by Hance et al, in order to improve order fulfillment times and efficiency, and reduce bottlenecks, could have been readily and easily implemented, with a reasonable expectation of success. As such, the aforementioned combination is found to be obvious to try, given the state of the art at the time of filing. Claims 2-5, 7, 8, 10, and 12 are rejected under 35 U.S.C. 103 as being unpatentable over Li et al (US 2020/0302391) in view of Hance et al (US 2019/0062055) and further in view of Wintz et al (US 2022/0388783). Regarding claim 2, the prior art references in combination disclose the method according to claim 1, with Wintz et al further disclosing wherein the determining a target warehouse position of a piece to-be-delivered goods according to a target operating workstation corresponding to the target order comprises: determining a warehouse position score of each warehouse position of a warehouse system according to the target operating workstation; and determining the target warehouse position of the piece of to-be-delivered goods according to the warehouse position score of each warehouse position (see at least paragraph [0007] to Wintz et al, wherein a set of available storage locations from among a plurality of storage locations in the warehouse; determining, by the computing system, a score for each respective storage location of the set of available storage locations based on multiple sub-scores specific to the respective storage location, to generate a set of scores corresponding to the set of available storage locations). The examiner recognizes that obviousness may be established by combining or modifying the teachings of the prior art to produce the claimed invention where there is some teaching, suggestion, or motivation to do so found either in the references themselves or in the knowledge generally available to one of ordinary skill in the art. See In re Fine, 837 F.2d 1071, 5 USPQ2d 1596 (Fed. Cir. 1988), In re Jones, 958 F.2d 347, 21 USPQ2d 1941 (Fed. Cir. 1992), and KSR International Co. v. Teleflex, Inc., 550 U.S. 398, 82 USPQ2d 1385 (2007). The examiner submits that the combination of the teaching of the order processing system and method, as disclosed by Li et al and the system and method for robot inventory updates for order routing, as taught by Hance et al, further in view of the system and method for determining locations at which to store items in a storage facility, as taught by Wintz et al, in order to improve order fulfillment times and efficiency, and reduce bottlenecks, could have been readily and easily implemented, with a reasonable expectation of success. As such, the aforementioned combination is found to be obvious to try, given the state of the art at the time of filing. Regarding claim 3, the prior art references in combination disclose the method according to claim 2, with Wintz et al further disclosing wherein the determining a warehouse position score of each warehouse position of a warehouse system according to the target operating workstation comprises: for each warehouse position, calculating a first distance between the warehouse position of the warehouse system and the target operating workstation; and determining the warehouse position score of the warehouse position according to the first distance (see at least paragraph [0014] to Wintz et al, wherein there is a subscore based on the distance and travel time). The examiner submits that the combination of the teaching of the order processing system and method, as disclosed by Li et al and the system and method for robot inventory updates for order routing, as taught by Hance et al, further in view of the system and method for determining locations at which to store items in a storage facility, as taught by Wintz et al, in order to improve order fulfillment times and efficiency, and reduce bottlenecks, could have been readily and easily implemented, with a reasonable expectation of success. As such, the aforementioned combination is found to be obvious to try, given the state of the art at the time of filing. Regarding claim 4, the prior art references in combination disclose the method according to claim 3, with Wintz et al further disclosing wherein the determining the warehouse position score of the warehouse position according to the first distance comprises: determining the warehouse position score of the warehouse position according to the first distance and a warehouse position height of the warehouse position (see at least paragraph [0046] to Wintz et al, wherein Some of the parameters that are weighted in the favorability score include height of the location, height of the item, maximum weight the location can carry, weight of the item, picking rate or velocity of the location, picking rate or velocity of the item, distance from a current location of the item to the location). The examiner submits that the combination of the teaching of the order processing system and method, as disclosed by Li et al and the system and method for robot inventory updates for order routing, as taught by Hance et al, further in view of the system and method for determining locations at which to store items in a storage facility, as taught by Wintz et al, in order to improve order fulfillment times and efficiency, and reduce bottlenecks, could have been readily and easily implemented, with a reasonable expectation of success. As such, the aforementioned combination is found to be obvious to try, given the state of the art at the time of filing. Regarding claim 5, the prior art references in combination disclose the method according to claim 2, with Wintz et al further disclosing wherein the determining a warehouse position score of each warehouse position of a warehouse system according to the target operating workstation comprises: for each roadway of the warehouse system, calculating a second distance between a roadway exit of a roadway and the target operating workstation, wherein the roadway is a passage that is between two adjacent storage shelving units and is used for the robot to walk, and each storage shelving unit comprises one or more warehouse positions configured to store goods; acquiring a first quantity, wherein the first quantity is the number of the target warehouse position in the roadway; determining a roadway score of the roadway according to the second distance and the first quantity; and for each warehouse position, determining a warehouse position score of the warehouse position according to the roadway score of the roadway corresponding to the warehouse position and a distance between the warehouse position and the roadway exit of the roadway (see at least paragraph [0063] to Wintz et al, wherein the item 112 can be routed along three paths 119, 118, and 120. The route 120 can take the most amount of time to reach destination 110C, so destination 110C can be assigned a least favorable score of 5. Travel times for destinations 110A and 110B can therefore be compared (202). Destination 110A can be assigned the most favorable score for one or more reasons, as described in reference to FIGS. 4C and 4H. For example, the route 119 may not have any traffic, may have minimal traffic in comparison to the routes 118 and 120, may be a less frequented route for movement throughout the storage facility, the destination 110A may be closer to a current location of the item 112 than destinations 110B and 110C, and/or few or no items may currently be routed along the route 119). The examiner submits that the combination of the teaching of the order processing system and method, as disclosed by Li et al and the system and method for robot inventory updates for order routing, as taught by Hance et al, further in view of the system and method for determining locations at which to store items in a storage facility, as taught by Wintz et al, in order to improve order fulfillment times and efficiency, and reduce bottlenecks, could have been readily and easily implemented, with a reasonable expectation of success. As such, the aforementioned combination is found to be obvious to try, given the state of the art at the time of filing. Regarding claim 7, the prior art references in combination disclose the method according to claim 1, with Wintz et al further disclosing wherein the determining a target warehouse position of a piece of to-be-delivered goods according to a target operating workstation corresponding to the target order comprises: for each roadway of the warehouse system, calculating a second distance between a roadway exit of a roadway and the target operating workstation; determining a congestion coefficient of the roadway; determining a roadway score of the roadway according to the second distance and the congestion coefficient; for each warehouse position in the roadway, determining a first score of a warehouse position in the roadway according to a third distance between the warehouse position in the roadway and the roadway exit of the roadway; and determining the target warehouse position of the piece of to-be-delivered goods in the target order according to the first score of the warehouse position and the roadway score of the roadway (see at least paragraph [0114] to Wintz et al). The examiner submits that the combination of the teaching of the order processing system and method, as disclosed by Li et al and the system and method for robot inventory updates for order routing, as taught by Hance et al, further in view of the system and method for determining locations at which to store items in a storage facility, as taught by Wintz et al, in order to improve order fulfillment times and efficiency, and reduce bottlenecks, could have been readily and easily implemented, with a reasonable expectation of success. As such, the aforementioned combination is found to be obvious to try, given the state of the art at the time of filing. Regarding claim 8, the prior art references in combination disclose the method according to claim 7, with Wintz et al further disclosing wherein the determining the target warehouse position of the piece of to-be-delivered goods in the target order according to the first score of the warehouse position and the roadway score of the roadway comprises: sequentially determining, in descending order of roadway scores, first warehouse positions in the roadway as the target warehouse positions of the to-be-delivered goods in the target order, wherein each first warehouse position is a warehouse position whose first score is greater than a preset score (see at least paragraph [0079] to Wintz et al). The examiner submits that the combination of the teaching of the order processing system and method, as disclosed by Li et al and the system and method for robot inventory updates for order routing, as taught by Hance et al, further in view of the system and method for determining locations at which to store items in a storage facility, as taught by Wintz et al, in order to improve order fulfillment times and efficiency, and reduce bottlenecks, could have been readily and easily implemented, with a reasonable expectation of success. As such, the aforementioned combination is found to be obvious to try, given the state of the art at the time of filing. Regarding claim 10, the prior art references in combination disclose the method according to claim 8, with Wintz et al further disclosing wherein after the sequentially determining, in descending order of roadway scores, first warehouse positions in the roadway as the target warehouse positions of the to-be-delivered goods in the target order, the method further comprises: acquiring to-be-delivered goods in a next target order (see at least paragraph [0134] to Wintz et al); updating the congestion coefficient of the first roadway according to quantities of target warehouse positions in a first roadway, wherein the first roadway is a roadway that is among the roadways and in which at least one warehouse position is determined as a target warehouse position (see at least paragraph [0129] to Wintz et al); updating the roadway score of the first roadway according to the second distance and the updated congestion coefficient of the first roadway (see at least paragraph [0129] to Wintz et al); and sequentially determining, in descending order of roadway scores, the first warehouse positions in the roadway as the target warehouse positions of the to-be-delivered goods corresponding to the next target order (see at least paragraph [0138] to Wintz et al). The examiner submits that the combination of the teaching of the order processing system and method, as disclosed by Li et al and the system and method for robot inventory updates for order routing, as taught by Hance et al, further in view of the system and method for determining locations at which to store items in a storage facility, as taught by Wintz et al, in order to improve order fulfillment times and efficiency, and reduce bottlenecks, could have been readily and easily implemented, with a reasonable expectation of success. As such, the aforementioned combination is found to be obvious to try, given the state of the art at the time of filing. Regarding claim 12, the prior art references in combination disclose the method according to claim 11, with Wintz et al further disclosing wherein the determining, according to the target operating workstation corresponding to the target order and the warehouse-position type of the piece of to-be-delivered goods, the target warehouse position matching the warehouse- position type of the piece of to-be-delivered goods comprises: for to-be-delivered goods of a same warehouse-position type, determining candidate warehouse positions matching the warehouse-position type; determining warehouse position scores of the candidate warehouse positions according to the target operating workstation (see at least paragraph [0066] to Wintz et al); and sequentially determining, in descending order of the warehouse position scores, the candidate warehouse positions as the target warehouse positions of the to-be-delivered goods (see at least paragraph [0066] to Wintz et al). The examiner submits that the combination of the teaching of the order processing system and method, as disclosed by Li et al and the system and method for robot inventory updates for order routing, as taught by Hance et al, further in view of the system and method for determining locations at which to store items in a storage facility, as taught by Wintz et al, in order to improve order fulfillment times and efficiency, and reduce bottlenecks, could have been readily and easily implemented, with a reasonable expectation of success. As such, the aforementioned combination is found to be obvious to try, given the state of the art at the time of filing. Claim 20 contains recitations substantially similar to those addressed above and, therefore, is likewise rejected. 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. The prior art made of record and not relied upon is considered pertinent to applicant's disclosure. The examiner has considered all references listed on the Notice of References Cited, PTO-892. The examiner has considered all references cited on the Information Disclosure Statement submitted by Applicant, PTO-1449. Any inquiry concerning this communication or earlier communications from the examiner should be directed to TALIA F CRAWLEY whose telephone number is (571)270-5397. The examiner can normally be reached on Monday thru Thursday; 8:30 AM-4:30 PM 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, Fahd A Obeid can be reached on 571-270-3324. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. The following are suggested formats for either a Certificate of Mailing or Certificate of Transmission under 37 CFR 1.8(a). The certification may be included with all correspondence concerning this application or proceeding to establish a date of mailing or transmission under 37 CFR 1.8(a). Proper use of this procedure will result in such communication being considered as timely if the established date is within the required period for reply. The Certificate should be signed by the individual actually depositing or transmitting the correspondence or by an individual who, upon information and belief, expects the correspondence to be mailed or transmitted in the normal course of business by another no later than the date indicated. Certificate of Mailing I hereby certify that this correspondence is being deposited with the United States Postal Service with sufficient postage as first class mail in an envelope addressed to: Commissioner for Patents P.O. Box 1450 Alexandria, VA 22313-1450 on __________. (Date) Typed or printed name of person signing this certificate: ________________________________________________________ Signature: ______________________________________ Certificate of Transmission by Facsimile I hereby certify that this correspondence is being facsimile transmitted to the United States Patent and Trademark Office, Fax No. (___)_____ -_________ on _____________. (Date) Typed or printed name of person signing this certificate: _________________________________________ Signature: ________________________________________ Certificate of Transmission via USPTO Patent Electronic Filing System I hereby certify that this correspondence is being transmitted via the U.S. Patent and Trademark Office (USPTO) patent electronic filing system to the USPTO on _____________. (Date) Typed or printed name of person signing this certificate: _________________________________________ Signature: ________________________________________ Please refer to 37 CFR 1.6(a)(4), 1.6(d) and 1.8(a)(2) for filing limitations concerning transmissions via the USPTO patent electronic filing system, facsimile transmissions and mailing, respectively. Please refer to 37 CFR 1.6(a)(4), 1.6(d) and 1.8(a)(2) for filing limitations concerning transmissions via the USPTO patent electronic filing system, facsimile transmissions and mailing, respectively. /TALIA F CRAWLEY/ Primary Examiner, Art Unit 3627
Read full office action

Prosecution Timeline

Feb 22, 2024
Application Filed
May 19, 2026
Non-Final Rejection mailed — §101, §103
Aug 13, 2026
Response Filed
Oct 28, 2026
Final Rejection mailed — §101, §103 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12762507
ACTIVITY BASED ENZYME INVENTORY MANAGEMENT
4y 8m to grant Granted Oct 13, 2026
Patent 12761858
ELECTRONIC SHELF LABEL WITH INTERACTION INTERFACE ACTIVATION
4y 4m to grant Granted Oct 13, 2026
Patent 12756797
SYSTEMS AND METHODS FOR DETECTING A MIS-SCAN OF AN ITEM FOR PURCHASE
4y 0m to grant Granted Oct 06, 2026
Patent 12737717
NETWORK INVENTORY MANAGEMENT AND ANOMALY DETECTION SYSTEM
4y 0m to grant Granted Sep 15, 2026
Patent 12725116
SYSTEM AND METHOD FOR FACILITATING COORDINATION OF TIMELY ORDER FULFILLMENT FOR PERISHABLE ITEMS
2y 9m to grant Granted Sep 01, 2026
Study what changed to get past this examiner. Based on 5 most recent grants.

Strategy Recommendation AI-generated — please review before filing

Get a prosecution strategy drawn from examiner precedents, rejection analysis, and claim mapping.
Typically takes 5-10 seconds — AI-generated, attorney review required before filing

Prosecution Projections

3-4
Expected OA Rounds
49%
Grant Probability
74%
With Interview (+25.2%)
3y 7m (~10m remaining)
Median Time to Grant
Moderate
PTA Risk
Based on 857 resolved cases by this examiner. Grant probability derived from career allowance 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