• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3150-3170
• /
• 2016

In Intelligent Transportation Systems (ITS), logistics distribution and mobile e-commerce, the real-time, accurate and reliable vehicle trajectory prediction has significant application value. Vehicle trajectory prediction can not only provide accurate location-based services, but also can monitor and predict traffic situation in advance, and then further recommend the optimal route for users. In this paper, firstly, we mine the double layers of hidden states of vehicle historical trajectories, and then determine the parameters of HMM (hidden Markov model) by historical data. Secondly, we adopt Viterbi algorithm to seek the double layers hidden states sequences corresponding to the just driven trajectory. Finally, we propose a new algorithm (DHMTP) for vehicle trajectory prediction based on the hidden Markov model of double layers hidden states, and predict the nearest neighbor unit of location information of the next k stages. The experimental results demonstrate that the prediction accuracy of the proposed algorithm is increased by 18.3% compared with TPMO algorithm and increased by 23.1% compared with Naive algorithm in aspect of predicting the next k phases' trajectories, especially when traffic flow is greater, such as this time from weekday morning to evening. Moreover, the time performance of DHMTP algorithm is also clearly improved compared with TPMO algorithm.

• Journal of Korean Society of Transportation
• /
• v.18 no.1
• /
• pp.87-97
• /
• 2000

