• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.1046-1050
• /
• 2003

In this paper, we describe study on the development or multi-path ultrasonic gas flowmeter using a transit time method. This system includes 5 pairs of ultrasonic transducers. ultrasonic signal processing unit using switch matrix method, computation algorithm of gas flow rate, spool piece type multi-path pipe unit. We have developed enhanced type of main ultrasonic signal processing unit using switch matrix method fer multi-path ultrasonic gas flowmeter. Also, we have developed the new transmitting ＆ receiving method of ultrasonic waves and the new signal processing algorithm for the computation of ultrasonic transit time from received ultrasonic waves. In this study, we have designed more compact signal processing unit compared with the conventional hardware system of multi-path ultrasonic gas flowmeter. We have confirmed its reliability for multi-path ultrasonic gas flowmeter through the laboratory test using calibration system. In the future. we will perform the field test for the developed system in the POSCO gas line.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.179-188
• /
• 2001

We analyze the property of candidate node set in the network graph, and propose an algorithm to decrease shortest path-finding computation time by using multiple dynamic-range queue(MDRQ) structure. This MDRQ structure is newly created for effective management of the candidate node set. The MDRQ algorithm is the shortest path-finding algorithm that varies range and size of queue to be used in managing candidate node set, in considering the properties that distribution of candidate node set is constant and size of candidate node set rapidly change. This algorithm belongs to label-correcting algorithm class. Nevertheless, because re-entering of candidate node can be decreased, the shortest path-finding computation time is noticeably decreased. Through the experiment, the MDRQ algorithm is same or superior to the other label-correcting algorithms in the graph which re-entering of candidate node didn’t frequently happened. Moreover the MDRQ algorithm is superior to the other label-correcting algorithms and is about 20 percent superior to the other label-setting algorithms in the graph which re-entering of candidate node frequently happened.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.6C
• /
• pp.487-497
• /
• 2008

This paper proposes a new adaptive QRD-M algorithm for MIMO systems. The proposed scheme controls the number of survivor paths,0 based on the channel condition at each layer. The original QRD-M algorithm used fixed M at each layer and it needs large M to achieve near-MLD (maximum-likelihood detection) performance. However, using the large M increases the computation complexity. In this paper, we further effectively control M by employing the channel indicator which includes not only the channel gain, but also instantaneous noise information without necessity of SNR measurement. We found that the ratio of the minimum path metric to the second minimum is good reliability indicator for the channel condition. By adaptively changing M based on this ratio, the proposed scheme effectively achieves near MLD performance and computation complexity of the proposed scheme is significantly smaller than the conventional QRD-M algorithms.

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.296-309
• /
• 2003

One of commercial applications of mobile computing is ATIS(Advanced Traveler Information Systems) in ITS(Intelligent Transport Systems). In ATIS, a primary mobile computing task is to compute the shortest path from the current location to the destination. In this paper, we have studied the shortest path re-computation problem that arises in the DRGS(Dynamic Route Guidance System) in ATIS where the cost of topological digital road map is frequently updated as traffic condition changes dynamically. Previously suggested methods either re-compute the shortest path from scratch or re-compute the shortest path just between the two end nodes of the edge where the cost change occurs. However, these methods we trivial in that they do not intelligently utilize the previously computed shortest path information. In this paper, we propose an efficient approximate shortest path re-computation method based on the dynamic window scheme. The proposed method re-computes an approximate shortest path very quickly by utilizing the previously computed shortest path information. We first show the theoretical analysis of our methods and then present an in-depth experimental performance analysis by implementing it on grid graphs as well as a real digital road map.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.430-448
• /
• 2001

