A method and device for generating design documents under a low-code development environment

By employing a deep Q-network model and a greedy strategy in a low-code environment to dynamically program the sequence of stamp sets, the problem of design document generation lagging behind business logic adjustments in low-code platforms is solved, achieving efficient and secure dynamic design document generation.

CN120578418BActive Publication Date: 2025-12-16SMARTDOT TECH CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202511086157.5
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2025-08-05
Publication Date
2025-12-16
Estimated Expiration
2045-08-05

AI Technical Summary

Technical Problem

In low-code development environments, existing technologies struggle to dynamically integrate approval rules, real-time transaction forms, and access control. This results in design document generation lagging behind business logic adjustments, failing to respond to environmental changes in real time, and lacking the ability to map dynamic permissions and stamp sequences in real time, thus affecting the readability and usability of the documents.

Method used

The system uses low-code services to obtain approval rule data, converts it into a two-dimensional table, and generates a real-time transaction form by scanning and rendering the environment in real time through the client. It then uses a deep Q-network model and a greedy strategy to perform adaptive dynamic programming in the decision state space of the enabled stamp set, generating a sequence of enabled stamp sets, and finally generating a design document containing dynamic permissions.

Benefits of technology

It enables efficient and secure generation of dynamic design documents in a low-code environment, automatically adapts to permission changes, optimizes the planning of stamp collections, improves the efficiency and security of document generation, and adapts to autonomous decision-making in complex and dynamic environments.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN120578418B_ABST
    Figure CN120578418B_ABST
Patent Text Reader

Abstract

The application relates to the technical field of seal collection document planning, in particular to a method and device for generating design documents in a low-code development environment, which adopts a low-code service to acquire approval rule data of a task area collected by an approval node and converts the approval rule data into a two-dimensional table; a real-time scanning and rendering environment is generated, a real-time transaction form is matched with a two-dimensional table space to generate a document template; based on the passable area marking of the two-dimensional table and the document template, a seal collection decision state space is constructed; a seal collection of a client is divided into seals of multiple institutions, adaptive dynamic programming is performed in the seal collection decision state space, and a seal collection sequence is generated; and a rendering design document of the client is generated according to the seal collection sequence. The application can consume fewer resources for information searching, screening and problem positioning, has high page debugging efficiency, can efficiently support real-time adaptive adjustment under a large-scale environment, and improves the response speed and security of the client.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This application relates to the field of seal collection document planning technology, and in particular to a method and apparatus for generating design documents in a low-code development environment. Background Technology

[0002] In low-code development environments, the automated generation of design documents is a key step in improving development efficiency and lowering the technical barrier to entry. Traditional design document generation methods typically rely on manual writing or automated tools based on fixed templates, making it difficult to adapt to the dynamically changing business rules and user needs within low-code platforms. Especially in complex approval processes and access control scenarios, existing technologies often cannot respond to environmental changes in real time, resulting in discrepancies between the generated documents and the actual business logic.

[0003] Currently, low-code platforms typically use rule engines or workflow engines to handle approval processes, but these methods have the following limitations: traditional methods hardcode approval rules or store them in static configuration files, making it difficult to adapt to dynamically changing business needs, especially in scenarios with multi-task area collaboration, where conflicts and priority issues between rules cannot be effectively resolved; the generation of design documents often lags behind adjustments to business logic and lacks the ability to map dynamic permissions and stamp sequences in real time, resulting in reduced document readability and usability.

[0004] Therefore, there is an urgent need for a method that can dynamically integrate approval rules, real-time transaction forms and access control in a low-code environment, and generate highly available design documents through intelligent algorithms, in order to fill the gaps in existing technologies. Summary of the Invention

[0005] This application provides a method and apparatus for generating design documents in a low-code development environment, in order to solve the problems of poor coupling between code and documents for dynamic permissions and low computational efficiency of spatial stamp set search in the prior art.

[0006] Firstly, this application provides a method for generating design documents in a low-code development environment, including:

[0007] The approval rule data of the task area collected by the approval node is obtained using a low-code service, and the approval rule data is converted into a two-dimensional table.

[0008] The client-side page components scan the rendering environment in real time to generate a real-time transaction form. The real-time transaction form is then spatially registered with the two-dimensional table to generate a document template containing dynamic permissions.

[0009] Based on the accessible area markings in the two-dimensional table and the document template, a decision state space for enabling the set of seals is constructed.

[0010] A deep Q-network model is used to divide the client's set of enabled seals into seals of multiple institutions. An adaptive dynamic programming is then performed in the decision state space of the set of enabled seals using a greedy strategy to generate a sequence of enabled seal sets.

[0011] Based on the sequence of enabled stamps, the client's rendering design document is generated.

[0012] Optionally, the deep Q-network model is used to divide the client's enabled seal set into seals from multiple institutions. An adaptive dynamic programming approach is then used in the decision state space of the enabled seal set, combined with a greedy strategy, to generate a sequence of enabled seal sets, including:

