• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.1
• /
• pp.76-84
• /
• 2003

Now days, It is based on GIS and GPS, it can search for the shortest path and estimation of arrival time by using the internet and cell phone to driver. But, even though good car navigation system does not create which is the shortest path when there average vehicle speed is 10 -20 Km. Therefore In order to reduce vehicle waiting time and average vehicle speed, we suggest optimal green time algorithm using fuzzy adaptive control, where there are different traffic intersection length and lane. In this paper, it will be able to forecast the optimal traffic information, estimation of destination arrival time, under construction road, and dangerous road using internet.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.20 no.10
• /
• pp.3160-3172
• /
• 1996

A search algorithm for the collision free, time optimal transport path of overhead cranes has been proposed in this paper. The map for the working environment of overhead cranes was constructed in the form of three dimensional grid. The obstacle occupied region and unoccupied region of the map has been represented using the octree model. The best-first search method with a suitable estimation function was applied to select the knot points on the collision free transport path to the octree model. The optimization technique, minimizing the travel time required for transporting objects to the goal while subjected to the dynamic constraints of the crane system, was developed to find the smooth time optimal path in the form of cubic spline functions which interpolate the selected knot points. Several simulation results showed that the selected estimation function worked effectively insearching the knot points on the collision free transport path and that the resulting transport path was time optimal path while satisfying the dynamic constraints of the crane system.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.25 no.10
• /
• pp.677-684
• /
• 2015

It is often necessary to predict the vibration patterns of the structures from the signals of finite number of vibration sensors. This study presents the optimal placement of vibration sensors by applying the genetic algorithm and the modal expansion method. The modal expansion method is used to estimate the vibration response of the whole structure. The genetic algorithm is used to estimate the optimal placement of vibration sensors. Optimal sensor placement can be obtained so that the fitness function is minimized in the genetic algorithm. This paper discusses the comparison of the performances of two types of fitness functions, modal assurance criteria(MAC) and condition number( CN). As a result, the estimation using MAC shows better performance than using CN.

• Smart Structures and Systems
• /
• v.30 no.6
• /
• pp.583-599
• /
• 2022

In this paper, a multi-objective wireless sensor network configuration optimization method is proposed. The proposed method aims to determine the optimal information and lifespan wireless sensor network for structural health monitoring of large-scale infrastructures. In particular, cluster-based wireless sensor networks with multi-type of sensors are considered. To optimize the lifetime of the wireless sensor network, a cluster-based network optimization algorithm that optimizes the arrangement of cluster heads and base station is developed. On the other hand, based on the Bayesian inference, the uncertainty of the estimated parameters can be quantified. The coefficient of variance of the estimated parameters can be obtained, which is utilized as a holistic measure to evaluate the estimation accuracy of sensor configurations with multi-type of sensors. The proposed method provides the optimal wireless sensor network configuration that satisfies the required estimation accuracy with the longest lifetime. The proposed method is illustrated by designing the optimal wireless sensor network configuration of a cable-stayed bridge and a space truss.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2023.05a
• /
• pp.25-25
• /
• 2023

The ensemble optimal interpolation (EnOI) scheme is a sub-optimal alternative to the ensemble Kalman filter (EnKF) with a reduced computational demand making it potentially more suitable for operational applications. Since only one model is integrated forward instead of an ensemble of model realizations, online estimation of the background error covariance matrix is not possible in the EnOI scheme. In this study, we investigate two Gaussian noise based ensemble generation strategies to produce dynamic covariance matrices for assimilation of water level observations into a distributed hydrological model. In the first approach, spatially correlated noise, sampled from a normal distribution with a fixed fractional error parameter (which controls its standard deviation), is added to the model forecast state vector to prepare the ensembles. In the second method, we use an adaptive error estimation technique based on the innovation diagnostics to estimate this error parameter within the assimilation framework. The results from a real and a set of synthetic experiments indicate that the EnOI scheme can provide better results when an optimal EnKF is not identified, but performs worse than the ensemble filter when the true error characteristics are known. Furthermore, while the adaptive approach is able to reduce the sensitivity to the fractional error parameter affecting the first (non-adaptive) approach, results are usually worse at ungauged locations with the former.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.4
• /
• pp.765-772
• /
• 2011

In this paper, a simulation-based method is presented to dispose direction finders in three dimensional space for locating targets using the directional data. A direction finder(DF) is a military weapon that is used to find locations of targets that emit radio frequencies by operating two or more DFs simultaneously. If one or more DFs are operated in the air, the accuracy of location estimation can be enhanced by disposing them in a better configuration. By extending the line method, which is a well-known algorithm for 2-D location estimation, into 3-D space, the problem of 3-D location estimation is defined as an nonlinear programming form and solved analytically. Then the optimal disposition of DFs is considered with the presented method in which methods of simulation and search technique are combined. With the suggested algorithm for 3-D disposition of DFs, regions in which targets exist can be effectively covered so that the operation effect of DF be increased.

• Journal of the Institute of Convergence Signal Processing
• /
• v.19 no.4
• /
• pp.199-205
• /
• 2018

So many fast motion estimation algorithms for prediction quality and computational reduction have been published due to tremendous computations of full search algorithm. In the paper, we suggest an algorithm that reduces computation effectively, while keeping prediction quality as almost same as that of the full search. The proposed algorithm based on multiple threshold filter calculates the sum of partial block matching error for each candidate, selects the candidates for the next step, compares the stability of optimal candidates with minimum error, removes impossible candidates, and calculates optimal motion vectors by determining the progress of the next step. By doing that, we can find the minimum error point as soon as possible and obtain the better performance of calculation speed by reducing unnecessary computations. The proposed algorithm can be combined with conventional fast motion estimation algorithms as well as by itself, further reduce computation while keeping the prediction quality as almost same as the algorithms, and prove it in the experimental results.

• Proceedings of the KOR-KST Conference
• /
• 1999.10a
• /
• pp.440-445
• /
• 1999

• 한국관개배수회지
• /
• no.53
• /
• pp.60-66
• /
• 2014

• Proceedings of the Korea Water Resources Association Conference
• /
• 2001.05b
• /
• pp.757-762
• /
• 2001