Signal optimization model is divided bandwidth-maximizing model and delay-minimizing model. Bandwidth-maximizing model express model formulation as MILP(Mixed Integer Linear Programming) and delay-minimizing model like TRANSYT-7F use "hill climbing" a1gorithm to optimize signal times. This study Proposed optimization model using genetic algorithm one of evolution algorithm breaking from existing optimization model This Proposed model were tested by several scenarios and evaluated through NETSIM with TRANSYT-7F\`s outputs. The result showed capability that can obtain superior solution.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2002.05d
• /
• pp.901-906
• /
• 2002

This paper is a research about method, that is used in Rapid Prototyping system, that inserts and extracts watermark in STL(standard transform language) that has a 3D geometrical model. The proposed algorithm inserts watermark in the vertex domain of STL facet without the distortion of 3D model. If we make use of a established algorithm for watermarking of STL, a watermark inserted to 3D model can be removed by simple attack that change order of facet. The proposed algorithm has robustness about these attack. Experiment results verify that the proposed algorithm, to encode and decode watermark in STL 3D geometrical model, doesn't distort a 3D model at all. And it shows that the proposed algorithm is available.

• Journal of Korean Society for Quality Management
• /
• v.16 no.1
• /
• pp.78-87
• /
• 1988

The purpose of this study is to develop the algorithm applicable to the integrated production inventory model under quantity discount. To achieve this purpose, the integrated production inventory model which unifies the inventory problem of raw materials and the finished product for a single product manufacturing system is considered. The product is manufactured in batches and the raw materials are obtained from outside suppliers but some of the raw materials are discounted according to the purchasing quantity. The intergrated production inventory problem considered in this study is formulated by the non-linear mixed integer programming model, and the optimal solution is obtained by using the algorithm developed by Goyal. Then, the algorithm developed by this study is applied to the quantity discount problem, and the optimal solution is revised by this results. The quantity discount algorithm of the integrated production inventory model developed by this study gives a systematic procedure to obtain the optimum policy to minimize the total cost in any case. The numerical example involving 20 raw materials and 5 raw materials among them are discounted according to the purchasing quantity is given to verify the mathematical model and the algorithm developed in this study.

• International Journal of Highway Engineering
• /
• v.18 no.1
• /
• pp.91-97
• /
• 2016

PURPOSES : The objective of this paper is to develop a pavement performance model based on the Bayesian algorithm, and compare the measured and predicted performance data. METHODS : In this paper, several pavement types such as SMA (stone mastic asphalt), PSMA (polymer-modified stone mastic asphalt), PMA (polymer-modified asphalt), SBS (styrene-butadiene-styrene) modified asphalt, and DGA (dense-graded asphalt) are modeled in terms of the performance evaluation of pavement structures, using the Bayesian algorithm. RESULTS : From case studies related to the performance model development, the statistical parameters of the mean value and standard deviation can be obtained through the Bayesian algorithm, using the initial performance data of two different pavement cases. Furthermore, an accurate performance model can be developed, based on the comparison between the measured and predicted performance data. CONCLUSIONS : Based on the results of the case studies, it is concluded that the determined coefficients of the nonlinear performance models can be used to accurately predict the long-term performance behaviors of DGA and modified asphalt concrete pavements. In addition, the developed models were evaluated through comparison studies between the initial measurement and prediction data, as well as between the final measurement and prediction data. In the model development, the initial measured data were used.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.3
• /
• pp.375-381
• /
• 2005

Usually genetic algorithms are used to design optimal system. However the performance of the algorithm is determined by the fitness function and the system environment. It is expected that a co-evolutionary algorithm, two populations are constantly interact and co-evolve, is one of the solution to overcome these problems. In this paper we propose three types of co-evolutionary algorithm to solve GA-Hard problem. The first model is a competitive co-evolutionary algorithm that solution and environment are competitively co-evolve. This model can prevent the solution from falling in local optima because the environment are also evolve according to the evolution of the solution. The second algorithm is schema co-evolutionary algorithm that has host population and parasite (schema) population. Schema population supply good schema to host population in this algorithm. The third is game model-based co-evolutionary algorithm that two populations are co-evolve through game. Each algorithm is applied to visual servoing, robot navigation, and multi-objective optimization problem to verify the effectiveness of the proposed algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.05a
• /
• pp.633-637
• /
• 2001

In this paper, we proposed model creation algorithm for multiple moving objects tracking. The proposed algorithm is divided that the initial model creation step as moving objects are entered into background image and the model reformation step in the moving objects tracking step. In the initial model creation step, the initial model is created by AND operating division image, divided using difference image and clustering method, and edge image of the current image. In the model reformation step, a new model was reformed in the every frame to adapt appearance change of moving objects using Hausdorff Distance and 2D-Logarithmic searching algorithm. We simulated for driving cart in the road. In the result, model was created over 98% in case of irregular approach direction of cars and tracking objects number.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.23 no.2
• /
• pp.63-68
• /
• 2015

This paper presents the algorithm for envelope protection of helicopters. The algorithm consists of two feedback control loops: inner loop and outer loop. As an inner loop control, model following control is designed to meet the ADS-33 handling qualities specification by minimizing the tracking errors between the responses of the actual model and those of the command filter. In order to implement envelope protection, saturation limiter is imposed to command channels in command filter, whose limits are computed corresponding to the envelope limit. Fast model predictive control is designed as an outer loop control to deal with saturation constraints generated by the inner loop envelope protection and also imposed by outer loop envelope protection variables. Simulation results show that the proposed algorithm yields good envelope protection performance.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2001.03a
• /
• pp.379-386
• /
• 2001

Piled raft foundations are usually used to reduce total and differential settlements of superstructures. In the piled raft foundations, the raft is often on its own able to provide adequate bearing capacity and only few widely spaced piles are added to the foundation to keep settlements be1ow a certain limit. In this paper, experimental studies on the load sharing ratio between piles and raft are carried out. Also, for evaluating the application of optimum design technique using a genetic algorithm, optimal locations of files are compared with the results of laboratory model tests. from tile results of laboratory model tests, there are found that the load sharing ratio between files and raft is depended on the number of piles and stiffness of raft, and the optimal locations of piles became concentrated on the middle of rafts. From these results of laboratory model tests, the optimum technique using a genetic algorithm is acknowledged to the application in the piled raft.

• Proceedings of the KIEE Conference
• /
• 2002.07d
• /
• pp.2382-2384
• /
• 2002

The accuracy in maneuvering target tracking using multiple models is caused by the suitability of each target motion model to be used. The interacting multiple model (IMM) algorithm and the adaptive IMM (AIMM) algorithm require the predefined sub-models and the predetermined acceleration intervals, respectively, in consideration of the properties of maneuvers in order to construct multiple models. In this paper, to solve these problems intelligently, a genetic algorithm (GA) based-IMM method using fuzzy logic is proposed. In the proposed method, the acceleration input is regarded as an additive noise and a sub-model is represented as a set of fuzzy rules to model the time-varying variances of the process noises of a new piecewise constant white acceleration model. The proposed method is compared with the AIMM algorithm in simulations.