[0013] A deep Q-network model is used to process the address sequence of the enabled stamp set to generate a set of segmentation point location addresses;

[0014] Based on the set of split point locations, the set of activated seals is divided from the starting point to the ending point into a set containing seals from multiple organizations;

[0015] For each institution's seal, the starting point address of the seal is extracted, and a local address system is constructed with the starting point address as the origin. The seal is discretized under the local address system to generate a sequence of seal set points.

[0016] Based on the sequence of seal collection points, the permission level features are defined. The corresponding area data is extracted from the decision state space of the enabled seal collection to obtain the local decision state space of the seal collection, which is used as the decision state space of the seal collection associated with the seal.

[0017] Using a greedy strategy, adaptive dynamic programming is performed in the decision state space of the set of seals associated with each institution to generate a planned sequence of seal addresses.

[0018] Based on the order of the dividing points, assign corresponding institution indices to the planned seal address sequence of all institutions to form an activated seal set sequence.

[0019] Optionally, the step of using a greedy strategy to perform adaptive dynamic programming in the decision state space of the set of seals associated with each institution's seal, generating a planned sequence of seal addresses, includes:

[0020] Using a greedy strategy, the adjacent states are traversed in the decision state space of the local stamp set, the action value function value is calculated, and the state corresponding to the maximum value of the action value function is selected to form a state transition chain composed of a sequence of action selection identifiers.

[0021] A set of state transition stamps is generated based on the action selection identifier sequence in the state transition chain;

[0022] The state transition stamp set is converted into the original address space stamp set through the mapping relationship between the local address system and the enabled address system;

[0023] Based on the original set of address space stamps, a planned sequence of stamp addresses is generated.

[0024] Optionally, the step of using a greedy strategy to traverse adjacent states in the local stamp set decision state space, calculate the action value function value, and select the state corresponding to the maximum action value function value to form a state transition chain composed of an action selection identifier sequence includes:

[0025] The activation address of the current state in the decision state space of the local stamp set is converted into a local relative address, and a mapping table between the state identifier and the local relative address is generated.

[0026] Based on the local relative address of the current state in the mapping table, extract eight neighboring address points and filter adjacent states that fall within the local stamp set decision state space to generate a set of adjacent state identifiers.

[0027] Calculate the absolute deviation value of each element in the adjacent state identifier set and the reciprocal of the nearest permission Euclidean distance, and then sum them in a weighted manner to generate the action value function value;

[0028] The action value function values ​​are compared, and the state identifier corresponding to the maximum value of the action value function is selected to generate the selected state identifier for the transition between states.

[0029] Set the selected state identifier as the new current state, repeat the filtering, calculation, and selection operations until the termination point state, and output a state transition chain consisting of the action selection identifier sequence.

[0030] Optionally, the step of constructing the decision state space for enabling the stamp set based on the passable area markings in the two-dimensional table and the document template includes:

[0031] The rate of change of approval rules for adjacent grids in the two-dimensional table is calculated to generate a grid diagram of the rate of change of approval rules.

[0032] From the approval rule change rate grid, candidate grids with approval rule change rates lower than a preset change rate threshold are selected, and connected region detection and area threshold filtering are performed on adjacent candidate grids to generate a set of passable area annotations.

[0033] Spatial clustering identification is performed on the transaction cluster center addresses of the document template to obtain a transaction cluster set. The transaction cluster center address set is generated by calculating based on the two-dimensional geometric center addresses of each cluster in the transaction cluster set.

[0034] Based on the set of transaction cluster center addresses, the reciprocal of the Euclidean distance from each grid to the nearest transaction cluster center is calculated and risk analysis is performed to generate a set of risk level identifiers;

[0035] Associating the grid address of the approval rule change rate grid diagram with the corresponding passage status in the passable area label set and the corresponding risk level in the risk level identifier set, we obtain the decision state space of the activated seal set.

[0036] Optionally, associating the grid address of the approval rule change rate grid map with the corresponding passage status in the passable area label set and the corresponding risk level in the risk level identifier set to obtain the activated stamp set decision state space includes:

[0037] Based on the accessibility status markers in the accessible area label set and the risk level identifiers in the risk level identifier set, create a set of status attribute structures;

[0038] Establish a mapping relationship between the grid address of the two-dimensional table and the set of state attribute structures, and construct the decision state space of the enabled stamp set.

[0039] Optionally, based on the set of transaction cluster center addresses, the reciprocal of the Euclidean distance from each grid to the nearest transaction cluster center is calculated and risk analysis is performed to generate a set of risk level identifiers, including:

[0040] Calculate the minimum Euclidean distance from each grid in the two-dimensional table to the set of nearest transaction cluster center addresses and take its reciprocal to generate a set of risk level coefficients;

[0041] A set of risk level coefficients is generated by dividing the risk level range into preset intervals.

[0042] Furthermore, the step of generating the client's rendering design document based on the sequence of enabled stamps also includes:

