A garden intelligent operation and maintenance method and system

CN121615926BActive Publication Date: 2026-09-15GUANGDONG SHENZHOU ZHIHUI ENVIRONMENTAL TECH CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202511731090.6
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2025-11-24
Publication Date
2026-09-15
Estimated Expiration
2045-11-24

AI Technical Summary

Technical Problem

[0003]针对上述缺陷,本发明的目的在于提出一种园林智能运维方法及系统,解决,园林初期植被空间布局设计效率低的问题

Benefits of technology

[0012] One of the above technical solutions has the following advantages or beneficial effects: by quickly generating and comparing multiple high-quality alternative solutions, the efficiency of early design decision-making and the scientific nature of the solutions are greatly improved. At the same time, the efficient use of land resources is ensured through quantitative indicators. Moreover, other designers can redesign the planting shape according to their own needs while retaining the original area size, making it more aesthetically pleasing. This not only greatly accelerates the generation of layout plans in the early stage of garden operation and maintenance, but also reduces the workload of garden design.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN121615926B_ABST
    Figure CN121615926B_ABST
Patent Text Reader

Abstract

The present application relates to the technical field of garden operation and maintenance, in particular to a garden intelligent operation and maintenance method and system. The method comprises the following steps: obtaining a plan map of the garden and planting areas of different vegetation; dividing the area based on the plan map, and attaching a first planting label to each planting area; attaching a second planting label and an adaptive label to different vegetation; generating a random Manhattan polygon based on the vegetation area, obtaining a plurality of vegetation areas, and constructing a first collection for storing the vegetation areas; and generating and comparing a plurality of high-quality alternative schemes quickly, thereby greatly improving the design decision efficiency and the scientificity of the scheme in the early stage, and ensuring efficient use of land resources through quantitative indicators.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of garden operation and maintenance technology, and in particular to a garden intelligent operation and maintenance method and system. Background Technology

[0002] Landscape operation and maintenance is a comprehensive task encompassing multiple key aspects, such as the initial spatial layout of vegetation, the three-dimensional design of vegetation, and subsequent daily maintenance and management. In the initial vegetation arrangement phase, designers typically need to rely on their experience, combined with the biological characteristics, ornamental functions, and required quantities of different plants, to plan and configure the location, density, and combination of various plants. This design method, reliant on human experience, not only demands a high level of professional competence from designers but also, when faced with complex sites or diverse vegetation, is prone to oversights and frequent adjustments, resulting in low overall planning efficiency and difficulty in effectively handling large-scale or demanding landscape construction projects. Summary of the Invention

[0003] To address the aforementioned shortcomings, the present invention aims to propose an intelligent operation and maintenance method and system for gardens, thereby solving the problem of low efficiency in the initial design of vegetation space layout in gardens.

[0004] To achieve this objective, the present invention adopts the following technical solution: a method for intelligent operation and maintenance of gardens, comprising the following steps: Step S1: Obtain a plan view of the garden and the planting area of ​​different vegetation; Step S2: Divide the area based on the planar map and attach a first planting label to each planting area; Step S3: Attach a second planting tag and an adaptation tag to different vegetation types; Step S4: Generate random Manhattan polygons based on vegetation area to obtain multiple planting areas, and construct a first set for storing planting areas; Step S5: Sequentially obtain the planting areas in the first set, calculate the parameter value of the planting area within the planting area, and determine whether to place it in the planting area based on the parameter value. If it can be placed, place the planting area in the planting area and update the area of ​​the placed planting area based on the planting area. If it cannot be placed, determine whether the planting area is the last one. If it is the last one, proceed to step S7. If it is not the last one, proceed to step S6. Step S6: Replace the next planting area in the first set and repeat step S5; Step S7: Obtain the space utilization rate of each planting area, calculate the first utilization rate, and proceed to step S8; Step S8: Determine whether the number of re-executions of step S4 has reached the threshold. If the threshold has not been reached, re-execute step S4. If the threshold has been reached, obtain multiple first utilization rates and output the scheme with the highest first utilization rate as the layout scheme of the garden.

[0005] Preferably, the adaptation tag in step S3 is constructed from adaptation characters and category characters; When placing planting areas, the following rules must be followed: When the first planting label and the second planting label are the same, the planting area is allowed to be placed in the planting area; When the matching characters are the same in different planting areas, different planting areas cannot be considered as adjacent areas.

