A Distributed Algorithm for Building Space Topology Matching

摘要

Nowadays, distributed systems turn to be increasingly competitive with centralized systems, especially in the construction field. Thus, it is indispensable to design new effective distributed algorithms. In this work, a distributed algorithm focusing on the building space topology matching problem is proposed. In distributed control architectures, each floor is equipped with several Computing Process Nodes (CPNs) which play roles as controllers in the system. Our goal is to make every CPN in the building system acquire its own position on a designed CAD drawing. To achieve this, we utilize the geographic relationships among nodes. In the algorithm, each node compares its local topology features to the ones in the drawing and communicates with their neighborhoods. We prove that the topology matching problem can be solved by using this algorithm and derive the upper bound of the number of iterations. The experiments show that this algorithm works successfully in real designed buildings.