• Title/Summary/Keyword: Traverse method

Search Result 98, Processing Time 0.033 seconds

Study on Optimal Design of Traverse Switch System for Maglev Train (자기부상열차용 트레버스 분기기 최적설계 연구)

  • Lee, Younghak;Kim, Chang-Hyun;Lee, Jong-Min
    • Journal of the Korean Society for Railway
    • /
    • v.19 no.6
    • /
    • pp.717-726
    • /
    • 2016
  • Emergency tracks are necessary in case a broken down train evacuates, a train needs to make way for a faster train behind it, or a train suddenly stops and following trains must avoid colliding with it. Magnetic Levitated (maglev) Trains can change track to enter an emergency track using a segmented switch or a traverse switch. On a traverse switch, a train can change its track when the part of the track that the train is on moves to the other track. Currently manufactured Maglev trains have two bodies and the total length is 25 meters. If a traverse switch is used, it will only require 30 meters of track to move the train to the other track, so, when it comes to efficiency of costs and space, the traverse switch surpasses the articulated switch. Therefore, in this paper, an optimized design to secure structural safety and weight lightening is suggested. To achieve these results, the heights of the piled concrete and girders which are both placed on the top of the traverse switch, are set as design variables. The Finite Element Method (FEM), in application of kriging and in the design of the experiments (DOE), is used. Maximum stress, deformation, and structural weight are compared with the results, and through this process structural safety and weight lightening is proven.

An Introduction of General Least Squares on the Cadastral Survey Computation (지적측량계산에 일반최소제곱법의 도입 (도근측량방법 중 도선법 기준))

  • Song, Won-Ho;Cha, Deuk-Ki;Kim, Su-Jeong
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2010.04a
    • /
    • pp.349-353
    • /
    • 2010
  • The existing calculation methods of the cadastral traverse survey was established in 1910s and are mostly outdated. The quality of these methods are not adequate to satisfy today's surveyor's needs that use a simple calculation method to distribute the error values. Thus, the main objective of this research is to find a methodology for appropriate calculation methods of the cadastral traverse survey that uses the general least square adjustment method with weight. Consequently, least square adjustment method has a better result than the previous one.

  • PDF

Realtime Generation of Grid Map for Autonomous Navigation Using the Digitalized Geographic Information (디지털지형정보 기반의 실시간 자율주행 격자지도 생성 연구)

  • Lee, Ho-Joo;Lee, Young-Il;Park, Yong-Woon
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.14 no.4
    • /
    • pp.539-547
    • /
    • 2011
  • In this paper, a method of generating path planning map is developed using digitalized geographic information such as FDB(Feature DataBase). FDB is widely used by the Army and needs to be applied to all weapon systems of newly developed. For the autonomous navigation of a robot, it is necessary to generate a path planning map by which a global path can be optimized. First, data included in FDB is analyzed in order to identify meaningful layers and attributes of which information can be used to generate the path planning map. Then for each of meaningful layers identified, a set of values of attributes in the layer is converted into the traverse cost using a matching table in which any combination of attribute values are matched into the corresponding traverse cost. For a certain region that is gridded, i.e., represented by a grid map, the traverse cost is extracted in a automatic manner for each gird of the region to generate the path planning map. Since multiple layers may be included in a single grid, an algorithm is developed to fusion several traverse costs. The proposed method is tested using a experimental program. Test results show that it can be a viable tool for generating the path planning map in real-time. The method can be used to generate other kinds of path planning maps using the digitalized geographic information as well.

A Study on the Network Adjustment Analysis for Planimetric Positioning (수평위치 결정을 위한 망조정 해석에 관한 연구)

  • 유복모;조기성;이현직;곽동옥
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.9 no.2
    • /
    • pp.37-48
    • /
    • 1991
  • In this study, conventional network adjustment and combined network adjustment methods for single network adjustment methods for single network and centric combination network were compared by the analysis of root mean square error and standard error ellipse of observed points. It can be concluded from this study that for conventional surveying methods, the accuracy is in theorder of trilateration, traverse and triangulation, and for the case of combined surveying method, the accuracy is in the order of multilateration surveying, combined traverse and combined triangulation-trilateration surveying. And when establishing new control points, the accuracy can be improved by increasing redundant observations of centric combination network instead of using the single network. Also, in case of combined traverse surveying by adding observable laterals, accuracy level of trilateration could be achieved, and it was found that traverse is effective for large areas where sighting is easy, and combined traverse surveying is effective for urban areas where sighting is difficult.

  • PDF

A Design of Traverse and Representation Method of Maze for Shortest Path Search with Robots (로봇의 최단경로탐색을 위한 미로의 순회 및 표현방법 설계)

  • Hong, Ki-Cheon
    • 한국정보교육학회:학술대회논문집
    • /
    • 2010.08a
    • /
    • pp.227-233
    • /
    • 2010
  • Graph is applied to GIS, Network, AI and so on. We use graph concept in our daily life unconsciously. So this paper describe how graph concept is used when robot searches shortest path between two distinct vertices. It is performed in real world. For this, it consists of three step; maze traverse, graph generation, and shortest path search. Maze traverse steps is that robot navigates maze. It is most difficult step. Graph generation step is to represent structural information into graph. Shortest path search step is to that robot move between two vertices. It is not implemented yet. So we introduce process in design level.

  • PDF