[0006] Preferably, the rules for placing the planting area within the planting area are as follows: By making each vertex of the planting area contact the available vertices of the planting area, such that at least one edge of the planting area is adjacent to the boundary of the planting area, one or more candidate arrangement positions are generated. In the candidate arrangement positions, the edge in the planting area that is adjacent to the boundary of the planting area is defined as the first edge, and the edge in the planting area that is adjacent to the planting area is defined as the second edge.

[0007] Preferably, the steps for obtaining parameter values ​​are as follows: In response to determining that any vertex of the planting area is outside the boundary of the planting area, the parameter value of the current layout position is set to an invalid value; In response to determining that the planting area is completely within the boundary of the planting area, the parameter value of the current layout position is calculated based on the spatial relationship between the first edge and the second edge; From all candidate layout positions, the candidate layout position with the highest parameter value is selected as the placement position of the planting area; The parameter values ​​are: ,in , Let W and H be the width and height of the first edge at the i-th position in the planting area, respectively, and let W and H be the length and height of the second edge.

[0008] Preferably, the steps for updating the area of ​​the planted area based on the planting region are as follows: The vertices that overlap with the planting area are discarded, and the other vertices in the planting area are extreme points. Delete discarded vertices, and update the planting area by connecting the remaining vertices of the planting area with the extreme points.

[0009] Preferably, the following steps are also included: Step S9: Obtain the remaining area of ​​each planting area in the layout scheme as the remaining area, and obtain the adjacent vegetation types in the remaining area and mark them as the first type; The planting type with the largest remaining area in the first category is used to fill the remaining area.

[0010] Preferably, the following steps are also included: Step S101: Obtain the terrain plan, select the first area that needs to be modified from the planting area based on the terrain plan, and calculate the first area to be increased in the first area; Step S102: Obtain the planting area shape of the first area based on the edge shape of the first area, and mark it as a supplementary area; Step S103: Obtain the vegetation types corresponding to the planting areas in the first region, sort them from largest to smallest according to the remaining area of ​​the planting area, and obtain the second sequence; Step S104: Sequentially obtain the first vegetation in the second sequence, determine whether the first vegetation and the vegetation in the second sequence have the same matching character, if they do, replace the next vegetation in the second sequence and repeat step S104, if they do not, use the first vegetation to fill the supplementary area.

[0011] A smart garden operation and maintenance system, using the aforementioned smart garden operation and maintenance method, includes a data acquisition module, a first tag module, a second tag module, a planting area generation module, a layout module, a circulation module, a utilization rate acquisition module, and an output module; The data acquisition module is used to obtain a plan view of the garden and the planting area of ​​different vegetation; The first label module is used to divide the area based on the planar map and attach a first planting label to each planting area; The second label module is used to attach second planting labels and adaptation labels to different vegetation; The planting area generation module is used to generate random Manhattan polygons based on vegetation area, obtain multiple planting areas, and construct a first set for storing planting areas. The arrangement module is used to sequentially obtain planting areas within the first set, calculate the parameter value of the planting area within the planting area, and determine whether to place it in the planting area based on the parameter value. If it can be placed, the planting area is placed in the planting area, and the area of ​​the placed planting area is updated based on the planting area. If it cannot be placed, it is determined whether the planting area is the last one. If it is the last one, the utilization rate acquisition module is called. If it is not the last one, the loop module is called. The loop module is used to replace the next planting area in the first set and re-call the layout module; Utilization rate acquisition module: Acquires the space utilization rate of each planting area, calculates the first utilization rate, and calls the output module; The output module is used to determine whether the number of times the planting area generation module has been re-executed has reached the threshold. If the threshold has not been reached, the planting area generation module is called again. If the threshold has been reached, multiple first utilization rates are obtained, and the scheme with the highest first utilization rate is output as the layout scheme of the garden.

[0012] One of the above technical solutions has the following advantages or beneficial effects: by quickly generating and comparing multiple high-quality alternative solutions, the efficiency of early design decision-making and the scientific nature of the solutions are greatly improved. At the same time, the efficient use of land resources is ensured through quantitative indicators. Moreover, other designers can redesign the planting shape according to their own needs while retaining the original area size, making it more aesthetically pleasing. This not only greatly accelerates the generation of layout plans in the early stage of garden operation and maintenance, but also reduces the workload of garden design. Attached Figure Description

