Warehouse-in and warehouse-out assembly line type settlement and access control linkage method and system for intelligent warehouse

By automatically generating digital release instructions and using polygon simplification algorithms to calculate the actual floor area, the problem of disconnect between access control and settlement in smart warehouses has been solved, realizing fully automated and real-time warehouse management and eliminating asset losses and financial disputes.

CN121904874APending Publication Date: 2026-04-21SHANDONG WUGE INFORMATION TECHNOLOGY DEVELOPMENT CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202610221956.7
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-02-25
Publication Date
2026-04-21

AI Technical Summary

Technical Problem

The existing smart warehouse access control system does not achieve real-time data binding with the status of inbound and outbound operations and financial settlement, resulting in a high risk of releasing goods without settlement, which can easily lead to asset losses and financial disputes.

Method used

By automatically generating digital release instructions and combining them with polygon simplification algorithms to calculate the actual area occupied and settle accounts, a streamlined settlement system for inbound and outbound operations is achieved, which is linked with access control to ensure that release is only completed after settlement.

Benefits of technology

It achieves fully automated, real-time closed-loop control from outbound application to physical release, eliminating asset losses and financial disputes, and improving warehouse operation security and financial rigor.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN121904874A_ABST
    Figure CN121904874A_ABST
Patent Text Reader

Abstract

The invention provides a warehouse-in and warehouse-out assembly line type settlement and access control linkage method and system for an intelligent warehouse, and relates to the technical field of intelligent warehousing, and the method comprises the steps: receiving a warehouse-out operation request for target goods, generating a corresponding to-be-executed warehouse-out task, and according to the to-be-executed warehouse-out task, executing the warehouse-out operation request; analyzing and acquiring a specific storage location identifier occupied by the target cargo in the warehouse storage plane model, retrieving coordinates of an original closed polygon boundary vertex sequence uniquely corresponding to the storage location identifier or describing a plane contour of the storage location identifier, and performing adaptive compression on the original vertex sequence by applying a polygon simplification algorithm, and generating a simplified polygon boundary vertex sequence coordinate. Through a series of automatic, digital and linkage technical means, the problems of risk release without settlement, low efficiency and the like are solved, and finally the safe, efficient and accurate intelligent management and control effect is achieved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of intelligent warehousing technology, and in particular to a method and system for automated settlement and access control linkage for inbound and outbound operations in intelligent warehouses. Background Technology

[0002] Currently, access control systems in smart warehouses often operate independently of core business processes, typically relying on fixed personnel access cards or simple manual release instructions. They fail to achieve real-time data binding and logical linkage with dynamic inbound and outbound business status and financial settlement results.

[0003] This disconnect directly leads to significant "unsettled release risk": In traditional or semi-automated processes, after goods are picked and loaded in the warehouse management system (WMS), the corresponding cost settlement process often fails to complete synchronously due to delays in manual operation, lag in data synchronization between systems, or lengthy approval processes. However, physical access control systems may receive independent release signals or security personnel may manually release goods based on incomplete documents, resulting in the batch of goods being transported out of the warehouse before costs are settled or final financial review is passed. This risk manifests as direct asset losses for enterprises, inability to promptly confirm accounts receivable or the formation of bad debts. Furthermore, the severe disconnect between the actual movement of goods and financial documentation easily leads to financial disputes and reconciliation discrepancies with customers or carriers, resulting in discrepancies between inventory records and actual stock, severely undermining the security of warehouse management and the rigor of financial control. Summary of the Invention

[0004] The technical problem to be solved by this invention is to provide a method and system for automated settlement and access control linkage for inbound and outbound operations in smart warehouses. Through a series of automated, digitalized and linked technologies, it solves the problems of risk of unsettled release and low efficiency, and ultimately achieves safe, efficient and accurate intelligent management and control.

[0005] To solve the above-mentioned technical problems, the technical solution of the present invention is as follows: Firstly, a method for linking automated checkout and access control in a smart warehouse includes: Step 1: Receive the outbound operation request for the target goods and generate the corresponding outbound task to be executed; Step 2: Based on the outbound task to be executed, parse and obtain the specific storage location identifier occupied by the target goods in the warehouse storage plane model, and retrieve the original closed polygon boundary vertex sequence coordinates that uniquely correspond to the storage location identifier and describe its planar contour from the predefined warehouse space coordinate mapping database. Step 3: Adaptively compress the original vertex sequence by applying a polygon simplification algorithm to generate a simplified polygon boundary vertex sequence coordinate; Step 4: Based on the coordinates of the simplified polygon boundary vertex sequence, calculate its actual footprint using the shoelace formula, and use the actual footprint as the core billing parameter to calculate the settlement order containing the fee details, and generate a settlement completion status signal. Step 5: Based on the settlement completion status signal, automatically generate a digital release instruction uniquely bound to the outbound task to be executed. This instruction includes the task identifier, goods information, settled area fees, and valid permissions. Step 6: When the transport unit carrying the target goods arrives at the warehouse access control, the access control system automatically acquires and verifies the validity of the digital release instruction. Only after the verification is passed will the gate be driven to perform a physical release operation, and the status of the outbound task to be executed will be automatically updated to "outbound", realizing the linkage between the inbound and outbound assembly line settlement and access control.

[0006] Furthermore, it receives outbound operation requests for target goods and generates corresponding outbound tasks to be executed, including: Step 1.1: Receive a structured outbound operation request sent by the upstream business system or operation terminal. The request includes the target goods identifier, the requested outbound quantity, the destination information, and the identity certificate of the requesting entity. Step 1.2: Perform multi-dimensional compliance verification on the received outbound operation request. Multi-dimensional compliance verification includes verifying whether the request message contains all required fields and conforms to the format specifications, verifying whether the requesting entity has the right to initiate the corresponding quantity of outbound operations on the target goods based on the identity credentials of the requesting entity, querying the inventory database in real time to verify whether the current available inventory quantity of the target goods meets the requested outbound quantity, and confirming that the goods status allows outbound. Step 1.3: After the compliance verification is passed, an outbound task to be executed is automatically generated with a globally unique task identifier. The outbound task to be executed is an independent data object, and its core data structure includes: task ID, goods identifier, quantity to be shipped, source warehouse location information, requester information, task status, and timestamp.

[0007] Furthermore, based on the outbound task to be executed, the specific storage location identifier occupied by the target goods in the warehouse storage plan model is parsed and obtained. From the predefined warehouse space coordinate mapping database, the coordinate sequence of the original closed polygon boundary vertices that uniquely corresponds to the storage location identifier and describes its planar contour is retrieved, including: Step 2.1: Parse the outbound task object to be executed and extract key cargo identification information; Step 2.2: Query the real-time inventory database based on the goods identification to obtain the physical storage location identifier currently occupied by the goods; Step 2.3: Based on the physical storage location identifier, query the predefined storage space coordinate mapping database to retrieve the coordinate sequence of the original closed polygon boundary vertices uniquely bound to the identifier. The predefined database stores the mapping relationship between each physical storage location identifier and its planar profile defined in a unified world coordinate system.

[0008] Furthermore, the original vertex sequence is adaptively compressed to generate a simplified polygon boundary vertex sequence coordinate, including: Step 3.1: Set the tolerance threshold, which is dynamically calculated based on the overall accuracy requirements of the warehouse plan model and the geometric scale of the original closed polygon. Step 3.2: Based on the verified original closed polygon vertex sequence, retain the start and end points of the polygon contour, and find the middle vertex with the largest vertical distance of the chord formed by the start and end vertices in the current vertex sequence; if the maximum distance is less than the set tolerance threshold, discard all middle vertices; if it is greater than the tolerance threshold, add the point as a key vertex that must be retained to the result set, and divide the curve into two segments with this point as the boundary. Recursively perform the same process on each segment until all line segments are processed to achieve recursive iterative calculation. Step 3.3: After the recursive iterative calculation is completed, a new sequence consisting of key feature vertices is obtained. This new sequence is then connected end to end to form a simplified closed polygon with a significantly reduced number of vertices.

