DXF File Topological Information Extraction and Storage for Decentralized Distribution Network

  • Yuhan ZhangEmail author
  • Shiqiang Wang
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 890)


In this paper, DXF (Data Exchange File) file is used to extract the topological information of a distribution network. The basic information is configured to each CPN (Computing Process Node) and the local topology is obtained through broadcast communication. According to the topological sorting algorithm of the adjacency list, the global topology is obtained. Taking a typical building distribution network as an example, the feasibility of the method is analyzed and demonstrated.


Data exchange file Topological information configuration Adjacency list 



This work is financially supported by the National Key Research and Development Project of China No. 2017YFC0704100 (entitled New Generation Intelligent Building Platform Techniques).


  1. 1.
    Dai, Y., Jiang, Z., et al.: A decentralized algorithm for optimal distribution in HAVC system. Build. Environ. 95, 21–31 (2016)CrossRefGoogle Scholar
  2. 2.
    Atia, M.: Classification and elimination of overlapped entities in DXF files. Ain Shams Eng. 5(3), 851–860 (2014)CrossRefGoogle Scholar
  3. 3.
    Yang, H., Yan, J.: DXF file identification with C# for CNC engraving machine system. Intell. Control Autom. 6(1), 20–28 (2015)CrossRefGoogle Scholar
  4. 4.
    Basu, A., Blanning, R.W.: Metagraphs and Their Applications (2007).
  5. 5.
    Luan, W., Peng, J., et al.: Distribution network topology error correction using smart meter data analytics. In: Proceedings of Power & Energy Society General Meeting, pp. 1–5 (2013)Google Scholar
  6. 6.
    Gaur, D., Shastri, A., Biswas, R.: Metagraph-based substructure pattern mining. In: International Conference on Advanced Computer Theory and Engineering, pp. 865–869 (2008)Google Scholar
  7. 7.
    Kochukov, O.: Model for technical-economic analysis of ENTSO-E and IPS/UPS power system optimal interconnection concepts. Sci. J. Riga Tech. Univ. Power Electr. Eng. 28(1), 15–18 (2011)Google Scholar
  8. 8.
    David, J., Paul, H.: A dynamic topological sort algorithm for directed acyclic graphs. J. Exp. Algorithmics 11, 1–7 (2006)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.College of Defense EngineeringArmy Engineering University of PLANanjingChina

Personalised recommendations