[0013] Figure 1 This is a flowchart of one embodiment of the method of the present invention.

[0014] Figure 2 This is a schematic diagram of the candidate arrangement position in one embodiment of the present invention.

[0015] Figure 3 This is a schematic diagram of the candidate arrangement positions in another embodiment of the present invention.

[0016] Figure 4 This is a schematic diagram of planting area updating in one embodiment of the present invention.

[0017] Figure 5 This is a schematic diagram of the structure of one embodiment of the system of the present invention. Detailed Implementation

[0018] Embodiments of the present invention are described in detail below. Examples of these embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals denote the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present invention, and should not be construed as limiting the present invention.

[0019] In the description of embodiments of the present invention, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of the stated features. In the description of embodiments of the present invention, "a plurality of" means two or more, unless otherwise explicitly specified.

[0020] Furthermore, the terms "first" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of that feature. In the description of this invention, unless otherwise stated, "a plurality of" means two or more. Those skilled in the art will understand the specific meaning of the above terms in this invention based on the specific circumstances.

[0021] like Figures 1-5 As shown, a smart operation and maintenance method for gardens includes the following steps: Step S1: Obtain a plan view of the garden and the planting area of ​​different vegetation; Step S2: Divide the area based on the planar map and attach a first planting label to each planting area; Step S3: Attach a second planting tag and an adaptation tag to different vegetation types; Step S4: Generate random Manhattan polygons based on vegetation area to obtain multiple planting areas, and construct a first set for storing planting areas; Step S5: Sequentially obtain the planting areas in the first set, calculate the parameter value of the planting area within the planting area, and determine whether to place it in the planting area based on the parameter value. If it can be placed, place the planting area in the planting area and update the area of ​​the placed planting area based on the planting area. If it cannot be placed, determine whether the planting area is the last one. If it is the last one, proceed to step S7. If it is not the last one, proceed to step S6. Step S6: Replace the next planting area in the first set and repeat step S5; Step S7: Obtain the space utilization rate of each planting area, calculate the first utilization rate, and proceed to step S8; Step S8: Determine whether the number of re-executions of step S4 has reached the threshold. If the threshold has not been reached, re-execute step S4. If the threshold has been reached, obtain multiple first utilization rates and output the scheme with the highest first utilization rate as the layout scheme of the garden.

[0022] In landscape maintenance, the initial vegetation layout is crucial. Typically, the areas where vegetation needs to be planted and the planting area are determined during the initial layout phase. This layout often requires experienced designers and is time-consuming. To alleviate the challenges of initial vegetation layout design in landscape maintenance, this invention first obtains a plan view of the landscape and the required planting area for different vegetation types. Then, based on the plan view, the landscape is divided into multiple planting zones. To better match different planting zones with different vegetation types, each planting zone is assigned a first planting tag, and each second planting zone is assigned a second planting tag and an adaptation tag. Matching the first and second planting tags clearly defines the planting range and whether different vegetation types can be planted adjacently. To expedite the layout, this invention eliminates the need for shape design for planting zones. Instead, the shapes of planting zones are generated randomly, thus transforming the vegetation layout problem into a traditional two-dimensional planar layout problem. Furthermore, this invention introduces an optimization mechanism. By repeatedly generating layout schemes (step S4) and calculating their space utilization rate (step S7), the scheme with the highest utilization rate is automatically selected from numerous feasible solutions as the optimal garden layout scheme (step S8). This process frees designers from a large amount of repetitive manual work, enabling them to quickly generate and compare multiple high-quality alternative schemes, thereby greatly improving the efficiency of early design decisions and the scientific nature of the schemes. At the same time, quantitative indicators ensure the efficient use of land resources. Moreover, other designers can redesign the planting shape according to their own needs while retaining the original area size, making it more aesthetically pleasing. This not only greatly accelerates the generation of layout schemes in the early stages of garden operation and maintenance but also reduces the workload of garden design.

[0023] It is worth mentioning that the space utilization rate mentioned in this invention is the proportion of the planting area to the total area of ​​the planting area.

[0024] Preferably, the adaptation tag in step S3 is constructed from adaptation characters and category characters; When placing planting areas, the following rules must be followed: When the first planting label is the same as the second planting label, the planting area is placed in the planting area; When the matching characters are the same in different planting areas, different planting areas cannot be considered as adjacent areas.