[0043] Construct at least one low-code data segment, wherein each low-code data segment includes basic attributes, and the basic attributes include at least a primary key value, an attribute name, and an attribute content;

[0044] The system obtains a business document uploaded by a user, parses the business document into an encrypted component, and renders the encrypted component into an online editing document. Each editing unit of the business document has a unique identifier in the encrypted component.

[0045] Select the editing unit to be edited as the selected editing unit, and select at least one low code data segment as the selected low code data segment corresponding to the selected editing unit;

[0046] The selected low-code data segment and the selected editing unit are bound together based on the unique identifier of the selected editing unit and the primary key value of the selected low-code data segment. The attribute content of the selected low-code data segment is inserted into the encrypted component of the corresponding selected editing unit to form an updated component. The unupdated component and the updated component are rendered to form a personalized document.

[0047] Secondly, this application provides an apparatus for generating design documents in a low-code development environment, comprising:

[0048] The acquisition module is used to acquire the approval rule data of the task area collected by the approval node using low-code services, and convert the approval rule data into a two-dimensional table;

[0049] The matching module is used to scan the rendering environment in real time through the page components mounted on the client, generate a real-time transaction form, and spatially register the real-time transaction form with the two-dimensional table to generate a document template containing dynamic permissions.

[0050] The construction module is used to construct a decision state space for enabling the stamp set based on the accessible area markings in the two-dimensional table and the document template.

[0051] The generation module is used to divide the client's set of enabled seals into seals of multiple institutions using a deep Q-network model, and to perform adaptive dynamic programming in the decision state space of the set of enabled seals using a greedy strategy to generate a sequence of enabled seal sets.

[0052] The document design module generates the client's rendered design document based on the sequence of enabled stamps.

[0053] This application provides a method for generating design documents in a low-code development environment. The method includes: acquiring approval rule data from a task area collected by an approval node using a low-code service; converting the approval rule data into a two-dimensional table; generating a real-time transaction form by scanning the rendering environment in real-time using a page component mounted on the client; spatially registering the real-time transaction form with the two-dimensional table to generate a document template containing dynamic permissions; constructing an enabled stamp set decision state space based on the passable area annotations in the two-dimensional table and the document template; using a deep Q-network model to divide the enabled stamp set of the client into stamps from multiple institutions; performing adaptive dynamic programming in the enabled stamp set decision state space using a greedy strategy to generate an enabled stamp set sequence; and generating the rendered design document for the client based on the enabled stamp set sequence.

[0054] This application constructs a high-precision static environment model by converting the approval rule data of the approval node into a two-dimensional grid, providing a reliable spatial benchmark for the planning of the stamp set. By leveraging the spatial registration of real-time transactions in page components and static data tables, it achieves the fusion perception of dynamic and static environments, forming a dynamic code-document coupling layer that includes sudden permissions. The decision state space for the stamp set activation is constructed based on the traversable area annotation and the real-time code-document coupling layer, unifying environmental constraints and dynamic variables. Finally, a branch-level stamp set cutting mechanism using a deep Q-network is adopted, combined with a greedy strategy to perform adaptive dynamic planning in the state space, simultaneously achieving the triple objectives of adaptability to complex terrain, real-time avoidance of dynamic obstacles, and optimal energy of the stamp set activation, thereby improving the client's autonomous decision-making efficiency and rendering security in unknown dynamic environments.

[0055] Furthermore, a deep Q-network model is first used to process the address sequence of the enabled seal set, generating a set of key segmentation point addresses. This divides the enabled seal set into multiple consecutive institution seal sets. For each seal, a local address system is constructed with its starting point as the origin. The seal is discretized to generate a seal set point sequence. Then, based on the seal set point sequence, permission level features are defined, and corresponding region data is extracted from the enabled seal set decision state space to form a local seal set decision state space. Subsequently, a greedy strategy is used to perform adaptive dynamic programming in the local state space. By traversing adjacent states, the action value function value is calculated, and the state corresponding to the maximum value is selected, generating a state transition chain composed of action selection identifier sequences. Based on this, the state transition seal set is derived, and then converted into the original address space seal set through the mapping relationship between the local and enabled address systems. Finally, the planned seal address sequence is generated. The planned seals of all institutions are assigned institution indices according to the segmentation point order and reorganized to form a complete enabled seal set sequence. By using deep Q-network-driven stamp set segmentation and state space construction under local address systems, the computational dimensionality is significantly reduced. Combined with a greedy strategy, the state transition stamp set that maximizes the action value is quickly selected within the local space, achieving millisecond-level dynamic response capability. At the same time, feature constraints based on permission levels ensure the smoothness and robustness of the stamp set, while the local-to-enabled address mapping and organization index reorganization mechanism ensure that each segmented stamp set is seamlessly connected to become the optimal enabled stamp set. Thus, planning efficiency, security, and adaptability are simultaneously improved in complex dynamic environments.

[0056] These or other aspects of this application will become more apparent in the following description of the embodiments. Attached Figure Description

[0057] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0058] Figure 1 A flowchart illustrating a method for generating design documents in a low-code development environment, as provided in this application embodiment;