In navigation system, a primary task is to compute the minimum cost route from the current location to the destination. One of major problems for navigation systems is that a significant amount of computation time is required when the digital road map is large. Since navigation systems are real time systems, it is critical that the path be computed while satisfying a time constraint. In this paper, we have developed a HiTi(Hierarchical MulTi) graph model for hierarchically structuring large digital road maps to speedup the minimum cost path computation. We propose a new shortest path algorithm named SPAH, which utilizes HiTi graph model of a digital road map for its computation. We prove that the shortest path computed by SPAH is the optimal. Our performance analysis of SPAH also showed that it significantly reduces the computation time over exiting methods. We present an in-depth experimental analysis of HiTi graph method by comparing it with other similar works.

• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.3
• /
• pp.178-184
• /
• 2016

This paper proposes a new path-finding scheme using viewpoint-invariant landmarks. The scheme introduces the concept of landmark detection in images captured with a vision sensor attached to a mobile robot, and provides landmark clues to determine a path. Experiment results show that the scheme efficiently detects landmarks with changes in scenes due to the robot's movement. The scheme accurately detects landmarks and reduces the overall landmark computation cost. The robot moves in the room to capture different images. It can efficiently detect landmarks in the room from different viewpoints of each scene. The outcome of the proposed scheme results in accurate and obstacle-free path estimation.

• Journal of the military operations research society of Korea
• /
• v.25 no.2
• /
• pp.73-83
• /
• 1999

In this paper, we consider the shortest path network problem with fixed charges. A turn penalty algorithm for the shortest path problem with fixed charges or turn penalties is presented, which is using the next node comparison method. The algorithm described here is designed to determine the shortest route in the shortest path network problem including turn penalties. Additionally, the way to simplify the computation for the shortest path problem with turn penalties was pursued.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• Electronics and Telecommunications Trends
• /
• v.31 no.5
• /
• pp.99-109
• /
• 2016

IETF Path Computation Element(PCE) 그룹에서는 데이터 전송을 위한 전달 경로를 찾는 엔진 기능을 중심으로 표준화를 진행하고 있다. 망의 상태, 위상, 자원 가용성, 정책을 기반으로 최적의 자원을 할당하는 경로 계산 기능과 구조, 프로토콜 등을 정의하는데 MPLS/GMPLS 망의 제어 평면 프로토콜 기반 전송을 위주로 출발하여 광, 회선 망에서의 적용과 서비스 표준이 실제 사례를 뒷받침하여 발전되었고 현재는 데이터 센터 네트워크, SDN, IoT 분야에서의 활용이 활발하게 논의되고 있다. 본고에서는 경로 계산 기능의 분산을 주요 목적으로 하여 이제는 범용의 전달망 관리 분야로 확대 적용되는 추세의 active stateful PCE와 Traffic Engineering Database (TED), Label Switched Path DB(LSP-DB), PCE Protocol(PCEP) 등을 포함한 관련 표준 현황을 살펴보고 향후 통합 전달망 제어 관리 진화 방향을 소개하고자 한다.

• The Journal of Korea Robotics Society
• /
• v.16 no.3
• /
• pp.250-259
• /
• 2021

Path planning is one of the important technologies for automated parking. It requires to plan a collision-free path considering the vehicle's kinematic constraints such as minimum turning radius or steering velocity. In a complex parking lot, Rapidly-exploring Random Tree^* (RRT^*) can be used for planning a parking path, and Reeds-Shepp or Hybrid Curvature can be applied as a tree-extension method to consider the vehicle's constraints. In this case, each of these methods may affect the computation time of planning the parking path, path-tracking error, and parking success rate. Therefore, in this study, we conduct comparative analysis of two tree-extension functions: Reeds-Shepp (RS) and Hybrid Curvature (HC), and show that HC is a more appropriate tree-extension function for parking path planning. The differences between the two functions are introduced, and their performances are compared by applying them with RRT^*. They are tested at various parking scenarios in simulation, and their advantages and disadvantages are discussed by computation time, cross-track error while tracking the path, parking success rate, and alignment error at the target parking spot. These results show that HC generates the parking path that an autonomous vehicle can track without collisions and HC allows the vehicle to park with lower alignment error than those of RS.