[0025] Since some plants cannot be planted adjacently, such as lilac and lily of the valley, this invention assigns a matching character to the planting area corresponding to each plant. When the matching characters of different plant areas are the same, they cannot be considered adjacent areas. For example, if the matching characters of lilac and lily of the valley are both 1, then lilac and lily of the valley cannot be considered adjacent planting areas.

[0026] Preferably, the rules for placing the planting area within the planting area are as follows: By making each vertex of the planting area contact the available vertices of the planting area, such that at least one edge of the planting area is adjacent to the boundary of the planting area, one or more candidate arrangement positions are generated. In the candidate arrangement positions, the edge in the planting area that is adjacent to the boundary of the planting area is defined as the first edge, and the edge in the planting area that is adjacent to the planting area is defined as the second edge.

[0027] When obtaining one or more placement positions for a planting area within a planting area, it is necessary to match each vertex of the planting area with each available vertex of the planting area to obtain multiple placement positions. Finally, candidate placement positions for the planting area within the planting area are selected based on parameter values. For example... Figure 2 As shown, planting region B includes six vertices: A, B, C, D, E, and F. The vertices of the planting region need to be matched with these six vertices to generate multiple candidate arrangement positions. During matching, it is necessary to ensure that one edge of each planting region abuts against another edge of the planting region. In this case, the edge where planting region A contacts the other planting region is the first edge, and BC is the second edge.

[0028] Preferably, the steps for obtaining parameter values ​​are as follows: In response to determining that any vertex of the planting area is outside the boundary of the planting area, the parameter value of the current layout position is set to an invalid value; In response to determining that the planting area is completely within the boundary of the planting area, the parameter value of the current layout position is calculated based on the spatial relationship between the first edge and the second edge; From all candidate layout positions, the candidate layout position with the highest parameter value is selected as the placement position of the planting area; The parameter values ​​are: ,in , Let W and H be the width and height of the first edge at the i-th position in the planting area, respectively, and let W and H be the length and height of the second edge.

[0029] like Figure 3The first candidate layout position shown is invalid because planting area A has exceeded the range of planting area B.

[0030] Preferably, the steps for updating the area of ​​the planted area based on the planting region are as follows: The vertices that overlap with the planting area are discarded, and the other vertices in the planting area are extreme points. Delete discarded vertices, and update the planting area by connecting the remaining vertices of the planting area with the extreme points.

[0031] Assumption Figure 2 If the parameter value of the candidate arrangement position is the highest, then point C in the planting area and points in the planting area that correspond to point C will be discarded first. Then, the updated planting area will be obtained again by connecting them sequentially. Figure 4 As shown.

[0032] Preferably, the following steps are also included: Step S9: Obtain the remaining area of ​​each planting area in the layout scheme as the remaining area, and obtain the adjacent vegetation types in the remaining area and mark them as the first type; The planting type with the largest remaining area in the first category is used to fill the remaining area.

[0033] Because some planting areas are omitted during the layout acquisition process, the remaining areas of these planting areas still need to be filled. This can be done by obtaining the adjacent vegetation types for the remaining areas and filling them with those adjacent types. This approach saves on additional calculations and judgments while maintaining aesthetic appeal. If the first type is already arranged, then vegetation types with different matching characters can be found and used to fill the remaining areas.

[0034] Preferably, the following steps are also included: Step S101: Obtain the terrain plan, select the first area that needs to be modified from the planting area based on the terrain plan, and calculate the first area to be increased in the first area; Step S102: Obtain the planting area shape of the first area based on the edge shape of the first area, and mark it as a supplementary area; Step S103: Obtain the vegetation types corresponding to the planting areas in the first region, sort them from largest to smallest according to the remaining area of ​​the planting area, and obtain the second sequence; Step S104: Sequentially obtain the first vegetation in the second sequence, determine whether the first vegetation and the vegetation in the second sequence have the same matching character, if they do, replace the next vegetation in the second sequence and repeat step S104, if they do not, use the first vegetation to fill the supplementary area.

[0035] Since some gardens require modifications to the terrain, such as transforming a small hill or a basin, effective analysis cannot be performed on the planar map in step S1. Therefore, the area of ​​the planned region can only be increased by re-acquiring the terrain plan. During the process of increasing the area, the area will be expanded outward based on the edge shape of the first area, and the expanded area will be calculated based on the first area to obtain the supplementary area where vegetation needs to be added.

