Research on Local Topology Tracking of Power Grid Based on Graph Theory
Power network topology identification, judgment, and tracking are the basic functional components of power system guarantee system and security management system. They can provide basic network structure data for other application software programs of power system. However, the traditional power gri...
Guardado en:
Autor principal: | |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Hindawi-Wiley
2021
|
Materias: | |
Acceso en línea: | https://doaj.org/article/edcf7a4c98e840998818f73286bfa2c7 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Sumario: | Power network topology identification, judgment, and tracking are the basic functional components of power system guarantee system and security management system. They can provide basic network structure data for other application software programs of power system. However, the traditional power grid topology method is not easy to implement and provides less relevant data that can be accurately analyzed, so that relevant personnel cannot fully understand the state of the power grid and give accurate commands, resulting in serious power accidents. Therefore, this paper proposes the research of power grid local topology tracking based on graph theory and constructs the power grid local topology tracking algorithm based on graph theory. The experimental results show that the local topology tracking algorithm based on graph theory can track the local topology of power grid quickly and effectively. Compared with the traditional method based on priority search, although the first power grid topology takes a relatively long time, it greatly improves the search and processing time after each time and has high efficiency in local topology. This shows that the local topology tracking algorithm based on graph theory needs less computation when carrying out the local topology of power grid. At the same time, the theory of power grid local topology tracking algorithm based on graph theory is relatively simple and easy to time, which is more practical than the traditional method. |
---|