[0009] Furthermore, based on the simplified polygon boundary vertex sequence coordinates, the actual footprint is calculated using the shoelace formula. This actual footprint is then used as the core billing parameter to calculate the settlement order containing fee details and generate a settlement completion status signal, including: Step 4.1: Receive and prepare simplified polygon vertex coordinate data, and normalize the coordinate system. Step 4.2: Traverse the simplified vertex sequence and obtain the actual area occupied by calculating the sum of the cross products of the polygon vertex coordinates; Step 4.3: Based on historical data, perform a weighted summation of the actual occupied area and billing strategy to generate a cost breakdown and settlement order. The billing strategy calls a predefined dynamic billing engine to calculate the total cost based on historical cargo types, storage duration, current rate table, and additional service fee rules. Step 4.4: Monitor and confirm the final status of the expense details and settlement order, and generate a settlement completion status signal.

[0010] Furthermore, based on the settlement completion status signal, a digital release instruction uniquely bound to the pending outbound task is automatically generated. This instruction includes a task identifier, cargo information, settled area fees, and valid permissions, including: Step 5.1: Receive and verify the settlement completion status signal, extract the key information of the status signal and construct the instruction data body. The instruction data body includes the goods details in the outbound task to be executed, as well as the settled area and corresponding cost details obtained from the settlement order. Step 5.2: Based on the preset business rules, obtain the valid permissions and lifecycle of the instruction, generate a digital signature and encapsulate the final instruction. The valid permissions are set to be used only once. Once verified and granted at a certain access control point, the instruction status immediately changes to "used" and cannot be reused for other access control points. The valid permissions specifically include: space permissions, time permissions and usage permissions.

[0011] Furthermore, when a transport unit carrying the target goods arrives at the warehouse access control system, the access control system automatically acquires and verifies the validity of the digital release instruction. Only after successful verification is the system activated to physically release the goods through the gate, and the status of the pending outbound task is automatically updated to "outbound," achieving a streamlined settlement process for inbound and outbound operations in conjunction with the access control system. This includes: Step 6.1: When the transport unit carrying the target goods arrives at the warehouse access control area, the automatic identification device of the access control system automatically identifies the task identification carrier carried on the transport unit, and encapsulates the identified task identification along with the current timestamp and access control point number, and sends a release instruction verification request to the central control platform. Step 6.2: The central control platform queries and obtains the corresponding digital release instructions in real time and performs multiple security verifications; Step 6.3: When all verifications pass, the access control system sends an opening command to the gate controller, drives the gate to lift, performs physical release, and sends a verification success notification to the central control platform. Upon receiving the notification, the central control platform immediately performs two atomic operations; and in the command database, updates the status of the corresponding pending outbound task to "outbound" and records the actual outbound timestamp, realizing the linkage between the inbound / outbound assembly line settlement and access control.

[0012] Secondly, a streamlined settlement and access control system for smart warehouses includes: The receiving module is used to receive outbound operation requests for target goods and generate corresponding outbound tasks to be executed. The acquisition module is used to parse and obtain the specific storage location identifier occupied by the target goods in the warehouse storage plane model according to the outbound task to be executed, and retrieve the original closed polygon boundary vertex sequence coordinates that uniquely correspond to the storage location identifier and describe its planar contour from the predefined warehouse space coordinate mapping database. The algorithm module is used to adaptively compress the original vertex sequence by applying a polygon simplification algorithm to generate a simplified polygon boundary vertex sequence coordinate. The processing module is used to calculate the actual area occupied by the simplified polygon boundary vertex sequence coordinates using the shoelace formula, and use the actual area occupied as the core billing parameter to calculate the settlement order containing the fee details and generate a settlement completion status signal. The parsing module is used to automatically generate a digital release instruction that is uniquely bound to the outbound task to be executed based on the settlement completion status signal. This instruction includes the task identifier, goods information, settled area fees, and valid permissions. The control module is used to automatically acquire and verify the validity of the digital release instruction when the transport unit carrying the target goods arrives at the warehouse access control. Only after the verification is successful will the gate be driven to perform physical release and the status of the outbound task to be executed will be automatically updated to "outbound", realizing the linkage between the inbound and outbound assembly line settlement and access control.

[0013] Thirdly, a computing device includes: One or more processors; A storage device for storing one or more programs that, when executed by one or more processors, cause the one or more processors to implement the method.

[0014] Fourthly, a computer-readable storage medium storing a program that, when executed by a processor, implements the method.

[0015] The above-described solution of the present invention has at least the following beneficial effects: This invention employs a series of collaborative, pipeline-style technical means, including spatial coordinate mapping based on the polygonal contour of the storage location and an adaptive simplification algorithm, real-time area calculation combined with a dynamic billing engine, and digital release instruction generation strongly bound to the settlement status and automatic access control verification linkage. This overcomes the technical problems in traditional intelligent warehouse management, such as data silos in various links, disconnect between settlement and business execution, resulting in billing lag, high risk of "release without settlement," and discrepancies between accounts and actual inventory. As a result, it achieves fully automated, real-time closed-loop control from outbound application and accurate billing to physical release, fundamentally eliminating asset losses and financial disputes, and significantly improving the security and financial rigor of warehouse operations. Attached Figure Description

[0016] Figure 1 This is a flowchart illustrating a method for automated settlement and access control linkage for inbound and outbound operations in a smart warehouse, as provided in an embodiment of the present invention.

[0017] Figure 2This is a schematic diagram of an inbound / outbound assembly line settlement and access control linkage system for smart warehouses, provided by an embodiment of the present invention. Detailed Implementation

[0018] Exemplary embodiments of the present disclosure will now be described in more detail with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be implemented in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.

[0019] like Figure 1 As shown, an embodiment of the present invention proposes a method for automated settlement and access control linkage for inbound and outbound operations in smart warehouses. The method includes the following steps: Step 1: Receive the outbound operation request for the target goods and generate the corresponding outbound task to be executed; Step 2: Based on the outbound task to be executed, parse and obtain the specific storage location identifier occupied by the target goods in the warehouse storage plane model, and retrieve the original closed polygon boundary vertex sequence coordinates that uniquely correspond to the storage location identifier and describe its planar contour from the predefined warehouse space coordinate mapping database. Step 3: Adaptively compress the original vertex sequence by applying a polygon simplification algorithm to generate a simplified polygon boundary vertex sequence coordinate; Step 4: Based on the coordinates of the simplified polygon boundary vertex sequence, calculate its actual footprint using the shoelace formula, and use the actual footprint as the core billing parameter to calculate the settlement order containing the fee details, and generate a settlement completion status signal. Step 5: Based on the settlement completion status signal, automatically generate a digital release instruction uniquely bound to the outbound task to be executed. This instruction includes the task identifier, goods information, settled area fees, and valid permissions. Step 6: When the transport unit carrying the target goods arrives at the warehouse access control, the access control system automatically acquires and verifies the validity of the digital release instruction. Only after the verification is passed will the gate be driven to perform a physical release operation, and the status of the outbound task to be executed will be automatically updated to "outbound", realizing the linkage between the inbound and outbound assembly line settlement and access control.

[0020] In this embodiment of the invention, the invention employs a series of interconnected and synergistic pipeline-style technical means, including automatic generation of outbound tasks, precise mapping of storage location polygonal outlines, adaptive simplified area calculation, dynamic billing and settlement status linkage, unique binding of digital release instructions, and automatic access control verification and status feedback. This overcomes the technical problems in traditional intelligent warehouses caused by the disconnect between business flow, settlement flow, and control flow, such as inaccurate billing, delayed settlement, high risk of "release without settlement," and discrepancies between accounts and actual inventory. This achieves fully automated, real-time closed-loop management of the entire process from outbound application and fee settlement to physical release, fundamentally eliminating asset losses and financial disputes, and significantly improving the safety and rigor of warehouse operations.