[0036] To facilitate better organization and processing by designers, this invention prioritizes using vegetation from the first region to fill the supplementary region. Since the supplementary region is obtained through outward expansion, it surrounds the outside of the first region. At this point, it is necessary to determine whether the filling vegetation will conflict with other vegetation, i.e., to determine whether the first vegetation and the vegetation in the second sequence have the same matching character. If not, the first vegetation is used for filling; if so, the next vegetation in the second sequence is used, and the matching character is determined again.

[0037] If the second sequence cannot satisfy the filling of the supplementary area, then fill it with preset vegetation, such as lawns or other "all-purpose" vegetation.

[0038] A smart garden operation and maintenance system, using the aforementioned smart garden operation and maintenance method, includes a data acquisition module, a first tag module, a second tag module, a planting area generation module, a layout module, a circulation module, a utilization rate acquisition module, and an output module; The data acquisition module is used to obtain a plan view of the garden and the planting area of ​​different vegetation; The first label module is used to divide the area based on the planar map and attach a first planting label to each planting area; The second label module is used to attach second planting labels and adaptation labels to different vegetation; The planting area generation module is used to generate random Manhattan polygons based on vegetation area, obtain multiple planting areas, and construct a first set for storing planting areas. The arrangement module is used to sequentially obtain planting areas within the first set, calculate the parameter value of the planting area within the planting area, and determine whether to place it in the planting area based on the parameter value. If it can be placed, the planting area is placed in the planting area, and the area of ​​the placed planting area is updated based on the planting area. If it cannot be placed, it is determined whether the planting area is the last one. If it is the last one, the utilization rate acquisition module is called. If it is not the last one, the loop module is called. The loop module is used to replace the next planting area in the first set and re-call the layout module; Utilization rate acquisition module: Acquires the space utilization rate of each planting area, calculates the first utilization rate, and calls the output module; The output module is used to determine whether the number of times the planting area generation module has been re-executed has reached the threshold. If the threshold has not been reached, the planting area generation module is called again. If the threshold has been reached, multiple first utilization rates are obtained, and the scheme with the highest first utilization rate is output as the layout scheme of the garden.

[0039] In the description of this specification, the references to terms such as "one embodiment," "some embodiments," "illustrative embodiment," "example," "specific example," or "some examples," etc., indicate that a specific feature, structure, material, or characteristic described in connection with that embodiment or example is included in at least one embodiment or example of the invention. In this specification, the illustrative expressions of the above terms do not necessarily refer to the same embodiment or example. Furthermore, the specific features, structures, materials, or characteristics described may be combined in any suitable manner in one or more embodiments or examples.

[0040] Although embodiments of the invention have been shown and described, those skilled in the art will understand that various changes, modifications, substitutions and alterations can be made to these embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the claims and their equivalents.

Claims

1. A method for intelligent operation and maintenance of gardens, characterized in that, Includes the following steps: Step S1: Obtain a plan view of the garden and the planting area of ​​different vegetation; Step S2: Divide the area based on the planar map and attach a first planting label to each planting area; Step S3: Attach a second planting tag and an adaptation tag to different vegetation types; Step S4: Generate random Manhattan polygons based on vegetation area to obtain multiple planting areas, and construct a first set for storing planting areas; Step S5: Sequentially obtain the planting areas in the first set, calculate the parameter value of the planting area within the planting area, and determine whether to place it in the planting area based on the parameter value. If it can be placed, place the planting area in the planting area and update the area of ​​the placed planting area based on the planting area. If it cannot be placed, determine whether the planting area is the last one. If it is the last one, proceed to step S7. If it is not the last one, proceed to step S6. Step S6: Replace the next planting area in the first set and repeat step S5; Step S7: Obtain the space utilization rate of each planting area, calculate the first utilization rate, and proceed to step S8; Step S8: Determine whether the number of times step S4 has been re-executed has reached the threshold. If the threshold has not been reached, re-execute step S4. If the threshold has been reached, obtain multiple first utilization rates and output the scheme with the highest first utilization rate as the garden layout scheme. The adaptation tag mentioned in step S3 is constructed from adaptation characters and category characters; When placing planting areas, the following rules must be followed: When the first planting label and the second planting label are the same, the planting area is allowed to be placed in the planting area; When the matching characters are the same in different planting areas, different planting areas cannot be considered as adjacent areas; The rules for placing planting areas within planting areas are as follows: By making each vertex of the planting area contact the available vertices of the planting area, such that at least one edge of the planting area is adjacent to the boundary of the planting area, one or more candidate arrangement positions are generated. In the candidate arrangement positions, the edge in the planting area that is adjacent to the boundary of the planting area is defined as the first edge, and the edge in the planting area that is adjacent to the planting area is defined as the second edge; The steps to obtain parameter values ​​are as follows: In response to determining that any vertex of the planting area is outside the boundary of the planting area, the parameter value of the current layout position is set to an invalid value; In response to determining that the planting area is completely within the boundary of the planting area, the parameter value of the current layout position is calculated based on the spatial relationship between the first edge and the second edge; From all candidate layout positions, the candidate layout position with the highest parameter value is selected as the placement position of the planting area; The parameter values ​​are: ,in , Let W and H be the width and height of the first edge at the i-th position in the planting area, respectively, and let W and H be the length and height of the second edge.