[0059] Figure 2 This is a schematic diagram of a device for generating design documents in a low-code development environment, provided as an embodiment of this application. Detailed Implementation

[0060] To enable those skilled in the art to better understand the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings.

[0061] In some of the processes described in the specification, claims, and accompanying drawings of this application, multiple operations appearing in a specific order are included. However, it should be clearly understood that these operations may not be executed in the order they appear herein, or may be executed in parallel. The operation numbers, such as 11, 12, etc., are merely used to distinguish different operations and do not themselves represent any execution order. Furthermore, these processes may include more or fewer operations, and these operations may be executed sequentially or in parallel. It should be noted that the descriptions such as "first," "second," etc., in this document are used to distinguish different messages, devices, modules, etc., and do not represent a sequential order, nor do they limit "first" and "second" to different types.

[0062] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0063] Figure 1 A flowchart illustrating a method for generating design documents in a low-code development environment, as provided in this application embodiment, is shown below. Figure 1 As shown, the method includes:

[0064] S11. Use low-code services to obtain the approval rule data of the task area collected by the approval node, and convert the approval rule data into a two-dimensional table.

[0065] S12. The client-side page components scan the rendering environment in real time to generate a real-time transaction form. The real-time transaction form is then spatially registered with the two-dimensional table to generate a document template containing dynamic permissions.

[0066] S13. Based on the traversable area annotations and document templates in the two-dimensional table, construct the decision state space for enabling the stamp set.

[0067] S14. Using a deep Q-network model, the client's set of enabled seals is divided into seals of multiple institutions. A greedy strategy is combined to perform adaptive dynamic programming in the decision state space of the set of enabled seals to generate a sequence of enabled seals.

[0068] Here, the Deep Q-Network model refers to a reinforcement learning algorithm that combines deep neural networks and Q-learning to learn optimal action policies. The enabled stamp set refers to the complete rendering route from the client's origin to its destination. A stamp is a sub-unit into which the enabled stamp set is divided, with each segment representing a decision-making body, including short-distance stamp set fragments. A greedy policy is a method of selecting the immediate optimal action in decision-making, including selecting the action with the maximum Q-value at each state to locally optimize the stamp set. Adaptive dynamic programming is an algorithm that adjusts the planning process according to changes in the environment. The enabled stamp set sequence refers to an ordered list of generated stamp set points.

[0069] In this embodiment, a deep Q-network model is first used to divide the set of enabled stamps into multiple consecutive stamps according to a distance threshold. Then, for each stamp, a local decision domain is defined in the decision state space of the set of enabled stamps based on the starting point. Next, a greedy strategy is used to select the state node with the highest action value in the local decision domain. Finally, the optimized stamp sets of each institution are generated by backtracking through the state nodes and connected to form a sequence of enabled stamp sets.

[0070] S15, Based on the sequence of activated stamps, generate the client's rendering design document;

[0071] This involves designing low-code components that meet business requirements, integrating these low-code components with basic functional components to form a business form interface, and collecting the data from the basic attributes of the low-code components on the business form interface to obtain a low-code data segment.

[0072] Fill in the attribute content in the basic attributes of the low-code component in the business form interface, and combine the attribute content to obtain the low-code data segment. The data content of the low-code data segment is stored in the database table.

[0073] Each low-code data segment contains at least one basic attribute, and the low-code data segment includes attribute combination methods that define how basic attributes are combined.

[0074] The unique identifier consists of the timestamp of the imported business document and the position of the editing unit in the business document.

[0075] The system identifies the text and default text configuration in the business document, and converts the text into an encrypted component according to the default configuration; it also identifies the tables, sub-cells, and default table configurations in the business document, and converts the tables and sub-cells into encrypted components according to the default table configurations.

[0076] A binding relationship string is generated based on the unique identifier and the primary key value, wherein the binding relationship string includes at least the unique identifier and the primary key value. The attribute content of the corresponding selected low-code data segment is retrieved based on the binding relationship string, and the attribute content is dynamically inserted into the corresponding encryption component to form an update component.

[0077] By executing S11~S15, this embodiment of the application achieves efficient and secure rendering of the client in a dynamic environment by integrating approval node data and real-time page component scanning. It can automatically adapt to changes in permissions, optimize the planning of the stamp set, reduce the risk of document generation, and improve the efficiency and reliability of task execution.

[0078] Optionally, the deep Q-network model is used to divide the client's enabled seal set into seals from multiple institutions. An adaptive dynamic programming approach is then used in the decision state space of the enabled seal set, combined with a greedy strategy, to generate a sequence of enabled seal sets, including:

[0079] A deep Q-network model is used to process the address sequence of the enabled stamp set to generate a set of segmentation point location addresses;

[0080] Based on the set of split point locations, the set of activated seals is divided from the starting point to the ending point into a set containing seals from multiple organizations;

[0081] For each institution's seal, the starting point address of the seal is extracted, and a local address system is constructed with the starting point address as the origin. The seal is discretized under the local address system to generate a sequence of seal set points.

