• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2042-2047
• /
• 2005

Many service robots which is interacting with human at home and in buildings have been developed. Few of them are shown in of the United States and of Japan. These robots are supposed to have a powerful indoor navigation performance in places where human beings live and work. The overall capability of service robots to move around in this environment is called environment correspondence, in which localization problem to find the accurate position and orientation is the most critical problem. While users set up a proper or a best environment for industrial robots, but for services robots at home and in buildings, it is very difficult to change the environment for robots. The expanded workspace due to mobility is difficult to be covered by means of those used for industrial robots because the cost increases and human beings do not want their environment to be changed for robots. This fact has made many researchers study efficient and effective environment correspondence problems. Among these problems, localization is the most difficult. Goal of localization study includes (1) Accurate detection of position and orientation (2) Minimum cost of the additional devices (3) Minimum change of human environment. In this study, as a solution of the above, we propose "Artificial Stars" which are attached on room ceiling as landmarks. In addition, we solve an adoption problem raised when a robot is delivered to a customer site and before it can perform its full navigation capability. We call this as "Initialization Problem" of service robots. We solve the initialization problem for both cases of environment with the map and without map. The proposed system is experimented and has shown how well it handles the initialization problem.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.8
• /
• pp.804-809
• /
• 2007

Initialization problem is defined for indoor mobile robot as a whole process from arrival to normal operation in a new environment. The unstructured environment make the process much more difficult compared to industrial robot in structured environments. We propose a simple and efficient initialization process based on artificial stars on ceiling. Important task points and paths connecting task points are defined based on the corresponding artificial stars. This approach can be used for all kinds of indoor mobile robots with landmarks used for indoor localization.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.5
• /
• pp.540-548
• /
• 2012

The Weapon Target Allocation(WTA) problem is the NP-Complete problem. The WTA problem is that the threatful air targets are assigned by weapon of allies for killing the targets. A good solution of NP-complete problem is heuristic algorithms. Genetic algorithms are commonly used heuristic for global optimization, and it is good solution on the diverse problem domain. But there has been very little research done on the generation of their initial population. The initialization of population is one of the GA step, and it decide to initial value of individuals. In this paper, we propose to the population initialization method to improve a Genetic Algorithm. When it initializes population, the proposed algorithm reflects the characteristics of the WTA problem domain, and inherits the dominant gene. In addition, the search space widely spread in the problem space to find efficiently the good quality solution. In this paper, the proposed algorithm to verify performance examine that an analysis of various properties and the experimental results by analyzing the performance compare to other algorithms. The proposed algorithm compared to the other initialization methods and a general genetic algorithm. As a result, the proposed algorithm showed better performance in WTA problem than the other algorithms. In particular, the proposed algorithm is a good way to apply to the variety of situation WTA problem domain, because the proposed algorithm can be applied flexibly to WTA problem by the adjustment of RMI.

• Journal of Communications and Networks
• /
• v.5 no.2
• /
• pp.157-166
• /
• 2003

This paper deals with the problem of channel identification for Single Input Multiple Output (SIMO) slow fading channels using clustering algorithms. Due to the intrinsic memory of the discrete-time model of the channel, over short observation periods, the received data vectors of the SIMO model are spread in clusters because of the AWGN noise. Each cluster is practically centered around the ideal channel output labels without noise and the noisy received vectors are distributed according to a multivariate Gaussian distribution. Starting from the Markov SIMO channel model, simultaneous maximum ikelihood estimation of the input vector and the channel coefficients reduce to one of obtaining the values of this pair that minimizes the sum of the Euclidean norms between the received and the estimated output vectors. Viterbi algorithm can be used for this purpose provided the trellis diagram of the Markov model can be labeled with the noiseless channel outputs. The problem of identification of the ideal channel outputs, which is the focus of this paper, is then equivalent to designing a Vector Quantizer (VQ) from a training set corresponding to the observed noisy channel outputs. The Linde-Buzo-Gray (LBG)-type clustering algorithms [1] could be used to obtain the noiseless channel output labels from the noisy received vectors. One problem with the use of such algorithms for blind time-varying channel identification is the codebook initialization. This paper looks at two critical issues with regards to the use of VQ for channel identification. The first has to deal with the applicability of this technique in general; we present theoretical results for the conditions under which the technique may be applicable. The second aims at overcoming the codebook initialization problem by proposing a novel approach which attempts to make the first phase of the channel estimation faster than the classical codebook initialization methods. Sample simulation results are provided confirming the effectiveness of the proposed initialization technique.

• International journal of advanced smart convergence
• /
• v.8 no.2
• /
• pp.132-139
• /
• 2019

