A Hierarchical Planning Algorithm Based On Network Topology Analysis For Minimal Steiner Tree Problems

As an important research direction of operational research optimization theory, theminimum Steiner tree theory is the basis theory of global shortest path. It has becomethe research focus in the management science and engineering, how to realize theeffective resource cost saving is the implementation of the important subject ofbuilding a conservation-minded society must give priority to. The system internalsecondary node of the objective position, and the purpose is the current main technicalbottlenecks, how to solve such problem has become a research hotspot anddevelopment trend in the field.At first, this paper introduces a kind of brand-new visual test method, by which theproblem of global path planning is modeled from the perspective of the physical testand the minimum Steiner tree visualization film trajectory is structured with thephysical properties of the membrane. The large-scale system programming bydeveloped special visualization instrument is limited efficiently and accurately withthe increasing application requirment and the development of information technology.A hierarchical path planning algorithm had been presented by using network topologyanalysis in this paper, recommended a strategy of divide and conquer from humancognition for improving the solution capability and efficiency of minimal Steiner tree(MST) problems to complex real system. Layered algorithm mainly includes theconstruction of a hierarchical network, layering, the definition of abstract and theformation of hierarchical topology relation. The idea comes from the geography spatialhierarchical reasoning theory and graph theory of graph partition. Its core is throughthe Delaunay triangular subdivision to a hierarchy of network n nodes, the Steiner treestructure with each layer, and finally through a connection all the Steiner tree toconstruct the minimum Steiner tree. Making it up that when the numbers of givenpoints are increased. It is difficult to produce film path, to achieve path planningsystem fast. This paper through the simple arithmetic examples this paper expounds thefeasibility of the method; Then further through an engineering example of layeredrespectively with that of the minimum spanning tree algorithm to optimize data testdata and visualization test of test data, comparing three kinds of data analysis; Verifythe correctness of the algorithm, and further illustrate the feasibility of the algorithm...