[0021] In a preferred embodiment of the present invention, step 1 above may include: Step 1.1: Receive structured outbound operation requests sent by upstream business systems or operating terminals. The request includes the target goods identifier, requested outbound quantity, destination information, and the requester's identity credentials. Specifically, the system's backend processor opens a dedicated communication port to monitor outbound operation requests sent by upstream business systems and operating terminals in real time, supporting multiple compliant communication protocols such as HTTPRESTful and TCP to ensure stable reception of requests from different sources. When a request signal is detected, an encrypted communication link is first established, and the transmitted data is decrypted to prevent data tampering or leakage during transmission. Then, the complete structured outbound operation request data is received, and the request data undergoes preliminary format parsing to extract the core fields: the target goods identifier for uniquely identifying the goods to be outbound, the requested outbound quantity specifying the required number of goods to be outbound, the destination information including the delivery address, contact person's phone number, and delivery time requirements, and the requester's identity credentials for verifying the legitimacy of the initiator. After parsing, the system performs a preliminary integrity check on the request data. Once the core fields are confirmed to be complete, the request data is temporarily stored in a temporary cache, and the request reception timestamp and data source identifier are recorded.

[0022] Step 1.2 involves performing multi-dimensional compliance verification on the received outbound operation request. This verification includes checking whether the request message contains all required fields and conforms to the format specifications; verifying the requester's identity credentials to determine their authorization to initiate an outbound operation for the corresponding quantity of target goods; querying the inventory database in real time to verify whether the current available inventory of the target goods meets the requested outbound quantity; and confirming that the goods status allows for outbound processing. Specifically, this involves: preprocessing the structured outbound operation request data object temporarily stored in the system's backend processor; initiating the multi-dimensional compliance verification process; with each dimension of verification conducted in parallel and independently to ensure verification efficiency and accuracy. In terms of field and format verification, the system calls a preset request message specification template to check all fields in the request one by one, verifying whether required fields such as goods identifier, outbound quantity, and identity credentials are included. After confirming no omissions, the system further verifies whether the format of each field conforms to the specifications. For example, the target goods identifier must be a system-preset alphanumeric combination format, the requested outbound quantity must be a positive integer, and the delivery address in the destination information must conform to the standardized administrative division format. Fields with non-conforming formats are marked as abnormal, and specific error information is provided. In the permission verification dimension, the system retrieves the subject's permission information from the permission management database based on the requesting subject's identity credentials. It verifies whether the initiator is a legitimate subject registered with the system and checks the subject's permission scope to confirm whether they have the authority to initiate an outbound operation for the target goods and whether they have the authority to apply for the corresponding outbound quota. If permissions are insufficient, the verification is terminated and a permission deficiency message is returned. In the inventory and goods status verification dimension, the system calls the inventory database interface in real time to query the current available inventory quantity of the target goods based on the target goods identifier. This quantity is compared with the requested outbound quantity to confirm that the available inventory quantity is greater than or equal to the requested outbound quantity. Simultaneously, the goods status is checked to confirm that the goods are in stock, not frozen, not pledged, and ready for outbound delivery. If no anomalies are found, this dimension's verification is completed. If any dimension verification fails, the system generates a detailed verification failure report, clearly stating the reason for the failure and providing feedback to the requesting subject. Only after all dimension verifications pass can the subsequent outbound task generation stage begin.

[0023] Step 1.3: After compliance verification passes, an outbound task with a globally unique task identifier is automatically generated. This outbound task is an independent data object, and its core data structure includes: task ID, goods identifier, quantity to be shipped, source warehouse location information, requester information, task status, and timestamp. Specifically, after all multi-dimensional compliance verifications pass, the system background processor automatically triggers the outbound task generation process. First, a globally unique task identifier is generated, using a combination of UUID and system number to ensure that this task ID is unique across the entire system and can serve as a unique traceability identifier for the outbound task. Subsequently, an independent outbound task data object is constructed, and various information is filled in according to the preset core data structure. The task ID is a newly generated globally unique identifier; the goods identifier uses the target goods identifier from the request; the outbound quantity corresponds to the requested outbound quantity; the source storage location information is obtained by querying the inventory database to find the specific storage location number, shelf number, and location coordinates of the target goods; the requester information extracts the entity name, number, and contact information corresponding to the requester's identity credentials; the task status is initially set to "pending execution" to identify the current stage of the task; and the timestamp records the precise time of task generation to the millisecond level. After the task data object is constructed, the system performs data verification to confirm that all information is accurate and consistent with the original request data. Then, the outbound task is stored in the outbound task database and simultaneously synchronized to the task scheduling module and inventory management module, updating the target goods' inventory status to "pending execution" to prevent duplicate outbounds, thus completing the generation of the outbound task.

[0024] In this embodiment of the invention, a series of technical means are adopted, including encrypted communication and multi-protocol reception, multi-dimensional parallel compliance verification, and the generation and synchronization of structured task data objects based on globally unique identifiers. These methods overcome the technical problems of low efficiency and operational risks caused by chaotic request formats, manual and asynchronous permission and inventory verification, and low standardization and automation of task generation in traditional inbound and outbound processes. As a result, the entire process of receiving, verifying and generating outbound requests is automated, standardized and highly secure.

[0025] In a preferred embodiment of the present invention, step 2 above may include: Step 2.1: Parse the outbound task object to be executed and extract key goods identification information. Specifically, this includes: reading the complete data structure of the task through a dedicated task parsing interface and initiating the precise field extraction process. During parsing, the system prioritizes locating core field areas and accurately extracts key goods identification information, including three core identifiers: unique goods code, specifications / model code, and batch number. The unique goods code is used to associate the inventory database with the goods file; the specifications / model code is used to distinguish goods of the same type but different specifications; and the batch number is used to locate the storage location of the specific batch of goods entering the warehouse. After extraction, the system performs dual verification of the goods identification information: first, format verification, checking whether each identifier code conforms to the preset rules of the warehousing system to ensure there are no missing characters, misalignments, or abnormal formats; second, validity verification, querying the extracted goods identifiers against the goods file database to confirm that the goods are legal goods registered in the system and that the file status is normal, without cancellation or deactivation marks. After successful verification, the system temporarily stores the goods identification information and the corresponding task ID in the picking preparation cache area, establishing a mapping between identifiers and tasks, and recording the parsing timestamp and parsing status.

[0026] Step 2.2: Query the real-time inventory database based on the product identifier to obtain its currently occupied physical storage location identifier. This includes extracting and verifying the product identifier as the search condition and initiating the real-time inventory database query process. To ensure the real-time performance and accuracy of the query results, the system uses a distributed locking mechanism to temporarily lock the inventory query resource corresponding to the product identifier. This prevents changes in inventory data due to other outbound or inbound operations during the query process. Simultaneously, the system calls the read-only interface of the inventory database to avoid modifying the master inventory data. During the query process, the system accurately locates the inventory record based on the product's unique code and batch number, extracting the currently occupied physical storage location identifier, including five levels of identifiers: warehouse number, storage area number, shelf number, layer number, and storage location number, forming a complete storage location code to ensure the unique identification of the product's physical storage location. If the same goods or batches occupy multiple physical storage locations, the system will sort the multiple storage location identifiers according to a preset outbound strategy, such as first-in-first-out, nearest-location picking, or full-load priority. It will then select the optimal storage location identifier as the priority picking target and record all associated storage location identifiers and their corresponding inventory quantities for use if the priority storage location is insufficient. After the query is completed, the system will validate the physical storage location identifier, check the storage location status to confirm that the storage location is in a normal and available state, without any unusable markers such as frozen, under maintenance, or under inventory. Then, it will release the distributed lock and temporarily bind the physical storage location identifier and associated inventory information to the task ID.