[0082] Based on the sequence of seal collection points, the permission level features are defined. The corresponding area data is extracted from the decision state space of the enabled seal collection to obtain the local decision state space of the seal collection, which is used as the decision state space of the seal collection associated with the seal.

[0083] Using a greedy strategy, adaptive dynamic programming is performed in the decision state space of the set of seals associated with each institution to generate a planned sequence of seal addresses.

[0084] Based on the order of the dividing points, assign corresponding institution indices to the planned seal address sequence of all institutions to form an activated seal set sequence.

[0085] In this embodiment, the low-code platform needs to automatically generate design documents for a multi-level approval system. This system involves multiple approval nodes (such as submission, initial review, secondary review, and final review), each with different permission rules and seal invocation logic. Traditional methods struggle to dynamically optimize the seal invocation order, leading to low document generation efficiency. This embodiment employs a Deep Q-Network (DQN) + greedy strategy for adaptive planning to generate the optimal seal sequence.

[0086] Optionally, the step of using a greedy strategy to perform adaptive dynamic programming in the decision state space of the set of seals associated with each institution's seal, generating a planned sequence of seal addresses, includes:

[0087] Using a greedy strategy, the adjacent states are traversed in the decision state space of the local stamp set, the action value function value is calculated, and the state corresponding to the maximum value of the action value function is selected to form a state transition chain composed of a sequence of action selection identifiers.

[0088] A set of state transition stamps is generated based on the action selection identifier sequence in the state transition chain;

[0089] The state transition stamp set is converted into the original address space stamp set through the mapping relationship between the local address system and the enabled address system;

[0090] Based on the original set of address space stamps, a planned sequence of stamp addresses is generated.

[0091] Optionally, the step of using a greedy strategy to traverse adjacent states in the local stamp set decision state space, calculate the action value function value, and select the state corresponding to the maximum action value function value to form a state transition chain composed of an action selection identifier sequence includes:

[0092] The activation address of the current state in the decision state space of the local stamp set is converted into a local relative address, and a mapping table between the state identifier and the local relative address is generated.

[0093] Based on the local relative address of the current state in the mapping table, extract eight neighboring address points and filter adjacent states that fall within the local stamp set decision state space to generate a set of adjacent state identifiers.

[0094] Calculate the absolute deviation value of each element in the adjacent state identifier set and the reciprocal of the nearest permission Euclidean distance, and then sum them in a weighted manner to generate the action value function value;

[0095] The action value function values ​​are compared, and the state identifier corresponding to the maximum value of the action value function is selected to generate the selected state identifier for the transition between states.

[0096] Set the selected state identifier as the new current state, repeat the filtering, calculation, and selection operations until the termination point state, and output a state transition chain consisting of the action selection identifier sequence.

[0097] Optionally, the step of constructing the decision state space for enabling the stamp set based on the passable area markings in the two-dimensional table and the document template includes:

[0098] The rate of change of approval rules for adjacent grids in the two-dimensional table is calculated to generate a grid diagram of the rate of change of approval rules.

[0099] From the approval rule change rate grid, candidate grids with approval rule change rates lower than a preset change rate threshold are selected, and connected region detection and area threshold filtering are performed on adjacent candidate grids to generate a set of passable area annotations.

[0100] Spatial clustering identification is performed on the transaction cluster center addresses of the document template to obtain a transaction cluster set. The transaction cluster center address set is generated by calculating based on the two-dimensional geometric center addresses of each cluster in the transaction cluster set.

[0101] Based on the set of transaction cluster center addresses, the reciprocal of the Euclidean distance from each grid to the nearest transaction cluster center is calculated and risk analysis is performed to generate a set of risk level identifiers;

[0102] Associating the grid address of the approval rule change rate grid diagram with the corresponding passage status in the passable area label set and the corresponding risk level in the risk level identifier set, we obtain the decision state space of the activated seal set.

[0103] Optionally, associating the grid address of the approval rule change rate grid map with the corresponding passage status in the passable area label set and the corresponding risk level in the risk level identifier set to obtain the activated stamp set decision state space includes:

[0104] Based on the accessibility status markers in the accessible area label set and the risk level identifiers in the risk level identifier set, create a set of status attribute structures;

[0105] Establish a mapping relationship between the grid address of the two-dimensional table and the set of state attribute structures, and construct the decision state space of the enabled stamp set.

[0106] Optionally, based on the set of transaction cluster center addresses, the reciprocal of the Euclidean distance from each grid to the nearest transaction cluster center is calculated and risk analysis is performed to generate a set of risk level identifiers, including:

[0107] Calculate the minimum Euclidean distance from each grid in the two-dimensional table to the set of nearest transaction cluster center addresses and take its reciprocal to generate a set of risk level coefficients;

[0108] A set of risk level coefficients is generated by dividing the risk level range into preset intervals.

[0109] Furthermore, the step of generating the client's rendering design document based on the sequence of enabled stamps also includes:

