Prosecution Insights
Last updated: November 20, 2026
Application No. 19/384,815

OPTIMIZING TRUCK LOADING OF PALLETS

Non-Final OA §101
Filed
Nov 10, 2025
Priority
Nov 19, 2019 — continuation of 11/429,925 +2 more
Examiner
LEE, PO HAN
Art Unit
3623
Tech Center
3600 — Transportation & Electronic Commerce
Assignee
Lineage Logistics LLC
OA Round
1 (Non-Final)
32%
Grant Probability
At Risk
1-2
OA Rounds
2y 7m
Est. Remaining
73%
With Interview

Examiner Intelligence

Grants only 32% of cases
32%
Career Allowance Rate
54 granted / 169 resolved
-20.0% vs TC avg
Strong +41% interview lift
Without
With
+41.3%
Interview Lift
resolved cases with interview
Typical timeline
3y 7m
Avg Prosecution
37 currently pending
Career history
223
Total Applications
across all art units

Statute-Specific Performance

§101
45.1%
+5.1% vs TC avg
§103
36.0%
-4.0% vs TC avg
§102
11.5%
-28.5% vs TC avg
§112
5.8%
-34.2% vs TC avg
Black line = Tech Center average estimate • Based on career data from 169 resolved cases

Office Action

§101
Detailed Action The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA . Status of the Application and Claims This action is in reply to the application filed on 11/10/2025. This communication is the first action on the merits. IDS filed on 1/8/2026, 5/6/2026 is acknowledged and considered by the Examiner. Claims 21-40 is/are currently pending and have been examined. Examiner invites Applicant to schedule an interview to expedite the prosecution of the present application. 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 21-40 is/are rejected under 35 U.S.C. 101 because the claimed invention is directed to non-statutory subject matter. Claim 21 (similarly 31) recites, “…A …method for determining an efficient configuration for loading pallets on a vehicle, the method comprising: receiving a vehicle loading request that includes a list of pallets to be loaded on the vehicle, wherein each pallet in the list of pallets is associated with one or more pallet characteristics, and wherein the vehicle includes multiple slots, each slot corresponding to a pallet position and pallet orientation according to a given loading configuration; for each pallet in the list of pallets, assigning the pallet to a respective pallet characteristic group based on its one or more pallet characteristics, wherein each pallet of a given pallet characteristic group is swappable with any other pallet of the given pallet characteristic group when loading pallets into slots on the vehicle; receiving vehicle constraint information for the vehicle, the vehicle constraint information including rules for loading the vehicle; determining, by a …, candidate loading configurations for loading the pallets on the vehicle, based on the vehicle constraint information and the one or more pallet characteristics for each pallet in the list of pallets, wherein a candidate loading configuration specifies, for each pallet in the list of pallets, a respective slot for the pallet on the vehicle; determining, by the …, for at least some of the candidate loading configurations, a respective configuration score; selecting, by the … and based on its respective configuration score, one of the candidate loading configurations as a selected loading configuration; generating, by the …, …loading instructions for loading each pallet in the list of pallets onto the vehicle according to the selected loading configuration, wherein the loading instructions, when executed, cause each pallet in the list of pallets to be … retrieved by an … and delivered to the vehicle, according to a loading sequence that corresponds to the selected loading configuration; receiving data from a … that indicates that a given pallet has arrived at the vehicle; and based on the data from the … and based on the selected loading configuration, (i) determining that the given pallet is not an expected pallet for a next slot, according to the loading sequence that corresponds to the selected loading configuration, (ii) determining that the given pallet belongs to the same pallet characteristic group as the expected pallet, and (iii) swapping the expected pallet with the given pallet, by loading the given pallet on the vehicle in the next slot instead of the expected pallet.…” Analyzing under Step 2A, Prong 1: The limitations regarding, …determining an efficient configuration for loading pallets on a vehicle…receiving a vehicle loading request that includes a list of pallets to be loaded on the vehicle, wherein each pallet in the list of pallets is associated with one or more pallet characteristics, and wherein the vehicle includes multiple slots, each slot corresponding to a pallet position and pallet orientation according to a given loading configuration; for each pallet in the list of pallets, assigning the pallet to a respective pallet characteristic group based on its one or more pallet characteristics, wherein each pallet of a given pallet characteristic group is swappable with any other pallet of the given pallet characteristic group when loading pallets into slots on the vehicle; receiving vehicle constraint information for the vehicle, the vehicle constraint information including rules for loading the vehicle; determining, by a …, candidate loading configurations for loading the pallets on the vehicle, based on the vehicle constraint information and the one or more pallet characteristics for each pallet in the list of pallets, wherein a candidate loading configuration specifies, for each pallet in the list of pallets, a respective slot for the pallet on the vehicle; determining, by the …, for at least some of the candidate loading configurations, a respective configuration score; selecting, by the … and based on its respective configuration score, one of the candidate loading configurations as a selected loading configuration; generating, by the …, …loading instructions for loading each pallet in the list of pallets onto the vehicle according to the selected loading configuration, wherein the loading instructions, when executed, cause each pallet in the list of pallets to be … retrieved by an … and delivered to the vehicle, according to a loading sequence that corresponds to the selected loading configuration; receiving data from a … that indicates that a given pallet has arrived at the vehicle; and based on the data from the … and based on the selected loading configuration, (i) determining that the given pallet is not an expected pallet for a next slot, according to the loading sequence that corresponds to the selected loading configuration, (ii) determining that the given pallet belongs to the same pallet characteristic group as the expected pallet, and (iii) swapping the expected pallet with the given pallet, by loading the given pallet on the vehicle in the next slot instead of the expected pallet…, under the broadest reasonable interpretation, can include a human using their mind and using pen and paper to perform the above identified limitations, therefore, the claims recite a mental process. Further, … determining an efficient configuration for loading pallets on a vehicle…receiving a vehicle loading request that includes a list of pallets to be loaded on the vehicle, wherein each pallet in the list of pallets is associated with one or more pallet characteristics, and wherein the vehicle includes multiple slots, each slot corresponding to a pallet position and pallet orientation according to a given loading configuration; for each pallet in the list of pallets, assigning the pallet to a respective pallet characteristic group based on its one or more pallet characteristics, wherein each pallet of a given pallet characteristic group is swappable with any other pallet of the given pallet characteristic group when loading pallets into slots on the vehicle; receiving vehicle constraint information for the vehicle, the vehicle constraint information including rules for loading the vehicle; determining, by a …, candidate loading configurations for loading the pallets on the vehicle, based on the vehicle constraint information and the one or more pallet characteristics for each pallet in the list of pallets, wherein a candidate loading configuration specifies, for each pallet in the list of pallets, a respective slot for the pallet on the vehicle; determining, by the …, for at least some of the candidate loading configurations, a respective configuration score; selecting, by the … and based on its respective configuration score, one of the candidate loading configurations as a selected loading configuration; generating, by the …, …loading instructions for loading each pallet in the list of pallets onto the vehicle according to the selected loading configuration, wherein the loading instructions, when executed, cause each pallet in the list of pallets to be … retrieved by an … and delivered to the vehicle, according to a loading sequence that corresponds to the selected loading configuration; receiving data from a … that indicates that a given pallet has arrived at the vehicle; and based on the data from the … and based on the selected loading configuration, (i) determining that the given pallet is not an expected pallet for a next slot, according to the loading sequence that corresponds to the selected loading configuration, (ii) determining that the given pallet belongs to the same pallet characteristic group as the expected pallet, and (iii) swapping the expected pallet with the given pallet, by loading the given pallet on the vehicle in the next slot instead of the expected pallet…, are human collecting incident records and categorizing and clustering incidents to take remediation actions to resolve incidents, which are fundamental economic principles or practices, managing personal behavior or relationships or interactions between people, therefore the claims recite certain methods of organizing human activities. Accordingly, the claims recite a mental process, certain methods of organizing human activities, and thus, the claims are directed to an abstract idea under the first prong of Step 2A. Analyzing under Step 2A, Prong 2: This judicial exception is not integrated into a practical application under the second prong of Step 2A. In particular, the claims recite the additional elements beyond the recited abstract idea identified under Step 2A, Prong 1, such as: Claim 21, 31: computer-implemented, warehouse management system, electronic, automatically retrieved by an automated storage and retrieval system, pallet identification device, system comprising: a warehouse management system including one or more processors and memory storing instructions that, when executed, cause the one or more processors to perform operations , and pursuant to the broadest reasonable interpretation, as an ordered combination, each of the additional elements are computing elements recited at high level of generality implementing the abstract idea, and thus, are no more than applying the abstract idea with generic computer components. Further, these additional elements generally link the abstract idea to a technical environment, namely the environment of a computer. Additionally, with respect to, “…receiving…”, “…generating…”, these elements do not add a meaningful limitations to integrate the abstract idea into a practical application because they are extra-solution activity, pre and post solution activity - i.e. data gathering – “…receiving…”, data output – “…generating…” Analyzing under Step 2B: The claim does not include additional elements that are sufficient to amount to significantly more than the judicial exception under Step 2B. As noted above, the aforementioned additional elements beyond the recited abstract idea are not sufficient to amount to significantly more than the recited abstract idea because, as an order combination, the additional elements are no more than mere instructions to implement the idea using generic computer components (i.e. apply it). Additionally, as an order combination, the additional elements append the recited abstract idea to well-understood, routine, and conventional activities in the field as individually evinced by the applicant’s own disclosure, as required by the Berkheimer Memo, in at least: [0002] Warehouses include warehouse racks to store pallets of goods. Pallets are generally flat transport structures that support goods in a stable manner and are adapted to fit various devices/machines to move the pallets. In general, preparing pallets for shipment on a truck can include retrieving the pallets from the warehouse racks, and using forklifts and/or other devices/machines to transport the pallets to a staging area near the truck. Before pallets are loaded onto trucks for transportation out of a warehouse, all of the pallets to be loaded onto a truck are gathered in the staging area and manually assessed by a warehouse worker to determine how to arrange the pallets within the truck. For example, trucks and their trailers can include various requirements and/or restrictions to ensure safe transport of pallets between locations, such as overall weight restrictions for the truck, weight restrictions for various portions of the trailer, and/or other constraints. To ensure safe and sufficient loading of a truck and its trailer, a worker with expert knowledge can assess the pallets in the staging area to figure out how to best load the truck trailer to comply with the truck and trailer requirements, which can be time consuming (e.g., pallets first need to be assembled in staging area, then manually assessed, then loaded, then tested and possibly rearranged) as well as labor intensive (e.g., manual labor to perform all steps). [0031] During stage (D), for example, the loading system 104 can perform various loading operations for moving goods and/or pallets included in the list of goods/pallets, according to the loading instructions. For example, the loading system 104 can instruct an automated storage and retrieval system (ASRS) to retrieve a particular pallet from one of the pallet storage areas 110a-n, and one of the pallet handling devices 112a-n can retrieve the pallet and provide the pallet for transportation to the vehicle 120 by one or more pallets movers, such as pallet jacks, forklifts, and/or automated pallets movers such as automated guided vehicles (AGVs). As another example, the loading system 104 can output instructions for manual retrieval of a particular pallet and transportation of the pallet to the vehicle 120 by a pallet jack, forklift, or other suitable manually operated pallet mover. [0062] Referring again to FIG. 4, pallets can be loaded on the vehicle according to the selected loading solution and the determined pallet groups (410). For example, when a pallet arrives at the vehicle 120, the pallet can be identified by a warehouse worker (e.g., using a scanning device or another suitable pallet identification device), and the selected loading solution 870 can be accessed to determine whether the pallet is to be currently loaded on the vehicle (e.g., a current slot to be filled on the vehicle 120 corresponds to the pallet’s identifier). If the pallet is to be currently loaded, for example, the worker can load the pallet on the vehicle 120. However, even if the pallet is not to be currently loaded on the vehicle 120 according to the selected loading solution 870, the pallet may be loaded anyway based on its group. For example, when a pallet arrives at the vehicle 120 out of sequence, the pallet’s group can be identified according to the pallet groups 860, and the pallet may be loaded in place of another pallet belonging to the same group as the arriving pallet according to the group loading solution 880, such that pallets arriving out of sequence may be efficiently handled. For example, according to the selected loading solution 870, pallet P6 (e.g., belonging to group G2) is shown as being in a first slot, stacked underneath pallet P3. However, if another pallet belonging to a same group (e.g., group G2) were to first arrive at the vehicle 120 (e.g., any of pallets P3, P4, or P5) the pallet could be loaded in the first slot instead of pallet P6. Since all of the pallets P3, P4, P5, and P6 belong to the same group G2, for example, the pallets may be considered to be interchangeable when loading the vehicle 120 according to the group loading solution 880. Thus, rather than loading the pallets according to one specific configuration, the pallets may be loaded according to a more flexible configuration. [0063] FIG. 9 is a schematic diagram of an example computer device 900 that may be used to implement the systems and methods described in this document. The device 900, for example, can be used for the operations described in association with the methods described herein. For example, the system 900 may be included in either or all of the warehouse management system 102 and/or the loading system 104. [0064] The device 900 includes a processor 910, a memory 920, a storage device 930, and input/output device(s) 940. Each of the components 910, 920, 930, and 940 are interconnected using a system bus 950. The processor 910 is capable of processing instructions for execution within the device 900. In one implementation, the processor 910 is a single-threaded processor. In another implementation, the processor 910 is a multi-threaded processor. The processor 910 is capable of processing instructions stored in the memory 920 or on the storage device 930 to display graphical information for a user interface on the input/output device 940. [0065] The memory 920 stores information within the device 900. In one implementation, the memory 920 is a computer-readable medium. In one implementation, the memory 920 is a volatile memory unit. In another implementation, the memory 920 is a non-volatile memory unit. [0066] The storage device 930 is capable of providing mass storage for the device 900. In one implementation, the storage device 930 is a computer-readable medium. In various different implementations, the storage device 930 may be a floppy disk device, a hard disk device, an optical disk device, or a tape device. [0067] The input/output device(s) 940 provides input/output operations for the device 900. In one implementation, the input/output device(s) 940 includes a keyboard and/or pointing device. In another implementation, the input/output device(s) 940 includes a display unit for displaying graphical user interfaces. [0068] The features described can be implemented in digital electronic circuitry, or in computer hardware, firmware, software, or in combinations of them. The apparatus can be implemented in a computer program product tangibly embodied in an information carrier, e.g., in a machine-readable storage device for execution by a programmable processor; and method steps can be performed by a programmable processor executing a program of instructions to perform functions of the described implementations by operating on input data and generating output. The described features can be implemented advantageously in one or more computer programs that are executable on a programmable system including at least one programmable processor coupled to receive data and instructions from, and to transmit data and instructions to, a data storage system, at least one input device, and at least one output device. A computer program is a set of instructions that can be used, directly or indirectly, in a computer to perform a certain activity or bring about a certain result. A computer program can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. [0069] Suitable processors for the execution of a program of instructions include, by way of example, both general and special purpose microprocessors, and the sole processor or one of multiple processors of any kind of computer. Generally, a processor will receive instructions and data from a read-only memory or a random access memory or both. The essential elements of a computer are a processor for executing instructions and one or more memories for storing instructions and data. Generally, a computer will also include, or be operatively coupled to communicate with, one or more mass storage devices for storing data files; such devices include magnetic disks, such as internal hard disks and removable disks; magneto-optical disks; and optical disks. Storage devices suitable for tangibly embodying computer program instructions and data include all forms of non-volatile memory, including by way of example semiconductor memory devices, such as EPROM, EEPROM, and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in, ASICs (application-specific integrated circuits). [0070] To provide for interaction with a user, the features can be implemented on a computer having a display device such as a CRT (cathode ray tube) or LCD (liquid crystal display) monitor for displaying information to the user and a keyboard and a pointing device such as a mouse or a trackball by which the user can provide input to the computer. [0071] The features can be implemented in a computer system that includes a back-end component, such as a data server, or that includes a middleware component, such as an application server or an Internet server, or that includes a front-end component, such as a client computer having a graphical user interface or an Internet browser, or any combination of them. The components of the system can be connected by any form or medium of digital data communication such as a communication network. Examples of communication networks include, e.g., a LAN, a WAN, and the computers and networks forming the Internet. [0072] The computer system can include clients and servers. A client and server are generally remote from each other and typically interact through a network, such as the described one. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. [0073] While this specification contains many specific implementation details, these should not be construed as limitations on the scope of any inventions or of what may be claimed, but rather as descriptions of features specific to particular implementations of particular inventions. Certain features that are described in this specification in the context of separate implementations can also be implemented in combination in a single implementation. Conversely, various features that are described in the context of a single implementation can also be implemented in multiple implementations separately or in any suitable sub-combination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a sub-combination or variation of a sub-combination. [0074] Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In certain circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system components in the implementations described above should not be understood as requiring such separation in all implementations, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products. [0075] Thus, particular implementations of the subject matter have been described. Other implementations are within the scope of the following claims. In some cases, the actions recited in the claims can be performed in a different order and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In certain implementations, multitasking and parallel processing may be advantageous. Furthermore, as an ordered combination, these elements amount to generic computer components receiving or transmitting data over a network, performing repetitive calculations, electronic record keeping, and storing and retrieving information in memory, which, as held by the courts, are well-understood, routine, and conventional. See MPEP 2106.05(d). Moreover, the remaining elements of dependent claims do not transform the recited abstract idea into a patent eligible invention because these remaining elements merely recite further abstract limitations that provide nothing more than simply a narrowing of the abstract idea recited in the independent claims. Looking at these limitations as an ordered combination adds nothing additional that is sufficient to amount to significantly more than the recited abstract idea because they simply provide instructions to use a generic arrangement of generic computer components to “apply” the recited abstract idea, perform insignificant extra-solution activity, and generally link the abstract idea to a technical environment. Thus, the elements of the claims, considered both individually and as an ordered combination, are not sufficient to ensure that the claim as a whole amounts to significantly more than the abstract idea itself. Since there are no limitations in these claims that transform the exception into a patent eligible application such that these claims amount to significantly more than the exception itself, claims 21-40 are rejected under 35 U.S.C. 101 as being directed to non-statutory subject matter. Conclusion Any inquiry concerning this communication or earlier communications from the examiner should be directed to PO HAN (Max) LEE whose telephone number is (571) 272-3821. The examiner can normally be reached on Monday - Thursday, 9 AM-6:30 PM. 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, Rutao Wu can be reached on (571) 272-6045. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300. Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see http://pair-direct.uspto.gov. Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative or access to the automated information system, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000. /PO HAN LEE/Primary Examiner, Art Unit 3623
Read full office action

