• Title/Summary/Keyword: Sequential two point method

Search Result 42, Processing Time 0.02 seconds

A Study on Continuous Management Strategy or Published Coordinates of National Geodetic Control Points using GPS Network Adjustment (GPS 측지망 조정을 통한 국가기준점 성과의 상시 산정 체계에 관한 연구)

  • Jung, Kwang-Ho;Lee, Hung-Kyu
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.29 no.4
    • /
    • pp.367-380
    • /
    • 2011
  • This paper has focused on deriving a GPS based geodetic network adjustment strategy to continuously determine coordinate sets of the national geodetic control points. After domestic literature review on the topic and overseas case studies about countries that recently reformed their geodetic infrastructure have been carried out, a simplified geodetic network consisting of two layers, namely GPS active and passive network, has been proposed to maximize effectiveness of the network adjustment through reducing the number of the passive points. Furthermore, a GPS data processing and network adjustment procedure has been derived to support the continuous management scheme. While a scheme for the active layer adopts a sequential least squares adjustment based on a multi-baseline, that of the passive layer employs a multi-session adjustment technique with respect to 3-dimensional baseline vectors. Finally, experimental adjustment against a network comprising 24 active and 6,900 passive stations has been performed to demonstrate the efficiency and the effectiveness of the proposed method.

Path Search Method using Genetic Algorithm (유전자 알고리즘을 이용한 경로 탐색)

  • Kim, Kwang-Baek;Song, Doo-Heon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.6
    • /
    • pp.1251-1255
    • /
    • 2011
  • In this paper, we propose an optimal path search algorithm that contains all nodes using genetic algorithm. An object in this approach is formed as an equation related with the Euclidean distance between an intermediate node and the starting node and between an intermediate node and the goal node. Like other genetic algorithm structures, our algorithm defines a fitness function and selects a crossover spot node and a bitwise crossover point. A new node out of such operation survives only if it satisfies the fitness criteria and that node then becomes the starting node for the next generation. Repetition continues until no changes are made in the population. The efficiency of this proposed approach is verified in the experiment that it is better than two other contestants - sequential approach and the random approach.