[0027] Step 2.3: Based on the physical storage location identifier, query the predefined warehouse space coordinate mapping database to retrieve the coordinate sequence of the original closed polygon boundary vertex that is uniquely bound to the identifier. The predefined database stores the mapping relationship between each physical storage location identifier and its planar contour defined in a unified world coordinate system. Specifically, it includes: using the obtained physical storage location identifier as the core search condition, calling the predefined warehouse space coordinate mapping database interface to start the coordinate retrieval process. This mapping database specifically stores the mapping relationship between each physical storage location identifier and its corresponding spatial coordinates within the entire storage area. All coordinates are established based on a unified world coordinate system to ensure the uniformity and comparability of storage location coordinates in different warehouses and different areas. The mapping relationship includes information such as the coordinate sequence of the closed polygon boundary vertex of the storage location planar contour, the coordinate precision level, and the coordinate update time. During the retrieval process, the system completely transmits the physical storage location identifier to the database retrieval engine. A precise matching algorithm locates the unique corresponding mapping record and extracts the coordinates of the original closed polygon boundary vertex sequence. The vertex coordinates are arranged in clockwise order, with each vertex containing X-axis and Y-axis two-dimensional coordinate values. The coordinate accuracy is down to the centimeter level, ensuring precise representation of the actual planar outline and spatial location of the storage location. Simultaneously, auxiliary information associated with the coordinates is extracted, including the coordinate system version and coordinate calibration time, confirming that the coordinate data is not expired or distorted. After extraction, the system performs completeness and rationality checks on the vertex sequence coordinates: the completeness check confirms that there are at least four vertices to form a closed polygon, with no missing vertices or empty coordinates; the rationality check uses a geometric algorithm to verify that the polygon formed after connecting the vertices has no intersections or overlaps, conforming to the spatial shape of the actual storage location. After successful verification, the system binds and stores the vertex sequence coordinates, physical storage location identifier, and task ID in the picking path planning cache, while simultaneously synchronizing them to the map module of the handheld PDA terminal. If the corresponding coordinates cannot be retrieved or the coordinate verification fails, the system immediately generates an exception prompt, sends feedback to the task scheduling module, and triggers a manual calibration process.

[0028] In this embodiment of the invention, a series of collaborative positioning and mapping technologies are employed, including a task-specific parsing interface, multiple verifications, real-time inventory database precision query under a distributed locking mechanism, a five-level physical storage location identification system, and precise retrieval of a spatial coordinate mapping database under a unified coordinate system. These technologies overcome the technical problems in traditional warehouse management, such as the disconnect between the physical location information of goods and the task, insufficient real-time inventory query leading to data conflicts, and positioning deviations and planning failures caused by missing or inaccurate storage location spatial coordinates. This achieves the technical effect of hierarchical, unique, and real-time mapping from outbound tasks to the physical location of goods and then to precise spatial coordinates, providing a reliable and consistent spatial data foundation for subsequent accurate area calculation and picking path planning.

[0029] In a preferred embodiment of the present invention, step 3 above may include: Step 3.1: Set the tolerance threshold. The tolerance threshold is dynamically calculated based on the overall accuracy requirements of the warehouse floor plan model and the geometric scale of the original closed polygon. Specifically, the calculation of the tolerance threshold ε is an adaptive process combining system physical accuracy constraints and the geometric characteristics of the currently processed object. The specific calculation follows these steps and formulas: Step 1: Determine the system's basic accuracy benchmark. This parameter is an inherent attribute of the warehouse floor plan model, derived from the nominal accuracy of the mapping or measurement system, and determined based on the positioning system's error or the resolution of the CAD drawing. For example, if the overall positioning accuracy of the system is ±2 cm, the accuracy benchmark can be set to 0.02 m. This value serves as the basic component of the threshold. Step 2: Calculate the geometric scale factor of the current polygon object, introducing a relative scaling factor related to the object's own size. Typically, the diagonal length L of the smallest bounding rectangle of the original polygon is calculated as its geometric scale representation. The formula for calculating the scale factor SF is: SF = L × k; where SF is the scale factor, L is the diagonal length, and k is a scaling factor, used to simplify the proportion of error relative to the object's own size. The final tolerance threshold ε is synthesized from the two components mentioned above, ensuring that it simultaneously satisfies the lower limit of absolute accuracy and the principle of relative proportion. The synthesis formula is usually: ε = max(BA, SF); that is, BA is the system's basic accuracy benchmark, SF is the geometric scale factor, and max is the larger value. For small polygons, SF may be less than BA, and the threshold is not lower than the system's basic accuracy BA. For large polygons, SF is greater than BA, and the threshold is dominated by SF. The dynamic calculation and setting process of the tolerance threshold is initiated through the original closed polygon vertex sequence and the associated warehouse plan model data. The core of the tolerance threshold value is closely aligned with the overall accuracy requirements of the warehouse plan model and the geometric scale of the original closed polygon. First, the accuracy level parameter of the warehouse plan model is extracted. This parameter is preset according to the warehouse type. The accuracy requirements of ordinary goods warehouses are relatively lenient, while the accuracy requirements of constant temperature, explosion-proof, and precision instrument warehouses are strict, corresponding to different basic accuracy threshold ranges. Subsequently, the geometric scale information of the original closed polygon is analyzed, including the total area of ​​the polygon, the longest side length, the shortest side length, and the vertex distribution density. Through geometric operations, the overall size and contour complexity of the polygon are quantified. Polygons with larger areas and longer side lengths can be adapted to a slightly larger tolerance threshold, while polygons with smaller areas and finer contours need to be set with a smaller tolerance threshold. During the calculation process, the system uses weighted operations to integrate the basic accuracy threshold and geometric scale parameters, using the warehouse basic accuracy threshold as the core weight and the geometric scale parameters as the adjustment weight, to dynamically generate a tolerance threshold that adapts to the current warehouse location polygon. At the same time, the threshold is controlled within a preset safety range. After the threshold calculation is completed, the system performs a rationality check to verify whether the threshold can retain the key features of the warehouse location contour after simplification. If there are no abnormalities, the tolerance threshold is bound and stored with the corresponding original polygon vertex sequence and task ID.

[0030] Step 3.2: Based on the verified original closed polygon vertex sequence, retain the start and end points of the polygon contour. Find the middle vertex with the largest vertical distance to the chord formed by the first and last vertices in the current vertex sequence. If this maximum distance is less than the set tolerance threshold, discard all middle vertices. If it is greater than the tolerance threshold, add this point as a key vertex that must be retained to the result set. Divide the curve into two segments using this point as the boundary, and recursively perform the same process on each segment until all segments are processed to achieve recursive iterative calculation. Specifically, this includes: using the verified original closed polygon vertex sequence as the processing object, starting the recursive iterative simplification process. The core is to simplify the sequence by retaining key vertices and discarding redundant vertices, while ensuring the integrity of the contour. First, preprocess the original closed polygon vertex sequence to clarify the start and end points of the sequence. Note that the polygon is closed, and the coordinates of the start and end points are consistent. Both are retained as basic vertices. Connect the first and last vertices to form a chord, and use this chord as the baseline for subsequent distance calculations. Then, iterate through all intermediate vertices in the vertex sequence except for the first and last vertices, calculating the vertical distance from each intermediate vertex to the first and last chords. Geometric calculations are used to precisely quantify the deviation of each vertex from the baseline chords, while simultaneously recording the vertical distance values ​​and corresponding vertex coordinates of all intermediate vertices. After calculation, the intermediate vertex with the largest vertical distance is selected, and its maximum distance is compared with a set tolerance threshold. If the maximum distance is less than or equal to the tolerance threshold, it means that the deviation of all intermediate vertices from the baseline chords is within the allowable error range, and the simplified contour will not affect the positioning accuracy of the storage location. In this case, all intermediate vertices are discarded, and only the first and last vertices are retained as valid vertices of this contour segment. If the maximum distance is greater than the tolerance threshold, it means that this vertex is a key vertex supporting the shape of the storage location contour; discarding it would cause contour distortion. In this case, the vertex is added to the key vertex result set, and the original vertex sequence is divided into two independent subsequences using this key vertex as the dividing point: the first subsequence is from the original starting point to the key vertex, and the second subsequence is from the key vertex to the original ending point. Then, the same process is recursively executed on the two subsequences respectively. That is, each subsequence retains its own first and last vertices, calculates the maximum vertical distance from the middle vertex to the first and last chords, compares it with the tolerance threshold, decides to discard or retain the key vertices and splits the subsequence, until all subsequences are processed and there are no vertices that meet the splitting conditions, the recursive iterative calculation terminates.

