• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.10
• /
• pp.1879-1885
• /
• 2017

This paper discusses the trajectory tracking system of unmanned ground vehicles based on predictive control. Because the unmanned ground vehicles can not satisfactorily complete the path tracking task, highly efficient and stable trajectory control system is necessary for unmanned ground vehicle to be realized intelligent and practical. According to the characteristics of unmanned vehicle, this paper built the kinematics tracking models firstly. Then studied algorithm solution with the tools of the optimal stability analysis method and proposed a tracking control method based on the model predictive control. The controller used a kinematics-based prediction model to calculate the predictive error. This controller helps the unmanned vehicle drive along the target trajectory quickly and accurately. The designed control strategy has the true robustness, simplicity as well as generality for kinematics model of the unmanned vehicle. Furthermore, the computer Simulink/Carsim results verified the validity of the proposed control method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4268-4290
• /
• 2015

Future mobile communications face enormous challenges as traditional voice services are replaced with increasing mobile multimedia and data services. To address the vast data traffic volume and the requirement of user Quality of Experience (QoE) in the next generation mobile networks, it is imperative to develop efficient content distribution technique, aiming at significantly reducing redundant data transmissions and improving content delivery performance. On the other hand, in recent years cloud computing as a promising new content-centric paradigm is exploited to fulfil the multimedia requirements by provisioning data and computing resources on demand. In this paper, we propose a cooperative caching framework which implements State based Content Distribution (SCD) algorithm for future mobile networks. In our proposed framework, cloud service providers deploy a plurality of cloudlets in the network forming a Distributed Cloud Service Network (DCSN), and pre-allocate content services in local cloudlets to avoid redundant content transmissions. We use content popularity and content state which is determined by content requests, editorial updates and new arrivals to formulate a content distribution optimization model. Data contents are deployed in local cloudlets according to the optimal solution to achieve the lowest average content delivery latency. We use simulation experiments to validate the effectiveness of our proposed framework. Numerical results show that the proposed framework can significantly improve content cache hit rate, reduce content delivery latency and outbound traffic volume in comparison with known existing caching strategies.

• Journal of Korean Society of Transportation
• /
• v.26 no.6
• /
• pp.123-132
• /
• 2008

Dynamic origin-destination (OD) trip matrix has been widely used for transportation fields such as dynamic traffic assignment, traffic operation and travel demand management, which needs precise OD trip matrix to be collected. This paper presents a quasi-dynamic OD matrix estimation model and applies it to real road network for collecting the dynamic OD matrix. The estimation model combined with dynamic traffic assignment program, DYNASMART-P, is based on GPS embedded in PDA, which developed for collecting sample dynamic OD matrix. The sample OD matrix should be expanded by the value of optimal sampling ratio calculated from minimization program. From application to real network of Jeju, we confirm that the model and its algorithm produce a reasonable solution.

• Journal of Korean Society of Transportation
• /
• v.31 no.2
• /
• pp.80-89
• /
• 2013