Evaluation of GPS and Totalstation Surveying for University Facilities Mapping (GPS 및 토탈스테이션을 이용한 대학시설물 현황측량의 성과분석)

  • 박병욱;이대근;서상일
    • Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
    • /
    • 2003.10a
    • /
    • pp.43-48
    • /
    • 2003
  • This study presents the detailed methods for university facilities mapping using GPS and totalstation. In the control survey by GPS network adjustment, the level of significance for the height value of fourth order triangulation stations was estimated about loom. The accuracy analysis of height determination by totalstation for the traverse points showed that the RMSE came out 9mm to the basis of direct leveling, so it indicated that trigonometric leveling by totalstation was correct comparatively. For GPS/RTK method, the result of accuracy analysis about traverse points showed that the RMSE came out 33㎜ in horizontal location to the basis of totalstation's outcome and 15㎜ in height value to the basis of direct leveling. In the construction survey, GPS/RTK surveying is quicker and more economical than totalstation surveying in the feasible areas of GPS surveying, but there were many impossible areas lot GPS/RTK surveying by the obstacles like a building.

  • PDF

A Study on the New Algorithm for Shortest Paths Problem (복수 최단 경로 문제의 새로운 해법 연구)

  • Chang, Byung-Man
    • Korean Management Science Review
    • /
    • v.15 no.2
    • /
    • pp.229-237
    • /
    • 1998
  • This paper presents a new algorithm for the K Shortest Paths Problem which is developed with a Double Shortest Arborescence and an inward arc breaking method. A Double Shortest Arborescence is made from merging a forward shortest arborescence and a backward one with Dijkstra algorithm. and shows us information about each shorter path to traverse each arc. Then K shorter paths are selected in ascending order of the length of each short path to traverse each arc, and some paths of the K shorter paths need to be replaced with some hidden shorter paths in order to get the optimal paths. And if the cross nodes which have more than 2 inward arcs are found at least three times in K shorter path, the first inward arc of the shorter than the Kth shorter path, the exposed path replaces the Kth shorter path. This procedure is repeated until cross nodes are not found in K shorter paths, and then the K shortest paths problem is solved exactly. This algorithm are computed with complexity o($n^3$) and especially O($n^2$) in the case K=3.

  • PDF

Double Shortest Arborescence & Merging Algorithm for the Public Vehicle Routing Problem (공공차량 경로문제의 이중 최단나무 결합 해법)

  • Chang, Byoung-Man
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.16 no.2
    • /
    • pp.71-79
    • /
    • 1990
  • In this paper, the Double Shortest Arborescence & Merging method is presented as an efficient heuristic algorithm for the Public Vehicle Routing Problem which is to find the minimum total cost routes of M or less vehicles to traverse the required arcs(demand streets) at least once and return to their starting depot on a directed network. Double Shortest Arborescence which consists of forward shortest aborescence and backward one informs M or less shortest routes to traverse all required arcs. The number of these routes is reduced to M or less by merging routes. The computational experiment based on randomly generated networks reports that this algorithm is efficient.

  • PDF

A Study on the Applicability of the Kinematic and the Static GPS Methods for Coastal Ocean Structure Survey

  • Lee, Byung-Gul;Yang, Sung-Kee;Kang, In-Jun
    • Journal of Environmental Science International
    • /
    • v.11 no.2
    • /
    • pp.103-110
    • /
    • 2002
  • The position fixing usually is determined by triangulation, traverse surveying and astronomy surveying. However, when the station is moving, it is impossible to determine its position continuously by the former method. By a satellite positioning method(GPS), this problem can be solved. In our study, we used two methods to determine the length and coordinate of a point position. One is a kinematic GPS method and the other is a static one. Each is based on carrier phase measurement and employs a relative position technique. We implemented observation experiments such as Geodimeter and DGPS(Differential GPS) successfully. To estimate the accuracy between the kinematic and static methods, we compared the results of Geodimeter, the kinematic, and the static. The results showed that the static is relatively a little more accurate than the kinematic. However, in the kinematic mode, when we received the GPS data for a long time, we found that the kinematic also had a high accuracy value for the length survey Finally, we applied the GPS to Jeju Harbor Breakwater to examine the applicability of GPS for coastal ocean structure based on the kinematics and the statics, respectively.

Properties and Fractal Analysis of Joints around the Moryang Fault (모량단층 주변 절리의 분포 특성과 프랙탈 해석)

  • 최한우;장태우
    • The Journal of Engineering Geology
    • /
    • v.9 no.2
    • /
    • pp.119-134
    • /
    • 1999
  • Joints developed around the Moryang fault were investigated by traverse and inventory methods in order to characterize their orientation, spacing and density. The results of the traverse method show that the orientation of the dominant joint sets of the study area is NNE and EW, and that joint spacing distribution is a negative exponential distribution to the center of the fault and a log-normal distribution to the margin of the fault. The results of the inventory method show that the orientation of the dominant joint sets on joint map is NW and NE, and that joint density tends to increase toward the center of the fault. Fractal dimension was determined by using Box-counting method and Cantor's dust method to quantify the distribution of joint network and to evaluate the dimension around the fault. The dimension determined by Box-counting method ranges from 1.31 to 1.70 and shows the tendency of increasing value toward the center of the fault. Comparing fractal dimension by Box-counting method with joint density, fractal dimension is directly proportional to joint density. Nevertheless, fractal dimension could be varied due to the different distribution patterns of the joints with same density. The dimensions determined by Cantor's dust method show different values with respect to the orientation of scan lines. This results form the anisotropy of joint distribution.

  • PDF