[0031] Step 3.3: After the recursive iterative calculation is completed, a new sequence composed of key feature vertices is obtained. This new sequence is then connected end-to-end to form a simplified closed polygon with a significantly reduced number of vertices. Specifically, this involves collecting the vertex coordinates of all vertices added to the key vertex result set in all iterations, and reordering the key vertices according to the clockwise order of the original closed polygon vertex sequence. This ensures that the order of the new sequence is consistent with the original sequence and conforms to the actual contour of the storage location. After sorting, a new vertex sequence composed of key feature vertices is formed. At this point, the number of vertices in the new sequence is significantly reduced compared to the original sequence, redundant vertices are effectively discarded, and only the core vertices supporting the key shape of the storage location contour are retained. The system then performs a head-to-tail connection of the new vertex sequence. Since the original polygon is closed, the starting and ending coordinates of the new sequence remain consistent, forming a complete simplified closed polygon after connection. After connection, the system performs a final verification of the simplified closed polygon: first, contour consistency verification, comparing the total area, key side lengths, and overall shape of the polygon before and after simplification to ensure that the deviation is within the tolerance threshold and meets the accuracy requirements of the warehouse plan model; second, practicality verification, verifying whether the simplified vertex sequence can be accurately mapped to the warehouse map and whether it is easy for the subsequent picking path planning algorithm to quickly call. After the verification is passed, the system associates and stores the key vertex sequence of the simplified closed polygon with the original vertex sequence, tolerance threshold, and task ID, and synchronously updates it to the picking path planning cache and the handheld PDA terminal map module, replacing the original vertex sequence for subsequent operations. If the verification fails, the system backtracks the recursive iteration process, adjusts the tolerance threshold, and re-executes the simplification process until a simplified closed polygon that meets the requirements is generated.

[0032] In this embodiment of the invention, a series of collaborative algorithmic techniques are employed, including dynamic calculation of tolerance thresholds based on system basic accuracy and geometric scale adaptation, recursive iteration of key vertex retention and redundant vertex discarding mechanisms, and dual verification of simplified contour consistency. These techniques overcome the technical problems in traditional polygon simplification methods, such as poor adaptability to polygons of different sizes due to fixed tolerances, loss of key geometric features affecting area calculation accuracy after simplification, and low storage and computation efficiency due to excessive number of vertices. As a result, the technical effect of significantly reducing the number of vertices and improving the efficiency of subsequent path planning and map rendering is achieved while strictly ensuring the key shape of the library contour and the accuracy of area calculation.

[0033] In a preferred embodiment of the present invention, step 4 above may include: Step 4.1: Receive and prepare simplified polygon vertex coordinate data, and normalize the coordinate system. This includes retrieving the verified key vertex sequence of the simplified closed polygon from the picking path planning cache, and simultaneously retrieving the corresponding task ID, original vertex sequence, and tolerance threshold information to initiate the data receiving and preprocessing process. First, the received simplified vertex sequence is checked for completeness to ensure there are sufficient vertices, no missing or abnormal coordinate values ​​(e.g., negative coordinates, coordinates exceeding warehouse boundaries), and that the vertex arrangement remains clockwise, consistent with the actual contour of the warehouse location. After verification, coordinate system normalization is performed on the vertex coordinates. During normalization, the system calls the warehouse unified coordinate system parameters, using the origin of the warehouse planar model as a reference, and scales the X-axis and Y-axis coordinates of the simplified polygon vertices according to a preset ratio. Simultaneously, coordinate offsets are corrected to ensure all vertex coordinates are mapped to the preset standard coordinate system range, maintaining centimeter-level accuracy. After processing, the system performs a second verification on the normalized vertex sequence to verify that the overall shape and relative proportion of the polygons before and after normalization are not distorted, ensuring that the subsequent area calculation results are accurate and reliable. Then, the normalized vertex sequence is associated with the task ID and the original coordinate data and stored, and synchronized to the billing data cache area.

[0034] Step 4.2 involves traversing the simplified vertex sequence and calculating the sum of the cross products of the polygon vertex coordinates to obtain the actual footprint. Specifically, this includes initiating the actual footprint calculation process using the normalized simplified polygon vertex sequence as the core data. First, the normalized vertex coordinate sequence is read, confirming that the sequence is arranged clockwise and that the first and last coordinates are consistent. Then, the footprint calculation cache is initialized, and historical calculation data is cleared. During the calculation, the system traverses each vertex in the vertex sequence sequentially, recording the normalized coordinate values ​​of adjacent vertices. The cross product of the vectors formed by adjacent vertices and the origin is calculated using geometric operation logic, and the actual footprint of the simplified polygon is derived based on this. Simultaneously, intermediate results of each calculation step are recorded in real time. After the calculation is complete, the system converts the obtained footprint result to square meters as the standard unit of measurement. Simultaneously, by combining the actual height parameters of the storage location with a query in the warehouse space coordinate mapping database, the occupied volume of the storage location can be simultaneously derived, or it can be selected for use in automated warehousing billing scenarios. The reasonableness of the land area result is then verified by comparing it with the land area of ​​the simplified regular polygon and the standard area recorded in the storage location file to ensure that the deviation is within the tolerance threshold. After confirming that there are no abnormalities, the actual land area is bound and stored with the task ID and normalized vertex sequence, and synchronized to the billing data cache area.

[0035] Step 4.3: Based on historical data, a weighted sum is calculated on the actual floor area and the billing strategy to generate a detailed cost breakdown and settlement order. The billing strategy calls a predefined dynamic billing engine for calculation. The predefined dynamic billing engine calculates the total cost based on historical goods types, storage duration, current rate tables, and additional service fee rules. Specifically, it retrieves actual floor area data and related data from the inventory database, task database, and historical billing database, including the type and specifications of the target goods, storage start time, storage duration, historical billing records for similar goods, current warehouse rate tables, and additional service fee rules, providing complete data support for cost calculation. The system then invokes a predefined dynamic billing engine. This engine incorporates a multi-dimensional billing algorithm that dynamically adapts billing rules to actual business scenarios. Its core calculations are based on the type of goods, storage duration, actual floor space, current rate table, and additional service fee rules. First, the engine matches the corresponding base rate based on the type of goods. Different types of goods have different base rates; for example, the base rate for precision instruments and temperature-controlled storage goods is higher than that for ordinary goods. Next, it calculates the base storage fee based on the storage duration. Storage duration less than one day is billed as one day, while storage duration exceeding one day is billed based on the actual duration. For long-term storage goods, tiered discounts can be applied according to preset rules. Finally, the actual floor space is included in the calculation. The area occupancy fee is calculated by multiplying the unit area rate by the floor space. Then, according to the additional service fee rules, optional additional fees such as handling service fees, preservation service fees, and security service fees are added, or automatically matched based on the characteristics of the goods and storage needs. After calculation, the system performs a weighted summation of all fees. The weighting coefficients are preset according to the billing strategy, with basic storage fees having the highest weight, followed by area occupancy fees and additional service fees, whose weights decrease sequentially. The weighted summation generates a detailed fee breakdown, including fee items, calculation basis, rate standards, amounts, and discount amounts. Simultaneously, a settlement order is generated based on the fee breakdown. The order content includes the order number and outbound task ID association, requester information, goods information, storage details, fee details, total amount, payment deadline, and payment method. After generation, the system performs a consistency check between the fee breakdown and the settlement order, verifying the accuracy of the fee calculation logic and amount accumulation to ensure no calculation errors. Once the check passes, the fee breakdown and settlement order are associated and stored in the billing database, and simultaneously synchronized to the requester's terminal and the financial settlement module.