[0110] Construct at least one low-code data segment, wherein each low-code data segment includes basic attributes, and the basic attributes include at least a primary key value, an attribute name, and an attribute content;

[0111] The system obtains a business document uploaded by a user, parses the business document into an encrypted component, and renders the encrypted component into an online editing document. Each editing unit of the business document has a unique identifier in the encrypted component.

[0112] Select the editing unit to be edited as the selected editing unit, and select at least one low code data segment as the selected low code data segment corresponding to the selected editing unit;

[0113] The selected low-code data segment and the selected editing unit are bound together based on the unique identifier of the selected editing unit and the primary key value of the selected low-code data segment. The attribute content of the selected low-code data segment is inserted into the encrypted component of the corresponding selected editing unit to form an updated component. The unupdated component and the updated component are rendered to form a personalized document.

[0114] In this embodiment, the scenario involves a development zone in a certain city requiring approvals from three departments: land, environmental protection, and fire safety.

[0115] In practice, the low-code platform obtains the rules of each department: the land bureau requires "non-agricultural land", the environmental protection bureau requires "noise < 60 decibels", and the fire department requires "≥ 2 passageways".

[0116] Map the rules to a virtual coordinate grid: for example, coordinates (1,1) represent industrial land (compliant with land bureau rules), and coordinates (1,2) represent agricultural land (violating land bureau rules). This creates a rule grid diagram covering the entire area.

[0117] Engineers scan QR codes and fill out forms at the construction site;

[0118] Scan the construction site with your mobile phone to generate a real-time form: including location coordinates (1,1), industrial land attributes, noise level of 55 decibels, 3 channels and other data.

[0119] The system matches the form coordinates (1,1) with the rule grid: automatically unlocking the approval fields for the land, environmental protection, and fire departments, and generating a dynamic permission document template. If a match is found at coordinates (1,2) (agricultural land), only the land bureau's field will be open.

[0120] When constructing the decision state space, the rate of change of adjacent regions of the regular grid is calculated. For example, industrial land areas have stable rules (low rate of change), while the rate of change is high at the boundary between agriculture and industry. Regions with a rate of change below a threshold are selected and marked as "passable areas" (such as concentrated industrial land areas).

[0121] Identify the clustering points of approval fields in the document template. For example, the land bureau fields are concentrated in the upper left area, and the fire department fields are in the lower right area. Calculate the coordinates of each clustering center.

[0122] Using the cluster center as a reference, calculate the reciprocal of the distance from the nearest center to the grid. The closer the distance, the higher the risk (e.g., areas with concentrated fire safety barriers require focused review), and classify them into high, medium, and low risk levels.

[0123] The "accessibility status" and "risk level" of each grid are linked to form a decision state space. For example, coordinates (1,1) are marked as "accessible + low risk".

[0124] When generating the sequence of stamp sets, the stamp set is segmented: the deep Q-network divides all locations to be stamped (e.g., 20 coordinate points) by department. For example, the first 5 points belong to the Land Bureau, the middle 10 points to the Environmental Protection Bureau, and the last 5 points to the Fire Department.

[0125] Local path planning:

[0126] Establish a local coordinate system with the first coordinate point (1,1) of the Land Bureau as the origin, and convert the five points of the bureau into relative positions (e.g., point A: (0,0), point B: (0,1)).

[0127] Within the local decision space, a greedy strategy is used to select the optimal path:

[0128] Starting from point A, detect the eight adjacent points in the surrounding directions.

[0129] Calculate the action value of each point (e.g., moving due north shortens the distance to the target and has low risk, so it has the highest value).

[0130] Move to the point with the highest value and gradually form a path chain (such as A→B→C).

[0131] Convert the local path coordinates back to the original grid coordinates;

[0132] Generate sequence: Merge paths in the order of Land Bureau → Environmental Protection Bureau → Fire Bureau, and output the complete stamp sequence;

[0133] When users upload project planning diagrams, approval data needs to be inserted.

[0134] The system analyzes the planning map into editable units (such as the "Land Use Type" and "Fire Access" columns), and each unit is assigned a unique ID.

[0135] Create a low-code data segment: for example, a data segment with primary key "LAND-001", attribute name "Land Use", and attribute value "Industrial Land".

[0136] Bind data: Select the "Land Use Type" column (ID: AREA-01), associate the data segment "LAND-001", and insert the "Industrial Land" value into the column.

[0137] Rendering results: The "Land Use Type" column in the planning map automatically displays "Industrial Land", and other columns add departmental electronic seals according to the seal sequence to generate the final approval document;

[0138] After construction site personnel scan the code, the system automatically generates a document containing approval fields from the three departments and adds an electronic seal according to the optimal path, without requiring manual code configuration throughout the entire process.

[0139] Figure 2 A schematic diagram of a device for generating design documents in a low-code development environment is provided as an embodiment of this application. Figure 2 As shown, the device includes:

