A hierarchical planning algorithm based on network topology analysis for minimal Steiner tree problems

The large-scale system programming by developed special visualization instrument is limited efficiently and accurately with the increasing application requirment and the development of information technology. A hierarchical path planning algorithm had been presented by using network topology analysis in this paper, recommended a strategy of divide and conquer from human cognition for improving the solution capability and efficiency of minimal Steiner tree (MST) problems to complex real system. The experiment result had shown the applicability and usability of proposed algorithm by a real system programming of the northeast power grid of china.