• Smart Structures and Systems
• /
• v.6 no.1
• /
• pp.39-56
• /
• 2010

Structural Control relies, with a great deal, on the ability of the control algorithm to identify the current state of the system, at any given point in time. When such algorithms are designed to perform in a smart manner, several smart technologies/devices are called upon to perform tasks that involve pattern recognition and control. Smart pattern recognition is proposed to replace/enhance traditional state identification techniques, which require the extensive manipulation of intricate mathematical equations. Smart pattern recognition techniques attempt to emulate the behavior of the human brain when performing abstract pattern identification. Since these techniques are largely heuristic in nature, it is reasonable to ensure their reliability under real life situations. In this paper, a neural network pattern recognition scheme is explored. The pattern identification of three structural systems is considered. The first is a single bay three-story frame. Both the second and the third models are variations on benchmark problems, previously published for control strategy evaluation purposes. A Neural Network was developed and trained to identify the deformed shape of structural systems under earthquake excitation. The network was trained, for each individual model system, then tested under the effect of a different set of earthquake records. The proposed smart pattern identification scheme is considered an integral component of a Smart Structural System. The Reliability assessment of such component represents an important stage in the evaluation of an overall reliability measure of Smart Structural Systems. Several studies are currently underway aiming at the identification of a reliability measure for such smart pattern recognition technique.

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

A potential field method for solving the problem of path planning based on global and local information for a mobile robot moving among a set of stationary obstacles is described. The concept of various method used path planning is used design a planning strategy. A real human living area is constructed by many moving and imminence obstacles. Home service mobile robot must avoid many obstacles instantly. A path that safe and attraction towards the goal is chosen. The potential function depends on distance from the goal and heuristic function relies on surrounding environments. Three additional combined methods are proposed to apply to human living area, calibration robots position by measured surrounding environment and adapted home service robots. In this work, we proposed the application of various path planning theory to real area, human living. First, we consider potential field method. Potential field method is attractive method, but that method has great problem called local minimum. So we proposed intermediate point in real area. Intermediate point was set in doorframe and between walls there is connect other room or other area. Intermediate point is very efficiency in computing path. That point is able to smaller area, area divided by intermediate point line. The important idea is intermediate point is permanent point until destruction house or apartment house. Second step is move robot with sensing on front of mobile robot. With sensing, mobile robot recognize obstacle and judge moving obstacle. If mobile robot is reach the intermediate point, robot sensing the surround of point. Mobile robot has data about intermediate point, so mobile robot is able to calibration robots position and direction. Third, we gave uncertainty to robot and obstacles. Because, mobile robot was motion and sensing ability is not enough to control. Robot and obstacle have uncertainty. So, mobile robot planed safe path planning to collision free. Finally, escape local minimum, that has possibility occur robot do not work. Local minimum problem solved by virtual obstacle method. Next is some supposition in real living area.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6C
• /
• pp.560-569
• /
• 2005

This paper proposes an algorithm for transmit antenna selection in a multi-input multi-output(MIMO) spatial multiplexing system with per antenna rate control(PARC) and an ordered successive interference cancellation (OSIC) receiver. The active antenna subset is determined at the receiver and conveyed to the transmitter using feedback information on transmission rate per antenna. We propose a serial decision procedure consisting of a successive process that tests whether antenna selection gain exists when the antenna with the lowest pre-processing signal to interference and noise ratio(SINR) is discarded at each stage. Furthermore, we show that 'reverse detection ordering', whereby the signal with the lowest SINR is decoded at each stage of successive decoding, widens the disparities among fractions of the whole capacity allocated to each individual antenna and thus maximizes a gain of antenna selection. Numerical results show that the proposed reverse detection ordering based serial antenna selection approaches the closed-loop MIMO capacity and that it induces a negligible capacity loss compared with the heuristic selection strategy even with considerably reduced complexity.

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

In this paper, finite impulse response (FIR) smoothers are proposed for discrete-time systems. The proposed FIR smoother is designed under the constraints of linearity, unbiasedness, FIR structure, and independence of the initial state information. It is also obtained by directly minimizing the performance criterion with unbiased constraints. The approach to the MVF smoother proposed in this paper is logical and systematic, while existing results have heuristic assumption, such as infinite covariance of the initial state. Additionally, the proposed MVF smoother is based on the general system model that may have the singular system matrix and has both system and measurement noises. Thorough simulation studies, it is shown that the proposed MVF smoother is more robust against modeling uncertainties numerical errors than fixed-lag Kalman smoother which is infinite impulse response (IIR) type estimator.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.14 no.1
• /
• pp.44-50
• /
• 2015

This paper presents a heuristic process-optimization procedure for minimizing warpage in injection-molded parts based on the dynamic robust design methodology. The injection molding process is known to have intrinsic variations of its process conditions due to various factors, including incomplete process control facilities. The aim of the robust design methodology advocated by Taguchi is to determine the optimum design variables in a system which is robust to variations in uncontrollable factors. The proposed procedure can determine the optimal robust conditions of injection molding processes at a minimum cost through a trade-off strategy between the degree of warpage and the packing time.