[0036] Step 4.4: Monitor and confirm the final status of expense details and settlement orders, and generate a settlement completion status signal. This includes maintaining real-time communication with the financial settlement module and the requesting terminal via an interface, tracking the flow, payment, and review status of expense details and settlement orders throughout the entire process, ensuring that the entire order lifecycle is monitorable and traceable. During monitoring, the system queries the order status at preset time intervals, including statuses such as pending review, pending payment, payment failure, review rejection, and settlement completion. It also records the timestamps of each status update and the operator's information. If an order is in a pending payment status, the system will periodically send payment reminders to the requesting terminal, informing them of the payment deadline. If a payment failure is detected, the system immediately investigates the cause of the failure, including insufficient balance, abnormal payment channel, account freeze, etc., and feeds back the cause of the failure to the requesting party, while providing a re-payment channel. If an order is rejected by the financial module, the reason for rejection must be synchronized, and the requesting party must correct the error and resubmit for review. Once the system detects that an order status has been updated to "paid" and approved by the finance module, it confirms settlement completion and immediately generates a settlement completion status signal. This signal includes core information such as the order number, task ID, settlement completion time, total amount, and payment method, ensuring the signal data is complete and traceable. Subsequently, the settlement completion status signal is synchronized to the outbound task scheduling module, inventory management module, finance module, and the requesting terminal. Upon receiving the signal, the task scheduling module can proceed with subsequent outbound picking; the inventory management module updates the goods storage status; the finance module archives the settlement order for accounting purposes; and the requesting terminal receives the settlement completion notification and electronic invoice. Simultaneously, the system archives all settlement completion-related data, such as order information, expense details, payment records, and status signals, into the historical billing database and records the operation log.

[0037] In this embodiment of the invention, a series of collaborative settlement and status management technologies are adopted, including coordinate system normalization and vertex traversal cross product calculation, dynamic billing engine multi-dimensional weighted calculation, and full-process status monitoring and closed-loop signal triggering. These technologies overcome the technical problems in traditional warehouse settlement, such as area calculation deviations caused by inconsistent coordinate benchmarks, rigid billing rules that cannot adapt to complex business scenarios, and control breakpoints caused by the disconnect between settlement status and business execution. As a result, the technology achieves full-process automation, accuracy, and strong correlation control, from accurate area measurement and automatic cost accounting to real-time synchronization of settlement status. This provides reliable financial evidence and status-driven signals for subsequent release instruction generation and access control linkage.

[0038] In a preferred embodiment of the present invention, step 5 above may include: Step 5.1: Receive and verify the settlement completion status signal, extract key information from the status signal, and construct an instruction data body. The instruction data body includes the goods details in the pending outbound task, as well as the settled area and corresponding cost details obtained from the settlement order. Specifically, this includes: receiving the settlement completion status signal and initiating a full-dimensional signal verification process to ensure the signal is legal, complete, and untampered. During the verification process, first verify the legality of the signal's source, confirming that the signal was officially generated by the financial settlement module and that the attached module signature matches the system's preset signature; then verify the signal's integrity, checking that core fields such as order number, task ID, settlement completion time, total amount, and payment method are complete, without missing or outliers, and that the field formats conform to system specifications. After successful verification, key information from the signal is extracted and corresponding data is retrieved: Based on the task ID, the detailed information of the goods to be executed for the outbound task is extracted from the outbound task database, including the unique code of the goods, specifications, batch number, quantity to be shipped, unit of measurement, and source warehouse location information, ensuring consistency between the goods details and the original outbound request; based on the order number, the settlement order is retrieved from the billing database, extracting the settled area and fee details including basic storage fee, area occupancy fee, additional service fee, discount amount, and total amount, synchronously linking the billing basis and rate standard. Then, the instruction data body is constructed, filling in the extracted goods details, settled area, and fee details according to a preset data structure, while supplementing key signal information and data retrieval timestamps to form a complete instruction data body. After construction, the system performs a consistency check on the instruction data body, verifying the correlation between the goods details, settled area, fee details, settlement completion status signal, and the original outbound task, ensuring no data conflicts or deviations. After successful verification, the instruction data body is temporarily stored in the instruction generation cache.

[0039] Step 5.2 involves setting up preset business rules and, based on these rules, obtaining the valid permissions and lifecycle of the instruction, generating a digital signature, and encapsulating the final instruction. Valid permissions are set to be for one-time use; once verified and granted at a certain access control point, the instruction status immediately changes to "used" and cannot be reused at other access control points. Valid permissions specifically include: spatial permissions, time permissions, and usage permissions. The specific implementation process includes: calling the preset outbound business rule library, combining it with the constructed instruction data body, and initiating the permission determination, digital signature generation, and instruction encapsulation process. First, based on business rules, the effective permissions and lifecycle of instructions are clearly defined: effective permissions are set to be used only once, specifically covering three types of permissions: spatial permissions correspond to access control permissions for the warehouse, storage area, shelf area, and outbound passage where the goods originate, and can only be used within the designated storage area and corresponding outbound path; time permissions are set from the time the instruction is generated until 24:00 on the same day or until the goods are outbound, taking the earlier of the two times as the permission expiration time. The usage permission is strictly limited to one-time verification and use. Once verification is completed and the goods are released at a certain access control point, the system will immediately update the instruction status to "used" and simultaneously cancel all permissions of the instruction. It cannot be reused at other access control points or outbound processes, and the access control verification time, location, and operator information will be recorded at the same time. After the lifecycle and permission settings are completed, the system generates a unique digital signature based on the complete content of the instruction data body, the current timestamp, and the system's core key. The final instruction is then encapsulated, including the instruction data body, digital signature, and valid permission details such as space, time, specific scope and rules of usage permissions, lifecycle validity, unique instruction identifier, and generation timestamp. This is structured and integrated according to the system's preset instruction format to ensure orderly association and rapid parsing of all information. After encapsulation, the system performs integrity and security checks on the final instruction, verifying the matching of the digital signature and instruction data body, the consistency of permission settings and business rules, and the standardization of the encapsulation format. Upon successful verification, the final instruction is synchronized to the access control system, handheld PDA terminal, and outbound task scheduling module, while simultaneously recording the instruction encapsulation log, clearly defining the instruction generation details and permission scope.

[0040] In this embodiment of the invention, a series of collaborative instruction generation and security control technologies are employed, including full-dimensional verification and key information extraction of settlement completion status signals, multi-source association construction and consistency verification of instruction data bodies, dynamic setting of space-time-use triple permissions for one-time use, and anti-tampering instruction encapsulation and security verification based on digital signatures. These technologies overcome the technical problems of disconnect between instructions and settlement status, crude permission control that is easily forged or reused, and security risks caused by the lack of anti-tampering mechanisms in traditional warehouse release processes. As a result, the invention achieves the technical effect of generating digital release instructions that are strongly bound to the settlement results, with precise and controllable permissions, and secure traceability. This provides a unique, secure, and reliable execution basis for the access control system to realize "release only after settlement is completed".

[0041] In a preferred embodiment of the present invention, step 6 above may include: Step 6.1: When a transport unit carrying the target goods arrives at the warehouse access control area, the automatic identification device of the access control system automatically identifies the task identification carrier carried on the transport unit and encapsulates the identified task identification along with the current timestamp and access control point number. It then sends a release instruction verification request to the central control platform. Specifically, after the transport unit carrying the target goods, including forklifts, pallet trucks, or automated handling equipment, arrives at the warehouse exit access control area according to the preset picking path, the access control system automatically activates the automatic identification devices deployed on both sides of the access control channel. This device integrates an RFID reader and a high-definition visual barcode scanning module, supporting compatible identification of different types of task identification carriers. The task identification carrier is pre-bound to the corresponding outbound task ID and can be either a passive RFID tag affixed to the side of the transport unit or a visual QR code label, ensuring stable identification in different warehousing environments. After the automatic identification device is activated, it first scans the transport unit using RFID radio frequency signals. If no RFID tag is detected, it automatically switches to visual barcode scanning mode, capturing the QR codes on the transport unit and goods using a high-definition camera. The image recognition algorithm quickly parses the tag content to extract a unique task identifier. After identification, the automatic identification device performs a preliminary validity check on the task identifier, confirming that the identifier format conforms to system specifications and that there are no blurred characters or signs of tampering. If the check passes, it immediately collects the current timestamp and the current access control point number, and structures and encapsulates the task identifier, timestamp, and access control point number according to a preset request format. It then sends a release instruction verification request to the central control platform through an encrypted communication link. At the same time, it retains the request record locally on the access control system, including the request initiation time, the identified task identifier, and access control point information. If identification fails, the automatic identification device will issue an audible and visual alert and simultaneously provide feedback to the picking personnel via a handheld PDA terminal regarding the reason for the identification anomaly, including tag damage, tag obstruction, signal interference, etc., and initiate a secondary identification process. If multiple identifications fail, a manual intervention mechanism is triggered.