Prosecution Timeline

Nov 10, 2025
Application Filed
Oct 30, 2026
Non-Final Rejection mailed — §101 (current)

Precedent Cases

Applications granted by this same examiner with similar technology

Patent 12802027
OPTIMIZING TRUCK LOADING OF PALLETS
1y 9m to grant Granted Nov 17, 2026
Patent 12620040
VALUATION OF HOMES USING GEOGRAPHIC REGIONS OF VARYING GRANULARITY
2y 4m to grant Granted May 05, 2026
Patent 12619941
TECHNICAL CANDIDATE CERTIFICATION SYSTEM
1y 11m to grant Granted May 05, 2026
Patent 12602629
USING MACHINE LEARNING TO PREDICT FLEET MOVES IN HYDRAULIC FRACTURING OPERATIONS
3y 2m to grant Granted Apr 14, 2026
Patent 12548089
OPTIMIZATION OF HYBRID GROWING INFRASTRUCTURE FOR DIFFERENT WEATHER PROFILES AND MARKET CONDITIONS
3y 3m to grant Granted Feb 10, 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

1-2
Expected OA Rounds
32%
Grant Probability
73%
With Interview (+41.3%)
3y 7m (~2y 7m remaining)
Median Time to Grant
Low
PTA Risk
Based on 169 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