• 제어로봇시스템학회:학술대회논문집
• /
• 1986.10a
• /
• pp.431-436
• /
• 1986

The design and manufacture of injection molded polymeic parts with desired mechanical properties is a costly process dominated by empiricism, including the modification of actual tooling. This paper presents an interactive computer-based design system for injection molded plastic parts. This knowledge-based synthesis system provides a rational design strategy for injection molding and molded parts. It synergistically combines a rule-based expert system for hurestic knowledge with analytical process simulation programs. The theremomechanical properties of a molded part such as the effect of molecular orientation and weldline strength are predicted by the analysis programs; while the expert system interprets the analytical results from the process simulation, evaluates the design, and generates recommendations for optimal design alternatives. The heuristic knowledge of injection molding is formalized as production rules of the expert consultation system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.12
• /
• pp.4364-4384
• /
• 2021

The dynamic network state and the mobility of the terminals make the service function chain (SFC) orchestration mechanisms based on static and deterministic assumptions hard to be applied in SDN/NFV mobile edge computing networks. Designing dynamic and online SFC orchestration mechanism can greatly improve the execution efficiency of compute-intensive and resource-hungry applications in mobile edge computing networks. In order to increase the overall profit of service provider and reduce the resource cost, the system running time is divided into a sequence of time slots and a dynamic orchestration scheme based on an improved column generation algorithm is proposed in each slot. Firstly, the SFC dynamic orchestration problem is formulated as an integer linear programming (ILP) model based on layered graph. Then, in order to reduce the computation costs, a column generation model is used to simplify the ILP model. Finally, a two-stage heuristic algorithm based on greedy strategy is proposed. Four metrics are defined and the performance of the proposed algorithm is evaluated based on simulation. The results show that our proposal significantly provides more than 30% reduction of run time and about 12% improvement in service deployment success ratio compared to the Viterbi algorithm based mechanism.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.5
• /
• pp.601-614
• /
• 2006

In this paper, a study on task assignment strategies for a complex real-time network system is presented. Firstly, two task assignment strategies are proposed to improve previous strategies. The proposed strategies assign tasks with meeting end-to-end real-time constraints, and also with optimizing system utilization through period modulation of the tasks. Consequently, the strategies aim at the optimizationto optimize of system performance with while still meeting real-time constraints. The proposed task assignment strategies are devised using the genetic algorithmswith heuristic real-time constraints in the generation of new populations. The strategies are differentiated by the optimization method of the two objectives-meeting end-to-end real-time constraints and optimizing system utilization: the first one has sequential genetic algorithm routines for the objectives, and the second one has one multiple objective genetic algorithm routine to find a Pareto solution. Secondly, the performances of the proposed strategies and a well-known existing task assignment strategy using the BnB(Branch and Bound) optimization are compared with one other through some simulation tests. Through the comparison of the simulation results, the most adequate task assignment strategies are proposed for some as system requirements-: the optimization of system utilization, the maximization of running tasktasks, and the minimization of the number of network node nodesnumber for a network system.

• Journal of the Korea Society for Simulation
• /
• v.28 no.4
• /
• pp.45-56
• /
• 2019

Literatures have considered mathematical model that change the job order of shipper for improving the operation time of yard crane. However, on the real site, it is impossible to change the job order decided according to the shipper's arrival order. Therefore, operation managers have been utilized the relatively simple strategy that job control is better but the process time of yard crane is longer due to the growth of yard crane's interference time and empty drive time. This study proposed a new yard-crane scheduling approach that decided the job order before the shipper's truck arrived the yard terminal. We utilize the Container Pre-Information Notice estimating the arrival time of truck. We developed the container terminal simulation model for validation of the effect of proposed scheduling approach. The results show that the proposed scheduling reduced the interference delay time and empty moving time of yard crane and shipper's truck delay time.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.10a
• /
• pp.211-217
• /
• 1998

Many practical control problems for the complex, uncertain or large-scale plants, need to simultaneously achieve a number of objectives, which may conflict or compete with each other. If the conventional optimization methods are applied to solve these control problems, the solution process may be time-consuming and the resulting solution would ofter lose its original meaning of optimality. Nevertheless, the human operators usually performs satisfactory results based on their qualitative and heuristic knowledge. In this paper, we investigate the control strategies of the human operators, and propose a fuzzy model-based multi-objective satisfactory controller. We also apply it to the automatic train operation(ATO) system for the magnetically levitated vehicles(MAGLEV). One of the human operator's strategies is to predict the control result in order to find the meaningful solution. In this paper, Takagi-Sugeno fuzzy model is used to simulated the prediction procedure. Another str tegy is to evaluate the multiple objectives with respect to their own standards. To realize this strategy, we propose the concept of a satisfactory solution and a satisfactory control scheme. The MAGLEV train is a typical example of the uncertain, complex and large-scale plants. Moreover, the ATO system has to satisfy multiple objectives, such as seed pattern tracking, stop gap accuracy, safety and riding comfort. In this paper, the speed pattern tracking controller and the automatic stop controller of the ATO system is designed based on the proposed control scheme. The effectiveness of the ATO system based on the proposed scheme is shown by the experiments with a rotary test bed and a real MAGLEV train.