Multi-constraint line selection method based on geographic information
A technology of geographic information and route selection method, applied in the direction of constraint-based CAD, data processing application, electrical digital data processing, etc., can solve problems such as rough economic considerations, achieve the effect of optimizing route selection scheme and reducing cost
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0034] refer to figure 1 , is an example of the present invention, provides a kind of optimization method based on geographic information multi-constraint line selection, including:
[0035] S1: Obtain the geographical information required for line selection through investigation;
[0036] The geographic information required for the survey includes physical geographic information, human geographic information and power system information. The natural geographic information includes nature reserves and land. Landforms, water systems, vegetation, etc. Human geography information includes residence, traffic information and special area information.
[0037] S2: Establish a line selection grid model according to geographic information;
[0038] Establish line selection grids, including index quantification, grid division, and grid assignment. Among them, index quantification includes single index weight scoring and index mutual weight scoring, and the final effect is to obtai...
Embodiment 2
[0072] In order to verify and explain the technical effect adopted in this method, this example uses the traditional A* algorithm to compare with it. In the previous example, the method effect was verified and compared with the routing area of a substation in an urban area. The optimal path length of the traditional A* algorithm was greater than that of the weighted A* algorithm, and the optimal path did not consider geographical elements. There is a large amount of overlap, which is difficult to implement. In contrast, the calculation time of the weighted A* algorithm is significantly longer than that of the traditional A* algorithm, which is due to the increased calculation amount due to the introduction of grid weights.
[0073] The steps of the A* algorithm are as follows:
[0074] S1: First establish an open list and a closed list to accommodate the waypoints, and set the grid points in the red limit area as a set, and they can neither be included in the open list nor ...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



