• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.5
• /
• pp.36-45
• /
• 2013

This paper developed a new shortest path searching algorithm based on Dijkstra's algorithm and $A^*$ algorithm, so it guarantees to find a shortest path in efficient manner. In this developed algorithm, minimum expected weights implies the value that straight line distance from a visiting node to the target node multiplied by minimum link unit, and this value can be the lowest weights between the two nodes. In behalf of the minimum expected weights, at each traversal step, developed algorithm in this paper is able to decide visiting a new node or retreating to the previously visited node, and results are guaranteed. Newly developed algorithm was tested in a real traffic network and found that the searching time of the algorithm was not as fast as other $A^*$ algorithms, however, it perfectly found a minimum path in any case. Therefore, this developed algorithm will be effective for the domain of searching in a large network such as RGV which operates in wide area.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.5
• /
• pp.38-45
• /
• 2012

Finding shortest paths on time dependent networks is an important task for scheduling and routing plan and real-time navigation system in ITS. In this research, one-to-one time dependent shortest path algorithms based on link flow speeds on urban networks are proposed. For this work, first we select three general shortest path algorithms such as Graph growth algorithm with two queues, Dijkstra's algorithm with approximate buckets and Dijkstra's algorithm with double buckets. These algorithms were developed to compute shortest distance paths from one node to all nodes in a network and have proven to be fast and efficient algorithms in real networks. These algorithms are extended to compute a time dependent shortest path from an origin node to a destination node in real urban networks. Three extended algorithms are implemented on a data set from real urban networks to test and evaluate three algorithms. A data set consists of 4 urban street networks for Anaheim, CA, Baltimore, MD, Chicago, IL, and Philadelphia, PA. Based on the computational results, among the three algorithms for TDSP, the extended Dijkstra's algorithm with double buckets is recommended to solve one-to-one time dependent shortest path for urban street networks.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.10a
• /
• pp.121-124
• /
• 1997

In this paper, applications of self-recurrent neural networks based of adaptive controller to position control of flexible robot link are considered. The self-recurrent neural networks can be used to approximate any continuous function to any desired degree of accuracy and the weights are updated by feedback-error learning algorithm. Therefore, a comparative analysis was mode with linear controller through an simulation. The results are presented to illustrate the advantages and improved performance of the proposed position tracking controller over the conventional linear controller.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.21 no.4
• /
• pp.343-350
• /
• 2016

Generally, the average phase current is sampled at the midpoint of a PWM signal for the vector control of an AC motor. The three-phase current can also be reconstructed from a DC-link shunt resistor by sampling the shunt voltage during the active vectors of the SVPWM. However, the reconstructed current is different from the average current because of the deviation of the sampling point from the midpoint of the PWM signal. This paper proposes an algorithm to estimate the average current from the reconstructed current in a single-shunt inverter. The proposed method is derived from the phase current slopes based on switching states and corresponding switching time. In addition, the proposed method is generalized for all the six sectors of the space vector hexagon. The validity of the proposed algorithm is verified with simulations and experiments.

• Journal of Advanced Navigation Technology
• /
• v.12 no.3
• /
• pp.233-238
• /
• 2008

Recently, network component become to follow wireless and mobile network from wired network proposed that many TCP algorithm optimized in variety environment. When TCP was created, however as it was design based on wired link, wireless link made more transmission error than wired link. Transmission errors are more frequent and may be incorrectly regarded as indications of network congestion. In this paper, it conduct how effect congestion control algorithm in Mobile ad-hoc network and compare traffic of TCP-Tahoe, TCP-Reno, TCP-New-Reno and TCP-Vegas in Mobile ad-hoc environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5B
• /
• pp.397-404
• /
• 2006

As an increase in recent optical network-based IP services, GMPLS management framework becomes more important than ever before. In this paper, we propose the dynamic GMPLS path management algorithm, which can satisfy the users with their traffic engineering recovery requirements and find out the best backup service path under multiple link failures. To be more specific, we are deriving the soluble conditions of a backup path which is satisfied in a GMPLS network. In addition, through proposing the fast backup path selection algorithm, we can sufficiently satisfy a user's recovery requirement and minimally protect the suspension of the service against a link failure.

• Journal of Power Electronics
• /
• v.16 no.3
• /
• pp.1012-1024
• /
• 2016

This study deals with an on-line software fault detection, localization, and system reconfiguration method for electrical system drives composed of three-phase AC/DC/AC converters and three-phase permanent magnet synchronous machine (PMSM) drives. Current sensor failure (outage), speed/position sensor loss (disconnection), and damaged DC-link voltage sensor are considered faults. The occurrence of these faults in PMSM drive systems degrades system performance and affects the safety, maintenance, and service continuity of the electrical system drives. The proposed method is based on the monitoring signals of "abc" currents, DC-link voltage, and rotor speed/position using a measurement chain. The listed signals are analyzed and evaluated with the generated residuals and threshold values obtained from a Sliding Mode Current-Speed-DC-link Voltage Observer (SMCSVO) to acquire an on-line fault decision. The novelty of the method is the faults diagnosis algorithm that combines the use of SMCSVO and adaptive thresholds; thus, the number of false alarms is reduced, and the reliability and robustness of the fault detection system are guaranteed. Furthermore, the proposed algorithm's performance is experimentally analyzed and tested in real time using a dSPACE DS 1104 digital signal processor board.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.8
• /
• pp.774-779
• /
• 2012

We design and implement a RTT (Round Trip Time) based TCP (Transmission Control Protocol) for USN (Ubiquitous Sensor Network). We adopt a basic update algorithm for window size from FAST TCP that uses the queuing delay at link as the congestion measure. The designed TCP estimates the queuing delay at link from the measured RTT in the network layer, and updates the window size based on the estimated queuing delay. The designed TCP allows to utilize the full capacity of USN links and avoids the waste of the given link capacity that is common without the flow control in the transport layer. The experiment results show that the window size of the sender converges within a small range of variations without any packet loss, and verify the stability and performance of the designed TCP.

• Journal of Korean Society for Geospatial Information Science
• /
• v.17 no.1
• /
• pp.61-69
• /
• 2009

By the advent of the high resolution satellite imagery, a ground-coverage included by a single satellite image is decreased. By the reason, there are increasing needs in image mosaicking technology to use images to various GIS fields. This paper describes an edge-based seamline extraction algorithm using edge information such as rivers, roads, buildings for image mosaicking. For this, we developed a method to track and link discontinuous edges extracted by edge detection operator. To estimate the effectiveness of the proposed algorithm, we applied the algorithm to IKONOS, KOMPSAT-1 and SPOT-5 satellite images. The experimental results showed that the algorithm successfully dealts with discontinuities caused by geometric differences in two images.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.657-667
• /
• 2012

In the MPR selection algorithm of Optimized Link State Routing (OLSR), each node selects own MPRs independently, so most of nodes are selected to MPR at least once. To cope with this problem, the MPR candidate selection algorithm was proposed. The MPR candidate selection algorithm can reduce the number of MPRs, but the efficiencies of route and connectivity decline due to decreased number of MPRs. So, in this paper, we propose the Significant Multi-Point Relay (S-MPR) selection algorithm which can enhance the performance of ad hoc network by improving the MPR selection algorithm of OLSR. In proposed S-MPR selection algorithm, each node selects the most important node to S-MPR to guarantee the connectivity then selects remaining MPRs in MPR candidates. So proposed S-MPR selection algorithm can reduce the overhead of many MPRs without decline of routing performance. To show the performance gain of proposed S-MPR selection algorithm, we simulate the proposed S-MPR selection algorithm by using OPNET.