[0042] Step 6.2: The central control platform queries and retrieves the corresponding digital release command in real time, and performs multiple security verifications. Specifically, the central control platform receives the release command verification request sent by the access control system in real time. First, it performs preliminary parsing of the request, extracting three core pieces of information: task identifier, timestamp, and access point number. Then, it initiates a multi-security verification process. All verification dimensions are carried out in parallel, and all must pass before proceeding to the subsequent release stage. The first layer is the verification of the validity of the task identifier. The central control platform queries the command database based on the task identifier, retrieves the corresponding digital release command, confirms that the command has been generated and is in a pending state, with no abnormal states such as used, expired, or cancelled. At the same time, it verifies that the task ID in the command is completely consistent with the task identifier in the request, with no matching errors. The second layer is permission matching verification. It retrieves the preset valid permission details from the instruction and verifies whether the current access control point number is within the permitted spatial permissions, ensuring the transport unit exits from the authorized exit access control. Simultaneously, it verifies whether the current timestamp is within the validity period of the time permission and has not exceeded the instruction's expiration time. The third layer is digital signature and data consistency verification. It extracts the digital signature from the digital release instruction and decrypts and verifies it in conjunction with the instruction data body and the system's core key to confirm that the instruction has not been tampered with or forged. It also verifies whether the goods details, source warehouse location information, and the task data associated with the request are consistent, with no data conflicts or abnormal tampering traces. The fourth layer is status linkage verification. The central control platform synchronously queries the outbound task database and inventory management module to confirm that the corresponding outbound task status is still pending execution and the goods inventory status is pending outbound, with no abnormalities such as premature outbound or inventory freeze. If any verification fails, the central control platform immediately generates a verification failure response, specifying the failure dimension and specific reason, and feeds it back to the access control system and handheld PDA terminal, while also recording the verification failure log. If all verifications pass, a verification pass instruction is generated and synchronized to the access control system and its own task scheduling module.

[0043] Step 6.3: When all verifications pass, the access control system sends an opening command to the gate controller, driving the gate to lift and perform physical release. It also sends a verification success notification to the central control platform. Upon receiving the notification, the central control platform immediately executes two atomic operations. In the command database, it updates the status of the corresponding pending outbound task to "outbound" and records the actual outbound timestamp, achieving streamlined settlement and access control linkage for inbound and outbound operations. Specifically, after receiving the verification pass command from the central control platform, the access control system immediately sends an opening command to the gate controller. The gate controller activates its internal motor drive mechanism, slowly lifting the gate to the preset release height. Simultaneously, it activates the anti-pinch sensor and passage indicator light within the access control channel. The passage indicator light turns green, indicating passage is permitted. The anti-pinch sensor monitors the channel in real time; if personnel or transport units are detected standing, the gate descent is paused. After the transport unit has completely passed through the access control channel, the gate controller receives the passage completion signal from the sensor and drives the gate to slowly descend to the closed state, completing the physical release operation. Subsequently, the access control system sends a successful verification notification to the central control platform. The notification includes information such as the task identifier, access point number, actual release timestamp, and gate operation status. Upon receiving the notification, the central control platform immediately executes two atomic operations. The first atomic operation locates the corresponding digital release instruction in the instruction database, updates the instruction status from "pending" to "used," and simultaneously cancels all permissions for the instruction to prevent duplicate verification. It also records the actual verification time, access point number, and operator information. The second atomic operation updates the status of the corresponding pending outbound task in the outbound task database from "pending" to "outbound," accurately records the actual outbound timestamp or access control release timestamp to ensure consistency, and updates the inventory status by deducting the corresponding outbound quantity from the available inventory quantity for that batch of goods, updating the inventory ledger and inventory change log. After these two atomic operations are completed, the central control platform synchronizes the outbound completion data to the financial settlement module, inventory management module, and requesting terminal. The financial settlement module confirms the closed-loop settlement process upon completion of the outbound transaction.

[0044] In this embodiment of the invention, a series of coordinated linkage control and status management technologies, including automatic extraction of task identifiers based on RFID and visual recognition, a four-fold security verification mechanism, and atomic instructions and task status updates, are adopted. These technologies overcome the technical problems of traditional access control systems being disconnected from outbound business flows, security risks caused by single verification dimensions, and delayed or asynchronous updates of business status after release. As a result, the technology achieves a fully closed-loop automated linkage effect of automatic access control identification, accurate verification, secure release, and real-time synchronization of business status. This ensures the mandatory execution of the "release only after settlement" rule at the physical level and guarantees the real-time accuracy and consistency of inventory and financial data.

[0045] like Figure 2As shown, embodiments of the present invention also provide a streamlined settlement and access control system for smart warehouses, comprising: The receiving module is used to receive outbound operation requests for target goods and generate corresponding outbound tasks to be executed. The acquisition module is used to parse and obtain the specific storage location identifier occupied by the target goods in the warehouse storage plane model according to the outbound task to be executed, and retrieve the original closed polygon boundary vertex sequence coordinates that uniquely correspond to the storage location identifier and describe its planar contour from the predefined warehouse space coordinate mapping database. The algorithm module is used to adaptively compress the original vertex sequence by applying a polygon simplification algorithm to generate a simplified polygon boundary vertex sequence coordinate. The processing module is used to calculate the actual area occupied by the simplified polygon boundary vertex sequence coordinates using the shoelace formula, and use the actual area occupied as the core billing parameter to calculate the settlement order containing the fee details and generate a settlement completion status signal. The parsing module is used to automatically generate a digital release instruction that is uniquely bound to the outbound task to be executed based on the settlement completion status signal. This instruction includes the task identifier, goods information, settled area fees, and valid permissions. The control module is used to automatically acquire and verify the validity of the digital release instruction when the transport unit carrying the target goods arrives at the warehouse access control. Only after the verification is successful will the gate be driven to perform physical release and the status of the outbound task to be executed will be automatically updated to "outbound", realizing the linkage between the inbound and outbound assembly line settlement and access control.

[0046] It should be noted that this system is a system corresponding to the above method. All implementation methods in the above method embodiments are applicable to this embodiment and can achieve the same technical effect.

[0047] Embodiments of the present invention also provide a computing device, including: a processor and a memory storing a computer program, wherein the computer program, when executed by the processor, performs the method described above. All implementations in the above method embodiments are applicable to this embodiment and can achieve the same technical effects.

[0048] Embodiments of the present invention also provide a computer-readable storage medium storing instructions that, when executed on a computer, cause the computer to perform the method described above. All implementations in the above method embodiments are applicable to this embodiment and can achieve the same technical effects.

[0049] The above description represents the preferred embodiments of the present invention. It should be noted that those skilled in the art can make various improvements and modifications without departing from the principles of the present invention, and these improvements and modifications should also be considered within the scope of protection of the present invention.

Claims

1. A method for automated settlement and access control linkage for inbound and outbound operations in smart warehouses, characterized in that, The method includes: Step 1: Receive the outbound operation request for the target goods and generate the corresponding outbound task to be executed; Step 2: Based on the outbound task to be executed, parse and obtain the specific storage location identifier occupied by the target goods in the warehouse storage plane model, and retrieve the original closed polygon boundary vertex sequence coordinates that uniquely correspond to the storage location identifier and describe its planar contour from the predefined warehouse space coordinate mapping database. Step 3: Adaptively compress the original vertex sequence by applying a polygon simplification algorithm to generate a simplified polygon boundary vertex sequence coordinate; Step 4: Based on the coordinates of the simplified polygon boundary vertex sequence, calculate its actual footprint using the shoelace formula, and use the actual footprint as the core billing parameter to calculate the settlement order containing the fee details, and generate a settlement completion status signal. Step 5: Based on the settlement completion status signal, automatically generate a digital release instruction uniquely bound to the outbound task to be executed. This instruction includes the task identifier, goods information, settled area fees, and valid permissions. Step 6: When the transport unit carrying the target goods arrives at the warehouse access control, the access control system automatically acquires and verifies the validity of the digital release instruction. Only after the verification is passed will the gate be driven to perform the physical release operation, and the status of the outbound task to be executed will be automatically updated to "outbound", realizing the linkage between the inbound and outbound assembly line settlement and the access control.