We address the problem about forecasting the direction of stock price movement in the Korea market. Recently, the deep neural network is popularly applied in this area of research. In deep neural network systems, proper parameter initialization reduces training time and improves the performance of the model. Therefore, in our study, we propose a novel parameter initialization technique and apply this technique for the stock price movement prediction model. Specifically, we design a framework which consists of two models: a base model and a main prediction model. The base model constructed with LSTM is trained by using the large data which is generated by a large amount of the stock data to achieve optimal parameters. The main prediction model with the same architecture as the base model uses the optimal parameter initialization. Thus, the main prediction model is trained by only using the data of the given stock. Moreover, the stock price movements can be affected by other related information in the stock market. For this reason, we conducted our research with two types of inputs. The first type is the stock features, and the second type is a combination of the stock features and the Korea Composite Stock Price Index (KOSPI) features. Empirical results conducted on the top five stocks in the KOSPI list in terms of market capitalization indicate that our approaches achieve better predictive accuracy and F1-score comparing to other baseline models.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.3
• /
• pp.622-627
• /
• 2006

TSP(Traveling Salesman Problem) is a problem finding out the shortest distance out of many courses where given cities of the number of N, one starts a certain city and turns back to a starting city, visiting every city only once. As the number of cities having visited increases, the calculation rate increases geometrically. This problem makes TSP classified in NP-Hard Problem and genetic algorithm is used representatively. To obtain a better result in TSP, various operators have been developed and studied. This paper suggests new method of population initialization and of sequential transformation, and then proves the improvement of capability by comparing them with existing methods.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.887-890
• /
• 1998

We present a method for initialization of asynchronous circuits using binary decision space representation. From state transition graph(STG) which is given as a specification a circuit, the BDD is generated to solve the state space explosion problem which is caused by concurrecy of STG. We first step, we construct the necessary informaton as a form of K-map from BDD, then find an initial state on the K-map by assignment of don't care assignment.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.752-757
• /
• 2003

Recently, 3D structure recovery through self-calibration of camera has been actively researched. Traditional calibration algorithm requires known 3D coordinates of the control points while self-calibration only requires the corresponding points of images, thus it has more flexibility in real application. In general, self-calibration algorithm results in the nonlinear optimization problem using constraints from the intrinsic parameters of the camera. Thus, it requires initial value for the nonlinear minimization. Traditional approaches get the initial values assuming they have the same intrinsic parameters while they are dealing with the situation where the intrinsic parameters of the camera may change. In this paper, we propose new initialization method using the minimum 2 images. Proposed method is based on the assumption that the least violation of the camera’s intrinsic parameter gives more stable initial value. Synthetic and real experiment shows this result.

• ETRI Journal
• /
• v.26 no.2
• /
• pp.92-100
• /
• 2004

In this paper, we propose an efficient method to broadcast digital television signals using single frequency networks (SFNs) within the Advanced Television Systems Committee (ATSC) transmission systems. In implementing the SFNs of an 8-vestigial side band (8-VSB) Digital Television (DTV) system, the ambiguity problem of the trellis coder is unavoidable in a conventional ATSC transmission system. We propose a memory initialization of the trellis coder to resolve this ambiguity problem. Since the proposed scheme to synchronize multiple transmitters minimizes the changes from the conventional ATSC system, the hardware complexity for these changes is very low. Our simulation results show that the proposed scheme makes a less than 0.1 dB degradation at the threshold of visibility with a bit error rate of $3{\times}10^{-6}$ in the additive white Gaussian noise (AWGN) channel. It is possible to reduce the performance degradation by increasing the initialization period of the proposed scheme.

• Smart Media Journal
• /
• v.11 no.11
• /
• pp.84-91
• /
• 2022

Baseboard Management Controller(BMC) supports server monitoring, maintenance, and control functions using various communication interfaces. However, if an unexpected problem occurs during the device driver initialization process, the BMC may not operate normally. Therefore, a boot process profiling tool that accurately analyzes the device driver initialization process and provides a function to check the analysis result is essential. Existing boot process profiling tools do not specifically provide the device driver initialization process and results required for BMC boot process analysis, forcing developers to use a combination of tools to analyze the boot process in detail. In this paper, we propose an integrated profiling tool for BMC's booting process. The proposed tool provides device driver initialization process analysis, CPU and memory usage analysis, and kernel version management functions. Users can easily analyze the booting process using the proposed tool, and the analysis result can be used to shorten the booting time. Also, the proposed tool is implemented in Linux-based BMC, and it is shown that the proposed tool is more efficient than the existing profiling tool.