Assembly method of modular integrated building
By dividing the building drawings into peripheral and embedded areas, and using automatic skidding trucks and algorithms to optimize the sequence, the problem of precise assembly of modular integrated buildings during lifting and assembly is solved, and construction efficiency and safety are improved.
Patent Information
- Application Number
- CN202411042115.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-31
- Publication Date
- 2024-11-22
- Estimated Expiration
- 2044-07-31
AI Technical Summary
During the hoisting and assembly process of existing modular integrated buildings, internal modules such as consultation rooms and bathrooms are difficult to accurately assemble to the predetermined location, which affects the construction progress and building safety.
By dividing the building map into peripheral areas and embedded areas, the peripheral module is hoisted and assembled and the embedded module is accurately positioned using the automatic sliding car, and combining cloning algorithms and particle swarm algorithms to optimize the assembly sequence, the sliding assembly of the embedded module is realized.
Effectively avoid module shaking, ensure accurate assembly of embedded modules, improve construction progress and enhance building safety.
Smart Images

Figure CN118997500A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of intelligent construction technology, and in particular to an assembly method for a modular integrated building. Background Art
[0002] With the in-depth development of a new round of scientific and technological revolution and industrial transformation, the traditional construction methods in the construction industry have been greatly impacted, and there is an urgent need to vigorously develop the intelligent construction industry to lead and drive the transformation and upgrading of the construction industry. In this context, taking the new type of building industrialization as a path, vigorously develop the core technology of the prefabricated building 4.0 era - MiC (Modular Integrated Construction), injecting new impetus into the high-quality development of the construction industry.
[0003] MiC modular integrated building system divides the building into modular units during the design phase, and efficiently completes all construction processes such as module structure, decoration, water and electricity, equipment pipelines, and sanitary facilities in the factory. The modules are quickly assembled into the entire building on site through reliable connection technology, realizing "building a house like building a car". It is a green construction method with a relatively high degree of building industrialization.
[0004] However, modular integrated buildings in the prior art are all assembled by hoisting, but some MIC modules located inside the building, such as consultation rooms, toilets, changing rooms, etc., will shake during hoisting, making it difficult to accurately assemble them to the predetermined installation position, which not only affects the construction progress but also affects the safety of the building. Summary of the invention
[0005] The embodiment of the present application provides an assembly method of a modular integrated building to solve the above-mentioned technical problems.
[0006] To achieve the above technical objectives, an embodiment of the present application provides an assembly method of a modular integrated building, comprising:
[0007] Dividing the building drawing into assembly units, dividing the building drawing into peripheral modules located in the peripheral area and embedded modules located in the embedded area;
[0008] Complete the assembly of various equipment inside the peripheral modules and the internal equipment inside the embedded modules in the factory according to the building drawings, and transport the peripheral modules and the embedded modules to the predetermined locations on the construction site according to the preset transportation routes;
[0009] Assemble the peripheral modules in the peripheral area of the building by hoisting assembly method;
[0010] According to the preset assembly sequence, the embedded modules are slid and positioned to the embedded area in sequence by the automatic sliding vehicle, and the assembly progress status is updated and displayed in real time;
[0011] The embedded modules are fixedly connected with the peripheral modules to form a complete building.
[0012] Furthermore, the assembly unit division of the building drawing into peripheral modules located in the peripheral area and embedded modules located in the embedded area includes:
[0013] The optimal assembly unit division scheme is obtained by the cloning algorithm, and the building drawing is divided into assembly units according to the optimal assembly unit division scheme, so as to divide the building drawing into peripheral modules located in the peripheral area and embedded modules located in the embedded area.
[0014] Furthermore, the assembly unit division of the building drawing into peripheral modules located in the peripheral area and embedded modules located in the embedded area includes:
[0015] Step 21, determining the initial population size of the assembly unit division scheme;
[0016] Step 22, generating an initial population by random method, and defining a memory set, wherein the memory set size threshold is smaller than the initial population size;
[0017] Step 23, at the kth generation, the current assembly unit partitioning scheme is evaluated, and the antigen affinity, antibody affinity and antibody reproduction rate of each scheme in the current assembly unit partitioning scheme population are calculated;
[0018] Step 24, if the current assembly unit division scheme population contains the best assembly unit division scheme, or the maximum number of iterations is reached, the best assembly unit division scheme is output and the process is exited; otherwise, a memory operation is performed and the process proceeds to the next step;
[0019] Step 25, selecting a predetermined number of high antigen affinity assembly unit partitioning schemes from the current assembly unit partitioning scheme population and adding them to the memory set, and when the number of assembly unit partitioning schemes in the memory set exceeds the memory set size threshold, using an exclusion algorithm to delete redundant schemes to obtain a high antigen affinity scheme group;
[0020] Step 26, cloning the current assembly unit division scheme population according to the antibody reproduction rate to generate a clone population;
[0021] Step 27, performing crossover and mutation operations on the clone population according to the crossover probability and the mutation probability, respectively, to obtain a new population;
[0022] Step 28, using the high antigen affinity solution group in the memory set in step 25 to replace the low antigen affinity solution in the new population, generating a new assembly unit partitioning solution population, and jumping to step 22.
[0023] Furthermore, the determining of the initial population size of the assembly unit division scheme includes:
[0024] The assembly unit division scheme is represented by two-dimensional coding, as shown in the following formula:
[0025]
[0026] In the above formula, n is the number of modules involved in the division, and m is the maximum number of clusters; each row of the matrix represents an assembly unit, and the value of each cell indicates whether the module corresponding to the cell belongs to its corresponding assembly unit; a binary cluster coding matrix corresponds to an antibody, and the initial population is set randomly. For each column vector of the matrix, any element is set to 1, and the other elements of the column vector are set to 0 to form an initial antibody; repeat this process until the pre-set population size is reached.
[0027] Furthermore, according to the preset assembly sequence, the embedded modules are sequentially slid and positioned to the embedded area by an automatic sliding vehicle, and the assembly progress status is updated and displayed in real time, wherein the preset assembly algorithm includes the following steps:
[0028] Extract the assembly relationship matrix according to the building drawing and initialize the directed graph, establish a hierarchical building structure, plan the path for the embedded areas in the building, and fill the embedded areas layer by layer based on the path;
[0029] According to the relationship between embedded regions at different levels, priority constraints between embedded modules are supplemented to generate a high-level directed graph, i.e., a relatively complete directed graph;
[0030] The particle swarm algorithm is used to perform a heuristic search on the topological sorting of high-level directed graphs to obtain the optimal assembly sequence.
[0031] Furthermore, according to the preset assembly sequence, the embedded modules are sequentially slid and positioned to the embedded area by an automatic sliding vehicle, and the assembly progress status is updated and displayed in real time, wherein:
[0032] A reader and four antennas are set on the automatic sliding vehicle, and tags are set in the embedded area, which are positioned in the embedded area through sliding ranging.
[0033] Furthermore, the reader and four antennas are arranged on the automatic sliding vehicle, a tag is arranged in the embedded area, and the tag is positioned in the embedded area by sliding ranging, including:
[0034] Control the reader in turn to transmit RFID signals with frequencies f1 and f2 through the four connected antennas;
[0035] The reader reads the carrier phases θ1 and θ2 and the incident angle α of the tag reflection signal at frequencies f1 and f2 in real time;
[0036] When the reader antenna transmits two RFID signals with different frequencies to the tag, and receives two different phase values after the same transmission distance, the distance d between the reader and the target tag is calculated. i (i=1, 2, 3, 4);
[0037] Construct a ranging triangle to calculate the distance between the tag and the reader;
[0038] Calculate the final distance measurement result value D, and perform navigation and positioning based on the distance measurement result value.
[0039] Furthermore, according to the preset assembly sequence, the embedded modules are sequentially slid and positioned to the embedded area by an automatic sliding vehicle, and the assembly progress status is updated and displayed in real time, wherein the assembly progress status is updated and displayed in real time, specifically:
[0040] When the distance between the tag in the embedded area and the reader is zero, the assembly progress status is updated in real time to display that the assembly of the current embedded area is completed.
[0041] As can be seen from the above, the implementation of the present application divides the building into a peripheral area and an embedded area, and assembles the peripheral modules in the peripheral area through a hoisting assembly method, and assembles the embedded modules in the embedded area through a sliding assembly method. Therefore, the shaking of the modules caused by assembling the MIC modules located inside the building through the hoisting method is effectively avoided, and the embedded modules can be accurately assembled to the predetermined installation position through the sliding assembly method, which not only effectively improves the construction progress but also ensures the safety of the building. BRIEF DESCRIPTION OF THE DRAWINGS
[0042] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.
[0043] Figure 1 It is a flow chart of an assembly method of a modular integrated building provided in an embodiment of the present application. DETAILED DESCRIPTION
[0044] In the following description, specific details such as specific system structures, technologies, etc. are provided for the purpose of illustration rather than limitation, so as to provide a thorough understanding of the embodiments of the present application. However, it should be clear to those skilled in the art that the present application may also be implemented in other embodiments without these specific details. In other cases, detailed descriptions of well-known systems, devices, circuits, and methods are omitted to prevent unnecessary details from obstructing the description of the present application.
[0045] It should be understood that when used in this specification and the appended claims, the term "comprising" indicates the presence of described features, integers, steps, operations, elements and / or components, but does not exclude the presence or addition of one or more other features, integers, steps, operations, elements, components and / or groups thereof.
[0046] It should also be understood that the terms used in this application specification are only for the purpose of describing specific embodiments and are not intended to limit the application. As used in this application specification and the appended claims, unless the context clearly indicates otherwise, the singular forms "a", "an" and "the" are intended to include plural forms.
[0047] It should be further understood that the term “and / or” used in the specification and appended claims refers to any combination and all possible combinations of one or more of the associated listed items, and includes these combinations.
[0048] In addition, it should be specially noted that the size of the serial number of each step in this embodiment does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiment of this application.
[0049] In order to illustrate the technical solution described in this application, a specific embodiment is provided below for illustration.
[0050] See also Figure 1 , Figure 1 FIG. 1 is a flow chart of a modular integrated building assembly method provided in an embodiment of the present application. Figure 1 As shown, a method for assembling a modular integrated building comprises the following steps:
[0051] Step 1: Design architectural drawings based on the Design for Manufacture and Assembly (DfMA) method.
[0052] Step 2, dividing the building drawing into assembly units, dividing the building drawing into peripheral modules located in the peripheral area and embedded modules located in the embedded area;
[0053] Step 3: Complete the assembly of various devices inside the peripheral modules and the internal equipment inside the embedded modules in the factory according to the building drawings, and transport the peripheral modules and the embedded modules to the predetermined locations on the construction site according to the preset transportation routes;
[0054] Step 4, assembling the peripheral modules in the peripheral area of the building by a hoisting assembly method;
[0055] Step 5: According to the preset assembly sequence, the embedded modules are sequentially slid and positioned to the embedded area by the automatic sliding vehicle, and the assembly progress status is updated and displayed in real time;
[0056] Step 6: Fix the embedded modules and the peripheral modules together to form a complete building.
[0057] Among them, since the entire building is integrated through modularization and then assembled into a whole building, it is necessary to consider the process and sequence of assembling modules, the sub-modules included in each module, etc. This is the original intention of the assembly unit division;
[0058] At the same time, since two methods are used to assemble the building, namely, the outer area of the building is assembled by hoisting, and the inner area is assembled by sliding, the outer area and the inner area must be divided, and the divided area is only one area, and this area must carry the physical building, that is, the outer area carries the outer modules, and the inner area carries the inner modules;
[0059] Based on this, the architectural drawing can be divided into multiple assembly units, the peripheral modules of the architectural drawing can be divided into one assembly unit or multiple assembly units, and the embedded modules of the architectural drawing can be divided into one assembly unit or multiple assembly units;
[0060] The peripheral area carries peripheral modules, which refer to the outer walls of the building and the parts that can be integrated with the outer walls. Correspondingly, the embedded area is an area located inside the peripheral area and carries embedded modules (for example, meeting rooms, restrooms, etc.).
[0061] Obviously, the implementation of the present application divides the building into a peripheral area and an embedded area, and assembles the peripheral modules in the peripheral area through a hoisting assembly method, and assembles the embedded modules in the embedded area through a sliding assembly method. Therefore, the shaking of the modules caused by assembling the MIC modules located inside the building through the hoisting method is effectively avoided, and the embedded modules can be accurately assembled to the predetermined installation position through the sliding assembly method, which not only effectively improves the construction progress but also ensures the safety of the building.
[0062] In the embodiment of the present application, step 2, performing assembly unit division on the building drawing, dividing the building drawing into peripheral modules located in the peripheral area and embedded modules located in the embedded area, comprises the following steps: step 21, determining the initial population size, crossover probability, mutation probability, termination condition, encoding method, etc. of the assembly unit division scheme;
[0063] Step 22, using a random method to generate an initial population, and defining a memory set, wherein the memory set size threshold is smaller than the initial population size;
[0064] Step 23, at the kth generation, where k is greater than 3, the current assembly unit partitioning scheme is evaluated, and the antigen affinity, antibody affinity and antibody reproduction rate of each scheme in the current assembly unit partitioning scheme population are calculated;
[0065] Among them, antigen affinity indicates the degree of recognition of the antibody to the antigen, reflecting the quality of the assembly unit division scheme described by the antibody. i The antigen affinity can be expressed as:
[0066]
[0067] In the above formula, F i For plan a i The objective function value of min is the minimum value of the objective function in the population of partitioning schemes, F max is the maximum value of the objective function in the population of partitioning schemes;
[0068] Antibody affinity refers to the similarity between antibodies. Since the antibody population is encoded in binary, the Hamming distance between antibodies is used to calculate the affinity between antibodies. p and a q , the corresponding cluster coding matrix can be expressed as as well as
[0069] The number of assembly units corresponding to each partitioning scheme is not necessarily equal, that is, m p With m q The values of are not necessarily equal. In order to facilitate the calculation of the Hamming distance between solutions, without loss of generality, when m p >m q When increasing the matrix C q The number of rows is m p , the added matrix element values are all 0, so it is transformed into the following formula:
[0070]
[0071] The Hamming distance between antibodies p and q can be expressed as follows:
[0072]
[0073] Considering that when two partitioning schemes are exactly the same, the Hamming distance between them is 0, the antibody affinity between the schemes can be expressed as:
[0074]
[0075] It can be seen that aff pq∈(0,1],aff pq The larger the value of, the higher the similarity between the two solutions. pq When it is 1, it means that the two solutions are exactly the same;
[0076] In addition, the partitioning scheme a i The antibody reproduction rate can be expressed as:
[0077]
[0078] In the above formula, AC i For the partition scheme a i The antibody concentration;
[0079] Step 24, if the current assembly unit division scheme population contains the best assembly unit division scheme, or the maximum number of iterations is reached, the best assembly unit division scheme is output and the process is exited; otherwise, a memory operation is performed and the process proceeds to the next step;
[0080] Step 25, select a predetermined number of high antigen affinity assembly unit partitioning schemes from the assembly unit partitioning scheme population and add them to the memory set. When the number of assembly unit partitioning schemes in the memory set exceeds the memory set size threshold, use an exclusion algorithm to delete redundant schemes; the exclusion algorithm can use an existing exclusion algorithm.
[0081] Step 26, cloning the current assembly unit division scheme population according to the antibody reproduction rate to generate a clone population;
[0082] Step 27, performing crossover and mutation operations on the clone population according to the crossover probability and mutation probability, respectively, to obtain a new population;
[0083] Step 28, use the high antigen affinity scheme in the memory set of step 25 to replace the low antigen affinity scheme in the new population, generate a new partitioning scheme population, and jump to step 22.
[0084] Obviously, the embodiment of the present application can obtain the best assembly unit division scheme through the cloning algorithm, thereby making the division of the peripheral area and the embedded area of the building more reasonable, facilitating efficient and reliable assembly.
[0085] Among them, the assembly unit division scheme can be represented by using a two-dimensional coding method, for example, it can be represented by the following formula:
[0086]
[0087] In the above formula, n is the number of modules involved in the division, and m is the maximum number of clusters; each row of the matrix represents an assembly unit (cluster), and the value of each cell indicates whether the module corresponding to the cell belongs to its corresponding assembly unit; a binary cluster coding matrix corresponds to an antibody, and the initial population is set randomly. For each column vector of the matrix, any element is set to 1, and the other elements of the column vector are set to 0 to form an initial antibody; repeat this process until the pre-set population size is reached.
[0088] Obviously, by using two-dimensional coding to represent the assembly unit division scheme, the algorithm process can be simplified, and the optimal assembly unit division scheme can be quickly calculated.
[0089] In the embodiment of the present application, step 5, according to the preset assembly sequence, the embedded modules are sequentially slid and positioned to the embedded area by the automatic sliding vehicle, and the assembly progress status is updated and displayed in real time, wherein the preset assembly algorithm may include the following steps:
[0090] Extract the assembly relationship matrix according to the building drawing and initialize the directed graph, establish a hierarchical building structure, plan the path for the embedded areas in the building, and fill the embedded areas layer by layer based on the path;
[0091] According to the relationship between embedded regions at different levels, priority constraints between embedded modules are supplemented to generate a high-level directed graph, i.e., a relatively complete directed graph;
[0092] The particle swarm algorithm is used to perform a heuristic search on the topological sorting of high-level directed graphs to obtain the optimal assembly sequence.
[0093] Obviously, since the sequences generated by the directed graph topological sorting are of high quality, the heuristic search of these sequences using the particle swarm algorithm reduces the search space compared to the traditional method, and therefore, a better assembly sequence can be found more quickly.
[0094] The embedded modules are sequentially slid and positioned to the embedded area by an automatic sliding vehicle. A reader and four antennas may be arranged on the automatic sliding vehicle, a tag is arranged in the embedded area, and the embedded area is positioned by sliding ranging, which specifically includes:
[0095] Control the reader in turn to transmit RFID signals with frequencies f1 and f2 through the four connected antennas;
[0096] The reader reads the carrier phases θ1 and θ2 and the incident angle α of the tag reflection signal at frequencies f1 and f2 in real time;
[0097] When the reader antenna transmits two RFID signals with different frequencies to the tag, and receives two different phase values after the same transmission distance, the distance d between the reader and the target tag is calculated.i (i=1, 2, 3, 4);
[0098] Construct a ranging triangle and calculate the distance D between the tag and the reader using the first preset formula i (i=1, 2, 3, 4);
[0099] The final distance measurement result value D is calculated by the second preset formula, and navigation positioning is performed according to the distance measurement result value.
[0100] The first preset formula can be expressed as follows:
[0101]
[0102] In the above formula, d0 is the distance between the antenna and the reader.
[0103] The second preset formula can be expressed as follows:
[0104]
[0105] Among them, the assembly progress status is updated and displayed in real time, which can be:
[0106] When the distance between the tag in the embedded area and the reader is zero, the assembly progress status is updated in real time to show that the current embedded area is assembled. For example, the red mark when not assembled can be updated to a green mark to indicate that the current embedded area is assembled.
[0107] Obviously, by unifying the update of RFID tags with the events in the assembly execution process, the assembly execution status can be reflected through the status of the RFID tags, making it easier to grasp the assembly progress in real time.
[0108] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described or recorded in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.
[0109] Those of ordinary skill in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.
[0110] In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.
[0111] The present application implements all or part of the processes in the above-mentioned embodiment method, and may also be implemented through a computer program product. When the computer program product runs on a terminal, the terminal can implement the steps in the above-mentioned method embodiments when executing the computer program product.
[0112] The embodiments described above are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, a person skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. Such modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present application, and should all be included in the protection scope of the present application.
Claims
1. A method for assembling a modular integrated building. It is characterized in that include: Dividing the building drawing into assembly units, dividing the building drawing into peripheral modules located in the peripheral area and embedded modules located in the embedded area; Complete the assembly of the various devices inside the peripheral modules and the various devices inside the embedded modules in the factory according to the building drawings, and transport the peripheral modules and the embedded modules to predetermined locations on the construction site according to a preset transportation route; Assembling the peripheral modules to the peripheral area by a hoisting assembly method; According to a preset assembly sequence, the embedded modules are sequentially slid and positioned to the embedded area by an automatic sliding vehicle, and the assembly progress status is updated and displayed in real time; The embedded module is fixedly connected to the peripheral module to form a complete building.
2. The method according to claim 1, It is characterized in that The step of dividing the architectural drawing into assembly units, dividing the architectural drawing into peripheral modules located in a peripheral area and embedded modules located in an embedded area, includes: An optimal assembly unit division scheme is obtained through a cloning algorithm, and assembly unit division is performed on the building drawing according to the optimal assembly unit division scheme, so as to divide the building drawing into the peripheral modules located in the peripheral area and the embedded modules located in the embedded area.
3. The method according to claim 2, It is characterized in that The method of obtaining the optimal assembly unit partitioning scheme by using the cloning algorithm includes: Step 21, determining the initial population size of the assembly unit division scheme; Step 22, generating an initial population by random method, and defining a memory set, wherein the memory set size threshold is smaller than the initial population size; Step 23, at the kth generation, the current assembly unit partitioning scheme is evaluated, and the antigen affinity, antibody affinity and antibody reproduction rate of each scheme in the current assembly unit partitioning scheme population are calculated; Step 24, if the current assembly unit division scheme population contains the best assembly unit division scheme, or the maximum number of iterations is reached, the best assembly unit division scheme is output and the process is exited; otherwise, a memory operation is performed and the process proceeds to the next step; Step 25, selecting a predetermined number of high antigen affinity assembly unit partitioning schemes from the current assembly unit partitioning scheme population and adding them to the memory set, and when the number of assembly unit partitioning schemes in the memory set exceeds the memory set size threshold, using an exclusion algorithm to delete redundant schemes; Step 26, cloning the current assembly unit division scheme population according to the antibody reproduction rate to generate a clone population; Step 27, performing crossover and mutation operations on the clone population according to the crossover probability and the mutation probability, respectively, to obtain a new population; Step 28, using the high antigen affinity solution group in the memory set in step 25 to replace the low antigen affinity solution in the new population, generating a new assembly unit partitioning solution population, and jumping to step 22.
4. The method according to claim 3, It is characterized in that The step of determining the initial population size of the assembly unit division scheme includes: The assembly unit division scheme is represented by a two-dimensional coding method, as shown in the following formula: In the above formula, n is the number of modules involved in the division, and m is the maximum number of clusters; each row of the matrix represents an assembly unit, and the value of each cell indicates whether the module corresponding to the cell belongs to its corresponding assembly unit; a binary cluster coding matrix corresponds to an antibody, and the initial population is set randomly. For each column vector of the matrix, any element is set to 1, and the other elements of the column vector are set to 0 to form an initial antibody; repeat this process until the preset initial population size is reached.
5. The method according to claim 1, It is characterized in that According to the preset assembly sequence, the embedded modules are sequentially slid and positioned to the embedded area by an automatic sliding vehicle, and the assembly progress status is updated and displayed in real time, which also includes obtaining the optimal preset assembly sequence according to the preset assembly algorithm, specifically: Extracting an assembly relationship matrix according to the building drawing and initializing a directed graph, establishing a hierarchical building structure, and performing path planning on the embedded area, so as to fill the embedded area layer by layer in combination with the path; Supplementing the priority constraints between the embedded modules according to the relationships between the embedded regions at different levels, thereby generating a high-level directed graph; The particle swarm algorithm is used to perform a heuristic search on the topological sorting of the high-level directed graph to obtain an optimal preset assembly sequence.
6. The method according to claim 1, It is characterized in that According to the preset assembly sequence, the embedded modules are sequentially slid and positioned to the embedded area by an automatic sliding vehicle, and the assembly progress status is updated and displayed in real time, including: A reader and four antennas are arranged on the automatic sliding vehicle, a tag is arranged in the embedded area, and the embedded module is positioned to the embedded area through sliding ranging.
7. The method according to claim 6, It is characterized in that The method comprises: arranging a reader and four antennas on the automatic sliding vehicle, arranging a tag in the embedded area, and positioning the embedded module to the embedded area through sliding ranging, including: The reader is controlled in turn to transmit the frequency f through the four connected antennas 1 and f 2 RFID signal; The reader reads the frequency in real time at f 1 and f 2 The carrier phase of the tag's reflected signal is θ 1 and θ 2 and the angle of incidence α; When the reader controls the antenna to transmit two RFID signals with different frequencies to the tag, and receives two different phase values after the same transmission distance, the first distance d between the reader and the tag is calculated. i (i=1, 2, 3, 4); Constructing a distance-measuring triangle, and calculating a second distance between the tag and the reader according to the first distance; A final distance measurement result value D is calculated according to the second distance, and navigation positioning is performed according to the distance measurement result value D.
8. The method according to claim 6, It is characterized in that According to the preset assembly sequence, the embedded modules are sequentially slid and positioned to the embedded area by an automatic sliding vehicle, and the assembly progress status is updated and displayed in real time, wherein the assembly progress status is updated and displayed in real time, specifically: When the distance between the tag and the reader is zero, the assembly progress status is updated in real time to display that the assembly of the current embedded area is completed.
Citation Information
Patent Citations
Method for grading land resource evaluation factors based on clonal selection algorithm
CN102663562A
Prefabricated building intelligent hoisting system and method
CN107010542A
Cylinder modular building embedded construction structure and construction method
CN108457376A
Nested module, nested modular building structure and construction method
CN108894330A
Intelligent working condition sorting method based on shortest time path planning
CN116451495A