2. The intelligent operation and maintenance method for gardens according to claim 1, characterized in that, The steps to update the area of ​​the placed planting area based on the planting region are as follows: The vertices that overlap with the planting area are discarded, and the other vertices in the planting area are extreme points. Delete discarded vertices, and update the planting area by connecting the remaining vertices of the planting area with the extreme points.

3. The intelligent operation and maintenance method for gardens according to claim 1, characterized in that, It also includes the following steps: Step S9: Obtain the remaining area of ​​each planting area in the layout scheme as the remaining area, and obtain the adjacent vegetation types in the remaining area and mark them as the first type; The planting type with the largest remaining area in the first category is used to fill the remaining area.

4. The intelligent operation and maintenance method for gardens according to claim 1, characterized in that, It also includes the following steps: Step S101: Obtain the terrain plan, select the first area that needs to be modified from the planting area based on the terrain plan, and calculate the first area to be increased in the first area; Step S102: Obtain the planting area shape of the first area based on the edge shape of the first area, and mark it as a supplementary area; Step S103: Obtain the vegetation types corresponding to the planting areas in the first region, sort them from largest to smallest according to the remaining area of ​​the planting area, and obtain the second sequence; Step S104: Sequentially obtain the first vegetation in the second sequence, determine whether the first vegetation and the vegetation in the second sequence have the same matching character, if they do, replace the next vegetation in the second sequence and repeat step S104, if they do not, use the first vegetation to fill the supplementary area.

5. A smart garden operation and maintenance system, using the smart garden operation and maintenance method according to any one of claims 1 to 4, characterized in that, It includes a data acquisition module, a first label module, a second label module, a planting area generation module, a layout module, a loop module, a utilization rate acquisition module, and an output module; The data acquisition module is used to obtain a plan view of the garden and the planting area of ​​different vegetation; The first label module is used to divide the area based on the planar map and attach a first planting label to each planting area; The second label module is used to attach second planting labels and adaptation labels to different vegetation; The planting area generation module is used to generate random Manhattan polygons based on vegetation area, obtain multiple planting areas, and construct a first set for storing planting areas. The arrangement module is used to sequentially obtain planting areas within the first set, calculate the parameter value of the planting area within the planting area, and determine whether to place it in the planting area based on the parameter value. If it can be placed, the planting area is placed in the planting area, and the area of ​​the placed planting area is updated based on the planting area. If it cannot be placed, it is determined whether the planting area is the last one. If it is the last one, the utilization rate acquisition module is called. If it is not the last one, the loop module is called. The loop module is used to replace the next planting area in the first set and re-call the layout module; Utilization rate acquisition module: acquires the space utilization rate of each planting area, calculates the first utilization rate, and calls the output module; The output module is used to determine whether the number of times the planting area generation module has been re-executed has reached the threshold. If the threshold has not been reached, the planting area generation module is called again. If the threshold has been reached, multiple first utilization rates are obtained, and the scheme with the highest first utilization rate is output as the layout scheme of the garden.

Citation Information

Patent Citations

  • Method and system for planning a path of a vehicle

    EP3794919A1

  • Method for preparing a product in a suitable quantity for localized treatment in a plot of land

    US20240407304A1