[0140] The acquisition module 21 is used to acquire the approval rule data of the task area collected by the approval node using low-code services, and convert the approval rule data into a two-dimensional table.

[0141] The matching module 22 is used to scan the rendering environment in real time through the page components mounted on the client, generate a real-time transaction form, and spatially register the real-time transaction form with the two-dimensional table to generate a document template containing dynamic permissions.

[0142] Module 23 is used to construct the decision state space for enabling the stamp set based on the traversable area annotation and document template of the two-dimensional table.

[0143] The generation module 24 is used to divide the client's set of enabled seals into seals of multiple institutions using a deep Q-network model, and to perform adaptive dynamic programming in the decision state space of the set of enabled seals using a greedy strategy to generate a sequence of enabled seal sets.

[0144] Document design module 25 generates the client's rendering design document based on the sequence of enabled stamps.

[0145] Figure 2 The device for generating design documents in a low-code development environment can execute... Figure 1 The implementation principle and technical effects of the method for generating design documents in a low-code development environment described in the illustrated embodiment will not be repeated here. The specific methods by which each module and unit performs operations in the apparatus for generating design documents in a low-code development environment described in the above embodiments have been described in detail in the embodiments related to this method, and will not be elaborated upon here.

[0146] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. Those skilled in the art can understand and implement this without any creative effort.

[0147] Through the above description of the embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus necessary general-purpose hardware platforms, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solutions, in essence or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods described in the various embodiments or some parts of the embodiments.

[0148] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of this application, and are not intended to limit them. Although this application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some of the technical features. Such modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of this application.

[0149] In the several embodiments provided in this application, it should be understood that the disclosed apparatus, devices, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another device, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed between each other can be indirect coupling or communication connection through some seals, devices, or units, and can be electrical, mechanical, or other forms.

[0150] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated units described above can be implemented in hardware or as software functional units. The above are merely embodiments of this application and do not limit the patent scope of this application. Any equivalent structural or procedural transformations made based on the description and drawings of this application, or direct or indirect applications in other related technical fields, are similarly included within the patent protection scope of this application.

[0151] The specific embodiments of the invention have been described in detail above, but they are only examples, and this application is not limited to the specific embodiments described above. For those skilled in the art, any equivalent modifications or substitutions to the invention are also within the scope of this application. Therefore, all equivalent changes, modifications, and improvements made without departing from the spirit and principles of this application should be covered within the scope of this application.

Claims

1. A method for generating design documents in a low-code development environment, characterized in that, include: The approval rule data of the task area collected by the approval node is obtained using a low-code service, and the approval rule data is converted into a two-dimensional table. The client-side page components scan the rendering environment in real time to generate a real-time transaction form. The real-time transaction form is then spatially registered with the two-dimensional table to generate a document template containing dynamic permissions. Based on the accessible area markings in the two-dimensional table and the document template, a decision state space for enabling the set of seals is constructed. A deep Q-network model is used to divide the client's set of enabled seals into seals of multiple institutions. An adaptive dynamic programming is then performed in the decision state space of the set of enabled seals using a greedy strategy to generate a sequence of enabled seal sets. Based on the sequence of enabled stamps, generate the client's rendering design document; The method employs a deep Q-network model to divide the client's enabled seal set into seals from multiple institutions. A greedy strategy is then used to perform adaptive dynamic programming in the decision state space of the enabled seal set to generate a sequence of enabled seal sets, including: A deep Q-network model is used to process the address sequence of the enabled stamp set to generate a set of segmentation point location addresses; Based on the set of split point locations, the set of activated seals is divided from the starting point to the ending point into a set containing seals from multiple organizations; For each institution's seal, the starting point address of the seal is extracted, and a local address system is constructed with the starting point address as the origin. The seal is discretized under the local address system to generate a sequence of seal set points. Based on the sequence of seal collection points, the permission level features are defined, and the corresponding area data is extracted from the decision state space of the enabled seal collection to obtain the local decision state space of the seal collection, which is used as the decision state space of the seal collection associated with the seal. Using a greedy strategy, adaptive dynamic programming is performed in the decision state space of the set of seals associated with each institution to generate a planned sequence of seal addresses. Based on the order of the dividing points, assign corresponding institution indices to the planned seal address sequence of all institutions to form an activated seal set sequence.

2. The method according to claim 1, characterized in that, The method employs a greedy strategy to perform adaptive dynamic programming in the decision state space of the set of seals associated with each institution, generating a planned sequence of seal addresses, including: Using a greedy strategy, the adjacent states are traversed in the decision state space of the local stamp set, the action value function value is calculated, and the state corresponding to the maximum value of the action value function is selected to form a state transition chain composed of a sequence of action selection identifiers. A set of state transition stamps is generated based on the action selection identifier sequence in the state transition chain; The state transition stamp set is converted into the original address space stamp set through the mapping relationship between the local address system and the enabled address system; Based on the original set of address space stamps, a planned sequence of stamp addresses is generated.

