基于生成树的控制网最小独立异步环搜索方法研究

实现控制网最小独立异步环的计算机自动搜索是一项较为复杂、繁琐的工作,目前介绍此工作方法的文献大多是阐述过程中的某一部分,并且部分细节问题讨论得较少。文中以帮助初学者对此项工作形成完备的认识并能够自主编程实现为目的,以GNSS控制网为例,详细介绍基于生成树的控制网最小独立异步环自动搜索方法,内容包括生成树的定义及建立方法,最短路径搜索-Dijkstra算法的原理与实现步骤,利用生成树与最短路径搜索算法搜索最小独立闭合环的原理及具体实现步骤,以及同步观测环的自动搜索方法。最后以一个控制网实例说明此方法的可行性。

Research on least independent non-simultaneous observation loop search method on control network based on spanning tree

It is a more complicated and cumbersome task to realize the automatic computer search for the least independent asynchronous loops in control network.At present,most of the literatures for this working method are a part of the elaboration process,and some details are less discussed.The purpose of this paper is to help beginners completely understand this work and achieve independent programming.In this paper,GNSS control network is taken as a case and the automatic search method of least independent asynchronous loops in control network based on spanning tree is introduced in details.It includes the definition and establishment method of spanning tree,the principle and implementation procedure of shortest path search-Dijkstra algorithm,the principle and the concrete implementation steps of searching for the least independent observation loops by using the spanning tree and the shortest path search algorithm,and the automatic search method for synchronous observation loops.Finally,an example of a control network is taken to illustrate the feasibility of this method and to help beginners.