Wang Xinzhou. An Experiment on Locating Blunders for GPS Network[J]. Geomatics and Information Science of Wuhan University, 1995, 20(2): 157-162.
Citation: Wang Xinzhou. An Experiment on Locating Blunders for GPS Network[J]. Geomatics and Information Science of Wuhan University, 1995, 20(2): 157-162.

An Experiment on Locating Blunders for GPS Network

More Information
  • Received Date: March 15, 1994
  • Published Date: February 04, 1995
  • This paper studies the locating of blunders for GPS network by using the method of one-by-one searching which was presented by Wang Xinzhou(1992),and the method is further approved in the paper.It is shown that when the following two conditions are satisfied in GPS network,blunders can be located correctly with the improved method,and the estimators of blunders can also be made.These two conditions are:ng≤1.95nb-3p+3;Any point should have relations to at least three baselines.
  • Related Articles

    [1]DUAN Xinqiao, GE Yong, ZHANG Tong, LI Lin, TAN Yongbin. Direct Algorithm for the Exact Voronoi Diagram on Discrete Topographic Space[J]. Geomatics and Information Science of Wuhan University, 2023, 48(5): 799-806. DOI: 10.13203/j.whugis20210566
    [2]YU Liebing, XIANG Longgang, SUN Shangyu, GUAN Xuefeng, WU Huayi. kNN Query Processing for Trajectory Big Data Based on Distributed Column-Oriented Storage[J]. Geomatics and Information Science of Wuhan University, 2021, 46(5): 736-745. DOI: 10.13203/j.whugis20200136
    [3]LI Jian, CAO Yao, WANG Zongmin, WANG Guangyin. Scattered Point Cloud Simplification Algorithm Integrating k-means Clustering and Hausdorff Distance[J]. Geomatics and Information Science of Wuhan University, 2020, 45(2): 250-257. DOI: 10.13203/j.whugis20180204
    [4]YANG Jun, LIN Yanlong, ZHANG Ruifeng, WANG Xiaopeng. A Fast Algorithm for Finding k-nearest Neighbors of Large-Scale Scattered Point Cloud[J]. Geomatics and Information Science of Wuhan University, 2016, 41(5): 656-664. DOI: 10.13203/j.whugis20140191
    [5]CHEN Xijiang, HUA Xianghong, YANG Ronghua, ZHANG Qinghua. Planar Target Location Based on the Zoning K-means Clustering[J]. Geomatics and Information Science of Wuhan University, 2013, 38(2): 167-170.
    [6]MA Juan, FANG Yuanmin, ZHAO Wenliang. Algorithm for Finding k-Nearest Neighbors Based on Spatial Sub-cubes and Dynamic Sphere[J]. Geomatics and Information Science of Wuhan University, 2011, 36(3): 358-362.
    [7]WANG Haijun, DENG Yu, WANG Li, GUAN Xingliang. A C-means Algorithm Based on Data Field[J]. Geomatics and Information Science of Wuhan University, 2009, 34(5): 626-629.
    [8]HAN Yuanli, WANG Haijun, XIA Wenfang. A New Urban Land Classification Model Based on k-order Data Field of Point Set[J]. Geomatics and Information Science of Wuhan University, 2009, 34(3): 370-373.
    [9]LI Guangqiang, DENG Min, ZHU Jianjun. Spatial Association Rules Mining Methods Based on Voronoi Diagram[J]. Geomatics and Information Science of Wuhan University, 2008, 33(12): 1242-1245.
    [10]HAN Yuanli, HU Peng, XIA Wenfang, ZHANG Lihua. Existence Determination About k-order Voronoi Diagram of Point Set[J]. Geomatics and Information Science of Wuhan University, 2007, 32(9): 833-837.

Catalog

    Article views (742) PDF downloads (208) Cited by()
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return