3. The method according to claim 2, characterized in that, The method of using a greedy strategy to traverse adjacent states in the decision state space of the local stamp set, calculate the action value function value, and select the state corresponding to the maximum action value function value to form a state transition chain composed of a sequence of action selection identifiers includes: The activation address of the current state in the decision state space of the local stamp set is converted into a local relative address, and a mapping table between the state identifier and the local relative address is generated. Based on the local relative address of the current state in the mapping table, extract eight neighboring address points and filter adjacent states that fall within the local stamp set decision state space to generate a set of adjacent state identifiers. Calculate the absolute deviation value of each element in the adjacent state identifier set and the reciprocal of the nearest permission Euclidean distance, and then sum them in a weighted manner to generate the action value function value; The action value function values ​​are compared, and the state identifier corresponding to the maximum value of the action value function is selected to generate the selected state identifier for the transition between states. Set the selected state identifier as the new current state, repeat the filtering, calculation, and selection operations until the termination point state, and output a state transition chain consisting of the action selection identifier sequence.

4. The method according to claim 1, characterized in that, The construction of the stamp set activation decision state space based on the accessible area markings in the two-dimensional table and the document template includes: The rate of change of approval rules for adjacent grids in the two-dimensional table is calculated to generate a grid diagram of the rate of change of approval rules. From the approval rule change rate grid, candidate grids with approval rule change rates lower than a preset change rate threshold are selected, and connected region detection and area threshold filtering are performed on adjacent candidate grids to generate a set of passable area annotations. Spatial clustering identification is performed on the transaction cluster center addresses of the document template to obtain a transaction cluster set. The transaction cluster center address set is generated by calculating based on the two-dimensional geometric center addresses of each cluster in the transaction cluster set. Based on the set of transaction cluster center addresses, the reciprocal of the Euclidean distance from each grid to the nearest transaction cluster center is calculated and risk analysis is performed to generate a set of risk level identifiers; Associating the grid address of the approval rule change rate grid diagram with the corresponding passage status in the passable area label set and the corresponding risk level in the risk level identifier set, we obtain the decision state space of the activated seal set.

5. The method according to claim 4, characterized in that, The step of associating the grid addresses of the approval rule change rate grid map with the corresponding access status in the accessible area label set and the corresponding risk level in the risk level identifier set to obtain the activated seal set decision state space includes: Based on the accessibility status markers in the accessible area label set and the risk level identifiers in the risk level identifier set, create a set of status attribute structures; Establish a mapping relationship between the grid address of the two-dimensional table and the set of state attribute structures, and construct the decision state space of the enabled stamp set.

6. The method according to claim 5, characterized in that, Based on the set of transaction cluster center addresses, the reciprocal of the Euclidean distance from each grid to the nearest transaction cluster center is calculated and risk analysis is performed to generate a set of risk level identifiers, including: Calculate the minimum Euclidean distance from each grid in the two-dimensional table to the set of nearest transaction cluster center addresses and take its reciprocal to generate a set of risk level coefficients; A set of risk level coefficients is generated by dividing the risk level range into preset intervals.

7. The method according to claim 5, characterized in that, The step of generating the client's rendering design document based on the activated stamp set sequence further includes: Construct at least one low-code data segment, wherein each low-code data segment includes basic attributes, and the basic attributes include at least a primary key value, an attribute name, and an attribute content; The system obtains a business document uploaded by a user, parses the business document into an encrypted component, and renders the encrypted component into an online editing document. Each editing unit of the business document has a unique identifier in the encrypted component. Select the editing unit to be edited as the selected editing unit, and select at least one low code data segment as the selected low code data segment corresponding to the selected editing unit; The selected low-code data segment and the selected editing unit are bound together based on the unique identifier of the selected editing unit and the primary key value of the selected low-code data segment. The attribute content of the selected low-code data segment is inserted into the encrypted component of the corresponding selected editing unit to form an updated component. The unupdated component and the updated component are rendered to form a personalized document.

8. An apparatus for generating design documents in a low-code development environment, used to perform a method for generating design documents in a low-code development environment as described in any one of claims 1-7, characterized in that, include: The acquisition module is used to acquire the approval rule data of the task area collected by the approval node using low-code services, and convert the approval rule data into a two-dimensional table; The matching module is used to scan the rendering environment in real time through the page components mounted on the client, generate a real-time transaction form, and spatially register the real-time transaction form with the two-dimensional table to generate a document template containing dynamic permissions. The construction module is used to construct a decision state space for enabling the stamp set based on the accessible area markings in the two-dimensional table and the document template. The generation module is used to divide the client's set of enabled seals into seals of multiple institutions using a deep Q-network model, and to perform adaptive dynamic programming in the decision state space of the set of enabled seals using a greedy strategy to generate a sequence of enabled seal sets. The document design module generates the client's rendered design document based on the sequence of enabled stamps.

Citation Information

Patent Citations

  • RPA and AI combined low-code development method and device, and computing equipment

    CN113626024A

  • Electronic seal management method, storage medium, electronic equipment and product

    CN120085787A