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

Author

Meng-Yang Li ; Zong-Xiao Yang ; Li-Xiang Hao ; Hou-Kun Dai

Author_Institution

Henan Eng. Lab. of Wind Power Syst., Henan Univ. of Sci. & Technol., Luoyang, China

fYear

2013

fDate

25-27 Sept. 2013

Firstpage

683

Lastpage

686

Abstract

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.

Keywords

computational complexity; optimisation; path planning; topology; trees (mathematics); complex real system; divide and conquer method; hierarchical path planning algorithm; hierarchical topology structure; human cognition; large-scale system programming; minimal Steiner tree problems; network topology analysis; Algorithm design and analysis; Approximation algorithms; Planning; Power grids; Steiner trees; Topology; Visualization; Hierarchical planning algorithm; Hierarchical topology structure; Shortest path; minimum Steiner tree (MST);

fLanguage

English

Publisher

ieee

Conference_Titel

Advanced Mechatronic Systems (ICAMechS), 2013 International Conference on

Conference_Location

Luoyang

Print_ISBN

978-1-4799-2518-6

Type

conf

DOI

10.1109/ICAMechS.2013.6681729

Filename

6681729