2. The method for automated settlement and access control linkage for inbound and outbound operations in intelligent warehouses according to claim 1, characterized in that, In step 1, a request for outbound operation of the target goods is received, and a corresponding outbound task to be executed is generated, including: Step 1.1: Receive a structured outbound operation request sent by the upstream business system or operation terminal. The request includes the target goods identifier, the requested outbound quantity, the destination information, and the identity certificate of the requesting entity. Step 1.2: Perform multi-dimensional compliance verification on the received outbound operation request. Multi-dimensional compliance verification includes verifying whether the request message contains all required fields and conforms to the format specifications, verifying whether the requesting entity has the right to initiate the corresponding quantity of outbound operations on the target goods based on the identity credentials of the requesting entity, querying the inventory database in real time to verify whether the current available inventory quantity of the target goods meets the requested outbound quantity, and confirming that the goods status allows outbound. Step 1.3: After the compliance verification is passed, an outbound task to be executed is automatically generated with a globally unique task identifier. The outbound task to be executed is an independent data object, and its core data structure includes: task ID, goods identifier, quantity to be shipped, source warehouse location information, requester information, task status, and timestamp.

3. The method for automated settlement and access control linkage for inbound and outbound operations in intelligent warehouses according to claim 2, characterized in that, In step 2, based on the outbound task to be executed, the specific storage location identifier occupied by the target goods in the warehouse storage plan model is parsed and obtained. From the predefined warehouse space coordinate mapping database, the coordinate sequence of the original closed polygon boundary vertices that uniquely corresponds to the storage location identifier and describes its planar contour is retrieved, including: Step 2.1: Parse the outbound task object to be executed and extract key cargo identification information; Step 2.2: Query the real-time inventory database based on the goods identification to obtain the physical storage location identifier currently occupied by the goods; Step 2.3: Based on the physical storage location identifier, query the predefined storage space coordinate mapping database to retrieve the coordinate sequence of the original closed polygon boundary vertices uniquely bound to the identifier. The predefined database stores the mapping relationship between each physical storage location identifier and its planar profile defined in a unified world coordinate system.

4. The method for automated settlement and access control linkage for inbound and outbound operations in intelligent warehouses according to claim 3, characterized in that, In step 3, the original vertex sequence is adaptively compressed to generate a simplified polygon boundary vertex sequence coordinates, including: Step 3.1: Set the tolerance threshold, which is dynamically calculated based on the overall accuracy requirements of the warehouse plan model and the geometric scale of the original closed polygon. Step 3.2: Based on the verified original closed polygon vertex sequence, retain the start and end points of the polygon contour, and find the middle vertex with the largest vertical distance of the chord formed by the start and end vertices in the current vertex sequence; if the maximum distance is less than the set tolerance threshold, discard all middle vertices; if it is greater than the tolerance threshold, add the point as a key vertex that must be retained to the result set, and divide the curve into two segments with this point as the boundary. Recursively perform the same process on each segment until all line segments are processed to achieve recursive iterative calculation. Step 3.3: After the recursive iterative calculation is completed, a new sequence consisting of key feature vertices is obtained. This new sequence is then connected end to end to form a simplified closed polygon with a significantly reduced number of vertices.

5. The method for automated settlement and access control linkage for inbound and outbound operations in intelligent warehouses according to claim 4, characterized in that, In step 4, based on the coordinates of the simplified polygon boundary vertex sequence, the actual area occupied is calculated using the shoelace formula. This actual area is then used as the core billing parameter to calculate the settlement order containing fee details and generate a settlement completion status signal, including: Step 4.1: Receive and prepare simplified polygon vertex coordinate data, and normalize the coordinate system. Step 4.2: Traverse the simplified vertex sequence and obtain the actual area occupied by calculating the sum of the cross products of the polygon vertex coordinates; Step 4.3: Based on historical data, perform a weighted summation of the actual occupied area and billing strategy to generate a cost breakdown and settlement order. The billing strategy calls a predefined dynamic billing engine to calculate the total cost based on historical cargo types, storage duration, current rate table, and additional service fee rules. Step 4.4: Monitor and confirm the final status of the expense details and settlement order, and generate a settlement completion status signal.

6. The method for automated settlement and access control linkage for inbound and outbound operations in intelligent warehouses according to claim 5, characterized in that, In step 5, based on the settlement completion status signal, a digital release instruction uniquely bound to the outbound task to be executed is automatically generated. This instruction includes the task identifier, goods information, settled area fees, and valid permissions, including: Step 5.1: Receive and verify the settlement completion status signal, extract key information from the status signal and construct the instruction data body. The instruction data body includes the goods details in the outbound task to be executed, as well as the settled area and corresponding cost details obtained from the settlement order. Step 5.2: Based on the preset business rules, obtain the valid permissions and lifecycle of the instruction, generate a digital signature and encapsulate the final instruction. The valid permissions are set to be used only once. Once verified and granted at a certain access control point, the instruction status immediately changes to "used" and cannot be reused for other access control points. The valid permissions specifically include: space permissions, time permissions and usage permissions.

7. The method for automated settlement and access control linkage for inbound and outbound operations in intelligent warehouses according to claim 6, characterized in that, In step 6, when the transport unit carrying the target goods arrives at the warehouse access control, the access control system automatically acquires and verifies the validity of the digital release instruction. Only after successful verification is the gate activated to perform a physical release, and the status of the pending outbound task is automatically updated to "outbound," realizing a streamlined settlement and access control linkage for inbound and outbound operations, including: Step 6.1: When the transport unit carrying the target goods arrives at the warehouse access control area, the automatic identification device of the access control system automatically identifies the task identification carrier carried on the transport unit, and encapsulates the identified task identification along with the current timestamp and access control point number, and sends a release instruction verification request to the central control platform. Step 6.2: The central control platform queries and obtains the corresponding digital release instructions in real time and performs multiple security verifications; Step 6.3: When all verifications pass, the access control system sends an opening command to the gate controller, drives the gate to lift, performs physical release, and sends a verification success notification to the central control platform. Upon receiving the notification, the central control platform immediately performs two atomic operations; and in the command database, updates the status of the corresponding pending outbound task to "outbound" and records the actual outbound timestamp, realizing the linkage between the inbound / outbound assembly line settlement and access control.

8. A streamlined settlement and access control system for inbound and outbound operations in a smart warehouse, wherein the system implements the method as described in any one of claims 1 to 7, characterized in that, include: The receiving module is used to receive outbound operation requests for target goods and generate corresponding outbound tasks to be executed. The acquisition module is used to parse and obtain the specific storage location identifier occupied by the target goods in the warehouse storage plane model according to the outbound task to be executed, and retrieve the original closed polygon boundary vertex sequence coordinates that uniquely correspond to the storage location identifier and describe its planar contour from the predefined warehouse space coordinate mapping database. The algorithm module is used to adaptively compress the original vertex sequence by applying a polygon simplification algorithm to generate a simplified polygon boundary vertex sequence coordinate. The processing module is used to calculate the actual area occupied by the simplified polygon boundary vertex sequence coordinates using the shoelace formula, and use the actual area occupied as the core billing parameter to calculate the settlement order containing the fee details and generate a settlement completion status signal. The parsing module is used to automatically generate a digital release instruction that is uniquely bound to the outbound task to be executed based on the settlement completion status signal. This instruction includes the task identifier, goods information, settled area fees, and valid permissions. The control module is used to automatically acquire and verify the validity of the digital release instruction when the transport unit carrying the target goods arrives at the warehouse access control. Only after the verification is successful will the gate be driven to perform physical release and the status of the outbound task to be executed will be automatically updated to "outbound", realizing the linkage between the inbound and outbound assembly line settlement and access control.

9. A computing device, characterized in that, include: One or more processors; A storage device for storing one or more programs, which, when executed by one or more processors, cause the one or more processors to perform the method as described in any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a program that, when executed by a processor, implements the method as described in any one of claims 1 to 7.