A building streamline generation method, device, equipment and storage medium
By processing building structure data using the ant colony algorithm, the shortest streamline paths are generated and bundled together, solving the problems of cumbersome streamline generation steps and low accuracy in existing technologies, and achieving efficient and optimal streamline generation.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2022-07-11
- Publication Date
- 2026-03-27
AI Technical Summary
Existing building circulation generation technologies are cumbersome, inefficient, and lack accuracy in circulation prediction, making it difficult for users to determine whether the circulation layout is optimal.
The ant colony algorithm is used to process the building structure data, generate the shortest circulation path set, and then bundle and merge them according to category to generate the final building circulation.
It simplifies the streamline generation process, improves efficiency and accuracy, and provides optimal streamline paths, making it suitable for planning escape and evacuation routes in complex buildings.
Smart Images
Figure CN115203795B_ABST
Abstract
Description
TECHNICAL FIELD
[0001] The present application relates to the field of building flow lines, and in particular to a building flow line generation method, device, equipment and storage medium. BACKGROUND
[0002] The building flow line is a basic concept frequently used in building design, and is commonly known as the dynamic line, which refers to the route of people's activities in the building. According to the behavior of people, a certain space is organized, and the space is divided by flow line design, so as to achieve the purpose of dividing different functional areas.
[0003] The existing building flow line generation technology generally organizes flow lines through the arrangement of the internal space of the building, and then further draws the flow lines through flow line analysis. Such steps are too cumbersome and inefficient, and the final flow lines obtained are not necessarily accurate. Even in the case of existing building flow lines, due to the complex arrangement of flow lines and the mixed types of flow lines, users cannot determine whether the layout of the flow lines is optimal.
[0004] Therefore, the present application is proposed. SUMMARY
[0005] The present application discloses a building flow line generation method, device, equipment and storage medium, which can effectively solve the problems of cumbersome steps, low efficiency and low accuracy of flow line prediction results in the prior art.
[0006] The present application provides a building flow line generation method, comprising:
[0007] Obtaining building structure data and numbering the building structure data to generate an internal structure data set;
[0008] Processing the internal structure data set using an ant colony algorithm to generate a shortest flow line path set, wherein the shortest flow line path set includes a plurality of shortest visiting flow lines from an entrance to a room, a plurality of shortest evacuation flow lines from a room to an entrance, and a plurality of shortest internal traffic flow lines from a room to a room;
[0009] Bundling and merging the flow line paths in the shortest flow line path set according to categories, and continuing the processed flow line paths to generate final building flow lines.
[0010] Preferably, the building structure data is numbered to generate an internal structure data set, specifically:
[0011] The building structure data is processed in layers to generate a plurality of building structure layered data, and each building structure layered data is numbered by layers;
[0012] The rooms and entrances of each building structure hierarchical data are numbered in a first preset direction to generate a plurality of room numbers corresponding to the rooms of the building structure hierarchical data and a plurality of entrance numbers corresponding to the entrances of the building structure hierarchical data.
[0013] The stairs and elevators of each building structure hierarchical data are numbered in a first preset direction to generate a plurality of stair numbers corresponding to the stairs of the building structure hierarchical data and a plurality of elevator numbers corresponding to the elevators of the building structure hierarchical data.
[0014] Preferably, the internal structure data set is processed by using an ant colony algorithm to generate a shortest flow line path set, and specifically:
[0015] The room of the building structure data is set as a first terminal point, and the entrance of the building structure data is set as a first starting point to generate a plurality of visiting flow line paths, wherein the visiting flow line path is a path from the first starting point to the first terminal point.
[0016] The above steps are repeated until a preset number of times, and the visiting flow line path with the highest generation frequency is screened out to generate a shortest visiting flow line from the entrance to the room.
[0017] According to the above steps, the shortest visiting flow lines between all entrances and all rooms of the building structure data are sequentially determined.
[0018] Preferably, the internal structure data set is processed by using an ant colony algorithm to generate a shortest flow line path set, and specifically:
[0019] The entrance of the building structure data is set as a second terminal point, and the room of the building structure data is set as a second starting point to generate a plurality of evacuation flow line paths, wherein the evacuation flow line path is a path from the second starting point to the second terminal point.
[0020] The above steps are repeated until a preset number of times, and the evacuation flow line path with the highest generation frequency is screened out to generate a shortest evacuation flow line from the room to the entrance.
[0021] According to the above steps, the shortest evacuation flow lines between all rooms and all entrances of the building structure data are sequentially determined.
[0022] Preferably, the internal structure data set is processed by using an ant colony algorithm to generate a shortest flow line path set, and specifically:
[0023] One room of the building structure data is set as a third terminal point, and another room of the building structure data is set as a third starting point to generate a plurality of internal passing flow line paths, wherein the internal passing flow line path is a path from the third starting point to the third terminal point.
[0024] Repeat the above steps until the preset number of times is reached, filter out the internal passageway path that is generated the most times, and generate the shortest evacuation flowway from the starting room to the ending room.
[0025] Based on the above steps, the shortest internal circulation routes between all rooms in the building structure data are determined sequentially.
[0026] Preferably, the streamline paths in the shortest streamline path set are bundled and merged according to category, and the processed streamline paths are continued to generate the final building streamline, specifically:
[0027] The streamline paths in the shortest streamline path set are bundled by category, and all streamlines passing through the midpoint of the door are counted based on the midpoint of the door.
[0028] Based on the direction of the streamlines, regions with sparse and dense streamline intersections and regions with dense streamline intersections are generated;
[0029] The streamlines in the convergence density region are classified by category, and the streamlines in the convergence density region are processed according to their type to generate the continuation streamlines in the convergence density region.
[0030] The continuous streamlines are divided and identified to generate the final building streamlines.
[0031] The present invention also provides a building flow line generation device, comprising:
[0032] A data numbering unit is used to acquire building structure data, number the building structure data, and generate an internal structure dataset.
[0033] The shortest flow path acquisition unit is used to process the internal structure dataset using the ant colony algorithm to generate a set of shortest flow path sets, wherein the set of shortest flow path sets includes multiple visit flow paths from entrances and exits to rooms, multiple evacuation flow paths from rooms to entrances and exits, and multiple internal passage flow paths from room to room.
[0034] The final streamline generation unit is used to bundle and merge the streamline paths in the shortest streamline path set according to category, and to continue the processed streamline paths to generate the final building streamline.
[0035] The present invention also provides a building flow line generation device, including a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, wherein the processor executes the computer program to implement a building flow line generation method as described above.
[0036] The application further provides a readable storage medium storing a computer program, which can be executed by a processor of a device where the storage medium is located to implement the building streamline generation method according to any one of the above.
[0037] To sum up, the building streamline generation method, device, equipment and storage medium provided by the embodiment directly analyze the building structure data by using an ant colony algorithm to obtain a plurality of shortest streamline paths of different categories, and classify, bundle and merge the plurality of shortest streamline paths to generate a final building streamline. The building streamline generation method directly analyzes the internal structure of the building to obtain the building streamline, so that the steps of generating the building streamline are simple, efficient and optimal. Thus, the problems of complicated steps, low efficiency and low accuracy of streamline prediction result in the prior art are solved. BRIEF DESCRIPTION OF DRAWINGS
[0038] Figure 1 FIG. 1 is a flowchart of a building streamline generation method provided by the application.
[0039] Figure 2 FIG. 2 is a schematic diagram of a planar streamline of the building streamline generation method provided by the application.
[0040] Figure 3 FIG. 3 is a schematic diagram of a spatial streamline of the building streamline generation method provided by the application.
[0041] Figure 4 FIG. 4 is a schematic diagram of streamline classification and merging of the building streamline generation method provided by the application.
[0042] Figure 5 FIG. 5 is a module schematic diagram of a building streamline generation device provided by the application. DETAILED DESCRIPTION
[0043] To make the objectives, technical solutions and advantages of the embodiments of the application clearer, the technical solutions in the embodiments of the application will be described clearly and completely below with reference to the drawings in the embodiments of the application. Obviously, the described embodiments are some of the embodiments of the application, rather than all the embodiments of the application. Based on the embodiments in the application, all other embodiments obtained by those skilled in the art without creative work fall within the scope of protection of the application. Therefore, the following detailed description of the embodiments of the application provided in the drawings is not intended to limit the scope of the claimed application, but only represents selected embodiments of the application. Based on the embodiments in the application, all other embodiments obtained by those skilled in the art without creative work fall within the scope of protection of the application.
[0044] The application will be described in detail below with reference to the drawings.
[0045] The building streamline generation scheme in the prior art is mostly to first arrange the building internal space and organize the streamline, and then draw the streamline by analyzing the streamline organization. This step is too cumbersome. When the streamline arrangement of the building structure to be speculated is complex and mixed, the method is not only low in efficiency, but also the finally obtained streamline is not necessarily accurate and optimal.
[0046] Referring to Figure 1 The first embodiment of the application provides a building streamline generation method, comprising:
[0047] S101, obtaining building structure data, numbering the building structure data, and generating internal structure data set;
[0048] Specifically, step S101 comprises: layering the building structure data to generate a plurality of building structure layering data, and numbering each building structure layering data;
[0049] The rooms and entrances of each building structure layering data are numbered in a first preset direction to generate a plurality of room numbers corresponding to the rooms of the building structure layering data and a plurality of entrance numbers corresponding to the entrances of the building structure layering data;
[0050] The stairs and elevators of each building structure layering data are numbered in a first preset direction to generate a plurality of stair numbers corresponding to the stairs of the building structure layering data and a plurality of elevator numbers corresponding to the elevators of the building structure layering data.
[0051] Referring to Figures 2-3 Specifically, in the embodiment, first, the obtained building structure data is numbered by building internal layering, i.e., the building structure data is divided into building structure layering data layer by layer, and each layer of building structure layering data is numbered by layer number; second, all the rooms and entrances of each building structure layering data are numbered in a first preset direction, i.e., the room numbers can be 1-1, 1-2, 1-3, 2-1, etc., the entrance numbers can be in1, in2, out1, out2, etc., and the stairs and elevators of the building structure data are numbered in a second preset direction. The first preset direction can be a planar clockwise direction, and the second preset direction can be a vertical direction. It should be noted that in other embodiments, other types of first preset direction and second preset direction can also be used, which are not limited here, but these schemes are within the protection scope of the application.
[0052] S102, adopt the ant colony algorithm to process the internal structure data set, generate the shortest streamline path set, wherein the shortest streamline path set includes multiple shortest visiting streamlines from the entrance to the room, multiple shortest evacuation streamlines from the room to the entrance, and multiple shortest internal traffic streamlines from the room to the room;
[0053] Specifically, step S102 includes setting the room of the building structure data as a first terminal point, setting the entrance of the building structure data as a first starting point, and generating multiple visiting streamline paths, wherein the visiting streamline path is a path from the first starting point to the first terminal point.
[0054] Repeat the above steps until a preset number of times, filter out the visiting streamline path with the most generation times, and generate the shortest visiting streamline from the entrance to the room.
[0055] According to the above steps, the shortest visiting streamline between all entrances and all rooms of the building structure data is determined in turn.
[0056] Specifically, in this embodiment, the ant colony algorithm is also called the ant algorithm, which is a probabilistic algorithm used to find the optimal path in a graph. The inspiration comes from the behavior of ants finding paths during foraging. The ant colony algorithm uses the walking path of ants to represent the feasible solution of the optimization problem, and all paths of the entire ant colony constitute the optimal solution of the optimization problem. The ants that take shorter paths release more pheromone, and as time goes on, the concentration of pheromone accumulated on shorter paths gradually increases, and the number of ants choosing this path also gradually increases. Ultimately, the entire ant colony will concentrate on the best path under the action of positive feedback, and at this time, the corresponding optimal solution of the optimization problem is the shortest streamline path.
[0057] In this embodiment, taking the shortest visiting streamline from entrance 1 to room 1-1 as an example, a plurality of ants are placed at entrance 1 as starting points, and a food source is placed at room 1-1 as a terminal point, wherein the path found by the ants to the food source is the streamline formed. Since the ants that take shorter paths release more pheromone, the above steps are repeated until a preset number of times, and according to the amount of pheromone, the shortest path from entrance 1 to room 1-1, i.e. the shortest visiting streamline, can be finally derived. In short, the process of obtaining the shortest visiting streamline from entrance 1 to room 1-1 is to place a plurality of ants at entrance 1 and a food source at room 1-1 according to the ant colony algorithm, and to obtain the shortest path streamline from entrance 1 to room 1-1 by calculation. Similarly, a plurality of ants are placed at entrance 1 and a food source is placed at room 1-2, and the shortest path streamline from entrance 1 to room 1-2 is obtained by calculation. Repeating this step can obtain the shortest streamline path from each entrance to each room of the building structure data; wherein such streamlines are similar to visiting streamlines.
[0058] Specifically, the step S102 further comprises: setting an entrance of the building structure data as a second end point, setting a room of the building structure data as a second start point, and generating a plurality of evacuation flow line paths, wherein the evacuation flow line path is a path from the second start point to the second end point;
[0059] The above steps are repeated until a preset number of times, and the evacuation flow line path with the most generation times is screened out to generate the shortest evacuation flow line from the room to the entrance;
[0060] According to the above steps, the shortest evacuation flow line between all rooms and all entrances of the building structure data is determined in turn.
[0061] Specifically, in this embodiment, taking obtaining the shortest evacuation flow line from room 1-1 to exit 1 as an example, a plurality of ants are placed in room 1-1 as start points, and a food source is placed at exit 1 as an end point, wherein the path found by the ants to the food source is the flow line formed; since the amount of pheromone released by the ant with a shorter path is more, the above steps are repeated until a preset number of times, and according to the amount of pheromone, the shortest path from room 1-1 to exit 1, i.e. the shortest evacuation flow line, can be finally obtained. In short, the process of obtaining the shortest evacuation flow line from room 1-1 to exit 1 is to place a plurality of ants in room 1-1 according to the ant colony algorithm, place food at exit 1, consider the case of one-way door, i.e. one-way traffic, and cannot go back and forth, and obtain the shortest path flow line from room 1-1 to exit 1 by calculation. By analogy, a plurality of ants are placed in room 1-1, food is placed at exit 2, and the shortest path flow line from room 1-1 to exit 2 is obtained by calculation. Repeating this step can obtain the shortest flow line path from each room to each exit of the building structure data; wherein this flow line is a flow line similar to evacuation.
[0062] Specifically, the step S102 further comprises: setting a room of the building structure data as a third end point, setting another room of the building structure data as a third start point, and generating a plurality of internal traffic flow line paths, wherein the internal traffic flow line path is a path from the third start point to the third end point;
[0063] The above steps are repeated until a preset number of times, and the internal traffic flow line path with the most generation times is screened out to generate the shortest evacuation flow line from the start room to the end room;
[0064] According to the above steps, the shortest internal traffic flow line between all rooms of the building structure data is determined in turn.
[0065] Specifically, in the embodiment, the shortest visiting flow line from room 1-1 to room 1-2 is taken as an example, a plurality of ants are placed in room 1-1 as starting points, and a food source is placed in room 1-2 as an end point, wherein the path of the ants finding the food source is the flow line formed; since the ants releasing more pheromone have shorter paths, the above steps are repeated to a preset number of times, and according to the amount of pheromone, the shortest path from room 1-1 to room 1-2, that is, the shortest internal traffic flow line, can be finally derived. In short, the process of obtaining the shortest internal traffic flow line from room 1-1 to room 1-2 is to place a plurality of ants in room 1-1 according to the ant colony algorithm, place food in room 1-2, and obtain the shortest path flow line from room 1-1 to room 1-2 by calculation. By analogy, a plurality of ants are placed in room 1-1, and food is placed in room 1-3, and the shortest path flow line from room 1-1 to room 1-3 is obtained by calculation. Repeating this step can obtain the shortest flow line path from each room to each room of the building structure data; wherein such flow lines are similar to internal traffic property flow lines.
[0066] S103, the flow line paths in the shortest flow line path set are bundled and merged according to categories, and the processed flow line paths are continued to generate final building flow lines.
[0067] Specifically, step S103 includes: respectively bundling the flow line paths in the shortest flow line path set according to categories, and counting all flow lines passing through the midpoint of the door according to the midpoint of the door.
[0068] The flow lines are distinguished according to directions to generate flow line intersection sparse areas and flow line intersection dense areas;
[0069] The flow lines in the flow line intersection sparse areas are divided according to categories, and the flow lines in the flow line intersection dense areas are processed according to their types to generate continuation flow lines of the flow lines in the flow line intersection dense areas;
[0070] The continuation flow lines are divided and distinguished to generate final building flow lines.
[0071] Please refer to Figure 4 , specifically, in the embodiment, the flow lines in the shortest flow line path set are respectively bundled according to categories, all flow lines passing through the midpoint of the door are counted according to the midpoint of the door, the flow lines are distinguished according to different direction arrows, the preliminary flow line category division is performed in the flow line intersection sparse areas, the continuation flow lines of the dense areas are inferred according to the preliminary determination categories, the whole flow line division and discrimination are completed, and finally the whole flow line is bundled and summarized.
[0072] In summary, the building streamline generation method directly analyzes the internal structure of the building to obtain the building streamline in the case of known building structure data, so that the steps of building streamline generation become simple, efficient and optimal. The building streamline generation method deduces the final building streamline as the optimal building streamline, which can be used as an escape and evacuation software to find the optimal target route in a complex and changing building interior, the best escape path in a crisis such as fire and earthquake, and provide the user with the best action and evacuation route to escape in the shortest optimal route. Moreover, the building streamline generation method can also be used to generate streamlines for buildings or structures with large area and large flow of people, such as hospitals, exhibition halls, stations, and other buildings with complex and variable internal structure arrangement, numerous and complex building streamlines, which are difficult to organize and analyze. In this way, a large amount of manpower and time is not needed to generate streamlines.
[0073] Referring to Figure 5 The second embodiment of the present application provides a building streamline generation device, comprising:
[0074] A data numbering unit 201 is configured to obtain building structure data, number the building structure data, and generate an internal structure data set;
[0075] A shortest streamline acquisition unit 202 is configured to process the internal structure data set by using an ant colony algorithm to generate a shortest streamline path set, wherein the shortest streamline path set comprises a plurality of visiting streamlines from exits and entrances to rooms, a plurality of evacuation streamlines from rooms to exits and entrances, and a plurality of internal passing streamlines from room to room;
[0076] A final streamline generation unit 203 is configured to bundle and merge the streamline paths in the shortest streamline path set according to categories, and extend the processed streamline paths to generate final building streamlines.
[0077] The third embodiment of the present application provides a building streamline generation device, comprising a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, wherein the processor implements the building streamline generation method according to any one of the above embodiments when executing the computer program.
[0078] The fourth embodiment of the present application provides a readable storage medium storing a computer program, wherein the computer program can be executed by a processor of a device where the storage medium is located to implement the building streamline generation method according to any one of the above embodiments.
[0079] Exemplarily, the computer program in the third and fourth embodiments of the present application can be divided into one or more modules stored in the memory and executed by the processor to complete the present application. The one or more modules can be a series of computer program instruction segments capable of completing a specific function, which are used to describe the execution process of the computer program in the implementation of the building streamline generation device. For example, the device in the second embodiment of the present application.
[0080] The processor can be a central processing unit (CPU), and can also be other general-purpose processors, digital signal processors (DSP), application specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor can be a microprocessor or any conventional processor, etc. The processor is the control center of the building streamline generation method, and is connected with all parts of the building streamline generation method through various interfaces and lines.
[0081] The memory can be used to store the computer program and / or modules, and the processor realizes various functions of the building streamline generation method by running or executing the computer program and / or modules stored in the memory, and calling the data stored in the memory. The memory can mainly include a program storage area and a data storage area, wherein the program storage area can store an operating system, at least one application program required for a function (such as a sound playing function, a character conversion function, etc.), etc.; and the data storage area can store data created according to the use of the mobile phone (such as audio data, text message data, etc.), etc. In addition, the memory can include a high-speed random access memory, and can also include a non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a smart media card (SMC), a secure digital (SD) card, a flash card, at least one disk storage device, a flash memory device, or other volatile solid-state storage device.
[0082] The implemented modules, if implemented in the form of software function units and sold or used as independent products, can be stored in a computer readable storage medium. Based on such understanding, all or part of the processes in the above-mentioned embodiment methods can also be completed by a computer program instructing related hardware, and the computer program can be stored in a computer readable storage medium. The computer program can implement the steps of each method embodiment when executed by a processor. The computer program includes computer program code, which can be in the form of source code, object code, executable files or some intermediate forms. The computer readable medium can include any entity or device capable of carrying the computer program code, recording medium, U disk, mobile hard disk, magnetic disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electrical carrier signal, telecommunication signal and software distribution medium, etc. It should be noted that the contents included in the computer readable medium can be appropriately increased or decreased according to the requirements of legislation and patent practice in the jurisdiction, for example, in some jurisdictions, according to legislation and patent practice, the computer readable medium does not include electrical carrier signals and telecommunication signals.
[0083] It should be noted that the above-described device embodiments are only schematic, and the units described as separate components can or can not be physically separated, and the components shown as units can or can not be physical units, that is, they can be located in one place, or distributed on multiple network units. Part or all of the modules can be selected to achieve the purpose of the embodiment scheme according to actual needs. In addition, the connection relationship between the modules in the device embodiment provided by the present application indicates that there is a communication connection between them, which can be realized as one or more communication buses or signal lines. Those skilled in the art can understand and implement it without creative labor.
[0084] The above is only the preferred embodiment of the present application, and the protection scope of the present application is not limited to the above-mentioned embodiments. Any technical solution falling within the idea of the present application belongs to the protection scope of the present application.
Claims
1. A method for generating a building flowline, characterized in that, include: Acquire building structure data, number the building structure data, and generate an internal structure dataset; The internal structure dataset is processed using an ant colony algorithm to generate a set of shortest flow paths, which includes multiple shortest visit flow paths from entrances and exits to rooms, multiple shortest evacuation flow paths from rooms to entrances and exits, and multiple shortest internal passage flow paths from room to room. The streamline paths in the shortest streamline path set are bundled and merged according to category, and the processed streamline paths are continued to generate the final building streamline. The streamline paths in the shortest streamline path set are bundled and merged according to category, and the processed streamline paths are continued to generate the final building streamline, specifically: The streamline paths in the shortest streamline path set are bundled by category, and all streamlines passing through the midpoint of the door are counted based on the midpoint of the door. Based on the direction of the streamlines, regions with sparse and dense streamline intersections and regions with dense streamline intersections are generated; The streamlines in the convergence density region are classified by category, and the streamlines in the convergence density region are processed according to their type to generate the continuation streamlines in the convergence density region. The continuous streamlines are divided and identified to generate the final building streamlines.
2. The building flowline generation method of claim 1, wherein, The building structure data is numbered to generate an internal structure dataset, specifically as follows: The building structure data is processed into layers to generate multiple layers of building structure data, and each layer of building structure data is assigned a layer number. Each room and entrance / exit of the building structure layer data is numbered according to a first preset direction, generating multiple room numbers corresponding to the rooms of the building structure layer data and multiple entrance / exit numbers corresponding to the entrances / exits of the building structure layer data. The stairs and elevators in each of the building structure layer data are numbered according to a first preset direction, generating multiple stair numbers corresponding to the stairs in the building structure layer data and multiple elevator numbers corresponding to the elevators in the building structure layer data.
3. The building streamline generation method of claim 1, wherein, The internal structure dataset is processed using an ant colony algorithm to generate a set of shortest streamline paths, specifically: The room in the building structure data is set as the first endpoint, and the entrance / exit of the building structure data is set as the first starting point. Multiple visitor flow paths are generated, wherein the visitor flow path is the path from the first starting point to the first endpoint. Repeat the above steps until the preset number of times is reached, filter out the visitor flow path that is generated the most times, and generate the shortest visitor flow path from the entrance / exit to the room. Based on the above steps, the shortest visitor flow between all entrances and exits and all rooms of the building structure data is determined in sequence.
4. The building streamline generation method of claim 1, wherein, The internal structure dataset is processed using an ant colony algorithm to generate a set of shortest streamline paths, specifically as follows: The entrance and exit of the building structure data are set as the second endpoint, and the rooms of the building structure data are set as the second starting point, generating multiple evacuation flow paths, wherein the evacuation flow path is a path from the second starting point to the second endpoint; Repeat the above steps until a preset number of values, screening out the most generated number of evacuation flow line path, generate the room to the entrance of the shortest evacuation flow line; According to the above steps, the shortest evacuation flow line between all the rooms and all the entrances of the building structure data is determined in turn.
5. The building streamline generation method of claim 1, wherein, The internal structure data set is processed by using an ant colony algorithm to generate a shortest flow line path set, and the internal structure data set is further specifically: A room of the building structure data is set as a third terminal, and another room of the building structure data is set as a third starting point, and a plurality of internal traffic flow line paths are generated, wherein the internal traffic flow line path is a path from the third starting point to the third terminal; Repeat the above steps until a preset number of values, screening out the most generated number of evacuation flow line path, generate the room to the entrance of the shortest evacuation flow line; According to the above steps, the shortest evacuation flow line between all the rooms and all the entrances of the building structure data is determined in turn.
6. An architectural streamer generating device, characterized by, Comprise: Data numbering unit, for obtaining building structure data, and numbering the building structure data, generating internal structure data set; Shortest flow line acquisition unit, for processing the internal structure data set by using an ant colony algorithm to generate a shortest flow line path set, wherein the shortest flow line path set comprises a plurality of entrance-to-room visit flow lines, a plurality of room-to-entrance evacuation flow lines, and a plurality of room-to-room internal traffic flow lines; Final flow line generation unit, for bundling and merging the flow line paths in the shortest flow line path set according to categories, and extending the processed flow line paths to generate final building flow lines; The flow line paths in the shortest flow line path set are bundled and merged according to categories, and the processed flow line paths are extended to generate final building flow lines, and specifically: The flow line paths in the shortest flow line path set are bundled and merged according to categories, and the processed flow line paths are extended to generate final building flow lines, and specifically: The flow line paths in the shortest flow line path set are bundled and merged according to categories, and the processed flow line paths are extended to generate final building flow lines, and specifically: The flow lines in the flow line intersection sparse area are divided according to categories, and the flow lines in the flow line intersection dense area are processed according to their types to generate the continuation flow lines of the flow lines in the flow line intersection dense area; The continuation flow lines are divided and distinguished to generate final building flow lines.
7. An architectural flowline generating device characterized by, Comprise a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, wherein the processor executes the computer program to implement the building flow line generation method of any one of claims 1 to 5.
8. A readable storage medium, characterized by, The computer program can be executed by the processor of the device where the storage medium is located to implement the building flow line generation method of any one of claims 1 to 5.