• Journal of Korean Society of Transportation
• /
• v.22 no.2 s.73
• /
• pp.121-130
• /
• 2004

In these days, multiple-path generation method is highly demanded in practice and research areas, which can represents realistically travelers behavior in choosing possible alternative paths. The multiple-path generation algorithm is one of the key components for policy analysis related to ATIS, DRGS and ATMS in ITS. This study suggested a method to generate multiple Possible paths from an origin to a destination. The approach of the suggested method is different from an other existing methods(K-shortest path algorithm) such as link elimination approach, link penalty approach and simulation approach. The result of the multi-label vine-building shortest path algorithm(MVA) by Kim (1998) and Kim(2001) was used to generate multiple reasonable possible paths with the concept of the rational upper boundary. Because the MVA algorithm records the cost, back-node and back-back node of the minimum path from the origin to the concerned node(intersection) for each direction to the node, many potential possible paths can be generated by tracing back. Among such large number of the potential possible paths, the algorithm distinguishes reasonable alternative paths from the unrealistic potential possible paths by using the concept of the rational upper boundary. The study also shows the very simple network examples to help the concept of the suggested path generation algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.9
• /
• pp.1931-1938
• /
• 2012

A by-pass path in wireless sensor networks is the alternative path which be able to forward data when a routing path is being broken. One reason of depleting energy is occurred by the path. The method for solving prior to addressed the problem is proposed. However, this method may deplete radio resource. The best path has advantage that network lifetime of sensor nodes is prolonged; on the contrary, in order to maintain the best path it have to share their information between the entire nodes. In this paper, we propose the best path searching algorithm in the distributed three dimensional sensor networks. Through the neighboring informations sharing in the proposed method, the proposed algorithm can decide the best k-path as well as the extension of network lifetime.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2000.11a
• /
• pp.437-442
• /
• 2000

An alternative inverse feedback structure for adaptive active control of periodic noise is introduced for systems with nonminimum phase cancellation path. To obtain the inverse model of the nonminimum phase cancellation path, the cancellation path model can be factorized into a minimum phase term and a maximum phase term. The maximum phase term containing unstable zeros makes the inverse model unstable. To avoid the instability, we alter the inverse model of the maximum phase system into an anti-causal FIR one. An LMS predictor estimates the future samples of the noise, which are necessary for causality of both anti-causal FIR approximation for the stable inverse of the maximum phase system and time-delay existing in the cancellation path. The proposed method has a faster convergence behavior and a better transient response than the conventional FX-LMS algorithms with the same internal model control structure since a filtered reference signal is not required. We compare the proposed methods with the conventional methods through simulation studies.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.3
• /
• pp.587-595
• /
• 2015

A by-pass path in wireless sensor networks is the alternative path which be able to forward data when a routing path is being broken. One reason of depleting energy is occurred by the path. The method for solving prior to addressed the problem is proposed. However, this method may deplete radio resource. The best path has advantage that network lifetime of sensor nodes is prolonged; on the contrary, in order to maintain the best path it have to share their information between the entire nodes. In this paper, we propose the best path searching algorithm in the distributed three dimensional sensor networks. Through the neighboring informations sharing in the proposed method, the proposed algorithm can decide the best k-path as well as the extension of network lifetime.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.19 no.1
• /
• pp.42-49
• /
• 2009

In this paper, an alternative method was introduced to conduct a transfer path analysis for airborne noise. The method used the transfer function matrix composed of acoustic transfer functions that are referenced by the input voltage of a calibration source. A calibration factor which is converting a virtual voltage to source strength was deduced by vibro-acoustical reciprocity theorem. The calibration factor is then multiplied to the virtual input voltage to estimate the operational source strength. Three loudspeakers were used to noise sources of acrylic half car model. The method was applied to airborne noise transfer path analysis of the half car. The estimated source strength by transfer path analysis was compared the deduced source strength by vibro-acoustical reciprocity to verify the method.

• Journal of the Korean Society of Industry Convergence
• /
• v.4 no.3
• /
• pp.339-347
• /
• 2001

Automatic automobile has been studied as the alternative energy system and the production flow automation device recently. But this is dependent on the import production, and its position cannot be controlled free from the fixed path. It is difficult to control the automobile position because of the eccentricity of inertia monent, slip and roughness between wheel and road surface. This problems is solved for the controller to be feedbacked the data of the multi-sensor system consisting of the rotary encoder and electronic compass. The proportional Integrated controller in the modified Ziegler-Nichols method is made up with Hitachi 7034 microprocessor. To the real time control the mechanical, electrical and electronic hardware and software device is produced by myself. The RF data of automobile speed and position is supplied to the remote PC to be displayed the automobile condition. By the experinent of the forward, spin, point path planning, it is known for autombile.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.10a
• /
• pp.855-857
• /
• 2011

In this paper, we proposed EEAR(Efficient Energy Alternative Routing). This is a method of selecting a backup node for path routing management. When some node disconnection on the path routing, using pre-selected backup node provides immediately recover the path recovery. When selecting a Step-Parents node on the path management, the node' s energy level and distance information are cared in context-awareness. This not only increased the system' s capacity cost effectively, but also reduce transmission power entire nodes consume energy. As a result, each node could efficiently management and improves the life time for mobile host and extends system coverage.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.6
• /
• pp.711-718
• /
• 2019

BDD is a well-known alternative to the conventional Boolean logic method in fault tree analysis. As the size of fault tree increases, the calculation time and computer resources for BDD dramatically increase. A new failure path search and path restructure method is proposed for efficient calculation of CS and MCS from BDD. Failure path grouping and bottom-up path search is proved to be efficient in failure path search in BDD and path restructure is also proved to be used in order to reduce the number of CS comparisons for MCS extraction. With these newly proposed methods, the top event probability can be calculated using the probability by ASDMP(Approximate Sum of Disjoint MCS Products), which is shown to be equivalent to the result by the conventional MCUB(Minimal Cut Upper Bound) probability.

• Journal of Korean Society of Transportation
• /
• v.17 no.3
• /
• pp.73-85
• /
• 1999

In metropolitan area, intersections having turn Prohibitions are often found and it is important to consider them in path planning. This Paper presents a new path planning method road networks having turn prohibitions. A new road network model is proposed in which an alter-native route for each turn-Prohibition is constructed in off-line using U-turn or P-turn and then Put into road network database. The proposed network model is efficient since it requires no virtual nodes that are usually used in the conventional road networks to represent turns at intersections. In order to find a shortest path with the proposed network, a new shortest path algorithm is proposed. A knot for the turn-Prohibited node is newly defined and is used in comparing the cost of the alternative route with that of the other path.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.7
• /
• pp.1525-1530
• /
• 2014

In this research, we describe teaching based sweeping control for grinder robot has been proposed as a system which is suitable to work utilizing pressure sensitive alternative to human. Teaching method is used for grinder robots operations because of their position accuracy, path accuracy, and machining reaction force. A grinder robot for two-dimensional iron plate was developed on the basis of an force sensor based teaching method. An automatic-path-generation method and experimental results using specific points was adopted to reduce the number of teaching points and time. And also, in order to determine the proper machining conditions, various machining conditions such as grinder-wheel rotation speed and robot moving speed, were evaluated.