The purpose of this research is to optimize the line planning of the intercity passenger railway. In this study, the line planning problem has been formulated into a mixed integer programming by minimizing both user costs (passenger's total travel time) and operator costs (operation, maintenance and vehicle costs) with multiple train types. As a solution algorithm, the branch-and-bound method is used to solve this problem. The change of travel demand, train speed and the number of schedules have been tested through sensitivity analysis. The optimal stop-schedules and frequency as well as system split with respect to each train type have been found in the case study of Kyoung-bu railway line in Korea. The model and results of this research are useful to make a decision for railway operation strategy, to analyze the efficiency of new railway systems and to evaluate the social costs of users and operators.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.5
• /
• pp.925-938
• /
• 2010

Depending on network conditions, a communication network could be overloaded when media are transmitted. Research has been carried out to lessen network overloading, such as by filtering, load distribution, frame dropping, and other methods. Among these methods, one of the most effective is frame dropping, which reduces specified video frames for bandwidth diminution. In frame dropping, B-frames are dropped and then I- and P-frames are dropped, based on the dependency among the frames. This paper proposes a scheme for protecting copyrights by encryption, when frame dropping is applied to reduce the bandwidth of media based on the MPEG-4 file format. We designed two kinds of frame dropping: the first stores and then sends the dropped files and the other drops frames in real time when transmitting. We designed three kinds of encryption methods using the DES algorithm to encrypt MPEG-4 data: macro block encryption in I-VOP, macro block and motion vector encryption in P-VOP, and macro block and motion vector encryption in I-, P-VOP. Based on these three methods, we implemented a digital rights management solution for MPEG-4 data streaming. We compared the results of dropping, encryption, decryption, and the quality of the video sequences to select an optimal method, and found that there was no noticeable difference between the video sequences recovered after frame dropping and the ones recovered without frame dropping. The best performance in the encryption and decryption of frames was obtained when we applied the macro block and motion vector encryption in I-, P-VOP.

• Journal of KIISE:Software and Applications
• /
• v.32 no.11
• /
• pp.1071-1083
• /
• 2005

By estimating probability distributions of the good solutions in the current population, some researchers try to find the optimal solution more efficiently. Particularly, finite mixtures of distributions have a very useful role in dealing with complex problems. However, it is difficult to choose the number of components in the mixture models and merge superior partial solutions represented by each component. In this paper, we propose a new continuous evolutionary optimization algorithm with distribution estimation by variational Bayesian mixtures of factor analyzers. This technique can estimate the number of mixtures automatically and combine good sub-solutions by sampling new individuals with the latent variables. In a comparison with two probabilistic model-based evolutionary algorithms, the proposed scheme achieves superior performance on the traditional benchmark function optimization. We also successfully estimate the parameters of S-system for the dynamic modeling of biochemical networks.

• International Journal of Aeronautical and Space Sciences
• /
• v.14 no.4
• /
• pp.297-309
• /
• 2013

Design optimization is a mathematical process to find an optimal solution through the use of formal optimization algorithms. Design plays a vital role in the engineering field; therefore, using design tools in education and research is becoming more and more important. Recently, numerical design optimization in fluid mechanics, which uses computational fluid dynamics (CFD), has numerous applications in the engineering field, because of the rapid development of high-performance computing resources. However, it is difficult to find design optimization software and contents for educational purposes in aerospace engineering. In the present study, we have developed an aerodynamic design framework specifically for an airfoil, based on the EDucation-research Integration through Simulation On the Net (EDISON) portal. The airfoil design framework is composed of three subparts: a geometry kernel, CFD flow analysis, and an optimization algorithm. Through a seamless interface among the subparts, an iterative design process is conducted. In addition, the CFD flow analysis and the design framework are provided through a web-based portal system, while the computation is taken care of by a supercomputing facility. In addition to the software development, educational contents are developed for lectures associated with design optimization in aerospace and mechanical engineering education programs. The software and content developed in this study is expected to be used as a tool for e-learning material, for education and research in universities.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.5
• /
• pp.64-73
• /
• 2011

The problem of Euclidean minimum spanning tree (EMST) is to connect given nodes in a plane with minimum cost. There are many algorithms for the polynomial time problem as EMST. However, for numerous nodes, the algorithms consume an enormous amount of time to find an optimal solution. In this paper, an approximation scheme using a polynomial time approximation scheme (PTAS) algorithm with dividing and parallel processing for the problem is suggested. This scheme enables to construct a large, approximate EMST within a short duration. Although initially devised for the non-polynomial problem, we employ naive PTAS to construct a vast EMST with dynamic programming. In an experiment, the approximate EMST constructed by the proposed scheme with 15,000 input terminal nodes and 16 partition cells shows 89% and 99% saving in execution time for the serial processing and parallel processing methods, respectively. Therefore, our scheme can be applied to obtain an approximate EMST quickly for numerous input terminal nodes.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.3
• /
• pp.671-680
• /
• 1998

Network services, such as teleconferencing, remote diagnostics and education, and CSCW require multicasting. Multicast routing methods can be divided into two categories. One is the shortest path tree method and the other is the minimal Steiner tree method. The latter has an advantage over the former in that only one Steiner tree is needed for a group. However, finding a minimal Steiner tree is an NP-complete problem and it is necessary to find an efficient heuristic algorithm. In this paper, we present an evolutionary optimization method for finding minimal Steiner trees without sacrificing too much computational efforts. In particular, we describe a tree-based genetic encoding scheme which is in sharp constast with binary string representations usually adopted in convetional genetic algorithms. Experiments have been performed to show that the presented method can find optimal Steiner trees for given vetwork configurations. Comparitivie studies have shown that the evolutionary method finds on average a better solution than other conventional heustric algorithms.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.12
• /
• pp.1905-1912
• /
• 2017

In recent years, Ulaanbaatar, a capital of Mongolia has witnessed major problem that air quality reaches hazardous level during the winter season. Coal combustion for heating of every house in "Ger" district is main reason. One way to reduce the air pollution is mass usage of electric heater. However, there are several difficulties such as overload and degradation of transformers and other equipment used in distribution and transmission systems as well as power shortage occurrence in evening peak period due to residential consumption. This study aims to contribute for solving the air pollution and power shortage problem in Mongolia. One possible solution could be distributed generation (DG) with photovoltaic (PV) penetration. In this study, PV with energy storage (ES) hybrid system to reduce peak load is analyzed. We proposed the suitable structure of PV-ES hybrid for Mongolian household, and suggested several operation scenarios. Optimal operation algorithm is carried out based on a comparison aspect from economical, grid impact and PV penetration possibility. The economic analyse shows annual income of 520USD, and has a payback period of 8 years for selected scenario. The proposed PV-ES system structure is verified by experimentation set on the building rooftop in city center. The suggested scenario is planned to apply for system in further research.